<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
	<id>tag:old.nabble.com,2006:forum-31607</id>
	<title>Nabble - OpenStreetMap - Legal Talk</title>
	<updated>2009-12-22T10:27:47Z</updated>
	<link rel="self" type="application/atom+xml" href="http://old.nabble.com/OpenStreetMap---Legal-Talk-f31607.xml" />
	<link rel="alternate" type="text/html" href="http://old.nabble.com/OpenStreetMap---Legal-Talk-f31607.html" />
	<subtitle type="html">The list for discussion of all legal matters relating to Openstreetmap, including licensing and copyright.</subtitle>
	
<entry>
	<id>tag:old.nabble.com,2006:post-26892241</id>
	<title>Re: Answer the questions!</title>
	<published>2009-12-22T10:27:47Z</published>
	<updated>2009-12-22T10:27:47Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Tue, Dec 22, 2009 at 10:19 AM, Lulu-Ann &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26892241&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lulu-Ann@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt; the end of voting comes closer and nobody has answered the questions on
&lt;br&gt;&amp;gt; the license use cases page yet.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; &lt;a href=&quot;http://wiki.openstreetmap.org/wiki/Open_Data_License/Use_Cases&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://wiki.openstreetmap.org/wiki/Open_Data_License/Use_Cases&lt;/a&gt;&lt;br&gt;&lt;br&gt;i think i got them all. and the answers mainly came from reading
&lt;br&gt;things which had been discussed elsewhere, and weren't based on any
&lt;br&gt;new input from counsel, so don't take them as legal advice ;-)
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26892241&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Answer-the-questions%21-tp26886263p26892241.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26886263</id>
	<title>Answer the questions!</title>
	<published>2009-12-22T02:19:26Z</published>
	<updated>2009-12-22T02:19:26Z</updated>
	<author>
		<name>Lulu-Ann</name>
	</author>
	<content type="html">Hi there,
&lt;br&gt;&lt;br&gt;the end of voting comes closer and nobody has answered the questions on
&lt;br&gt;the license use cases page yet.
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://wiki.openstreetmap.org/wiki/Open_Data_License/Use_Cases&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://wiki.openstreetmap.org/wiki/Open_Data_License/Use_Cases&lt;/a&gt;&lt;br&gt;&lt;br&gt;Thanks for answering before the voting ends.
&lt;br&gt;&lt;br&gt;Lulu-Ann
&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26886263&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Answer-the-questions%21-tp26886263p26886263.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26770902</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-13T15:26:40Z</published>
	<updated>2009-12-13T15:26:40Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Sun, Dec 13, 2009 at 8:41 PM, Anthony &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26770902&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;osm@...&lt;/a&gt;&amp;gt; wrote:
&lt;div class='shrinkable-quote'&gt;&lt;br&gt;&amp;gt; On Sun, Dec 13, 2009 at 3:01 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26770902&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; On Sun, Dec 13, 2009 at 6:27 PM, Anthony &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26770902&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;osm@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; Okay, so if company C makes derived database and gives it to company D,
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; then
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; company D creates tiles with that database, company D has to offer the
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; database to anyone who receives the tiles, right?
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; yes, if D is a subcontractor of C. otherwise both C and D must offer it.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; What constitutes being a subcontractor?  Subcontractor as in &amp;quot;work for
&lt;br&gt;&amp;gt; hire&amp;quot;?  C has to offer it to whom?  I thought C only has to offer the
&lt;br&gt;&amp;gt; database to D.
&lt;/div&gt;&lt;br&gt;the wording used in ODbL is &amp;quot;Persons other than You or under Your
&lt;br&gt;control by either more than 50% ownership or by the power to direct
&lt;br&gt;their activities (such as contracting with an independent
&lt;br&gt;consultant).&amp;quot;
&lt;br&gt;&lt;br&gt;oops, what i wrote earlier wasn't quite right: C only has to offer the
&lt;br&gt;database to D, and D has to offer it to recipients of tiles. (unless,
&lt;br&gt;of course, C is &amp;quot;publicly using&amp;quot; the database as well.)
&lt;br&gt;&lt;br&gt;&amp;gt; &amp;quot;You must also offer to recipients of the Derivative Database or Produced
&lt;br&gt;&amp;gt; Work...&amp;quot;
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; So, if Company C makes a derived database, and gives it to Company D, and
&lt;br&gt;&amp;gt; Company D makes a Produced Work, and gives it to Company E, Company C has to
&lt;br&gt;&amp;gt; offer Company E the Derivative Database?
&lt;br&gt;&lt;br&gt;i think at that point company D has to offer the derived database to company E.
&lt;br&gt;&lt;div class='shrinkable-quote'&gt;&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; Can users decline the offer, in which case I can delete the database?
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; Can I
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; give users the option to download the database immediately or to decline
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; the
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; offer, so I don't have to keep historical data around indefinitely?
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; it's not necessary to keep historical data. and you don't have to keep
&lt;br&gt;&amp;gt;&amp;gt; dumps around either. the offer is pretty much &amp;quot;if you contact me, i'll
&lt;br&gt;&amp;gt;&amp;gt; give you my database as close as i can to the version you used&amp;quot;. if
&lt;br&gt;&amp;gt;&amp;gt; you practically can't keep the dumps, then that's not a problem.
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; if you delete all records of the database, then your only options are
&lt;br&gt;&amp;gt;&amp;gt; to recreate it, or reveal the method used to create it.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; So, you kind of didn't answer my question.  If I distribute a produced work,
&lt;br&gt;&amp;gt; can I ask the recipient &amp;quot;Do you want the data?&amp;quot;, and if they say no, then I
&lt;br&gt;&amp;gt; never have to worry about them coming back and saying &amp;quot;okay, now I want the
&lt;br&gt;&amp;gt; data&amp;quot;?
&lt;/div&gt;&lt;br&gt;sorry, i must have misunderstood the question. i think that would be
&lt;br&gt;between you and the recipient.
&lt;br&gt;&lt;br&gt;&amp;gt; I guess if I have to offer even downstream recipients the database, it
&lt;br&gt;&amp;gt; doesn't much matter.  That person might say they don't want the data, and
&lt;br&gt;&amp;gt; then give the produced work to a friend, who then calls me on the phone and
&lt;br&gt;&amp;gt; demands the data.
&lt;br&gt;&lt;br&gt;yeah, the following passage might apply:
&lt;br&gt;&lt;br&gt;&amp;quot;if you Publicly Use a Produced Work, You must include a notice
&lt;br&gt;associated with the Produced Work reasonably calculated to make any
&lt;br&gt;Person that uses, views, accesses, interacts with, or is otherwise
&lt;br&gt;exposed to the Produced Work aware that Content was obtained from the
&lt;br&gt;Database, Derivative Database, or the Database as part of a Collective
&lt;br&gt;Database, and that it is available under this License.&amp;quot;
&lt;br&gt;&lt;br&gt;which seems to imply that the offer extends to anyone who sees your
&lt;br&gt;produced work. i'm not sure how it extends to derivatives (where
&lt;br&gt;permitted) of your produced work, though...
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26770902&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26770902.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26769538</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-13T12:41:59Z</published>
	<updated>2009-12-13T12:41:59Z</updated>
	<author>
		<name>Anthony-32</name>
	</author>
	<content type="html">On Sun, Dec 13, 2009 at 3:01 PM, Matt Amos &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26769538&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;div class=&quot;gmail_quote&quot;&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;im&quot;&gt;On Sun, Dec 13, 2009 at 6:27 PM, Anthony &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26769538&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;osm@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt; Okay, so if company C makes derived database and gives it to company D, then&lt;br&gt;
&amp;gt; company D creates tiles with that database, company D has to offer the&lt;br&gt;
&amp;gt; database to anyone who receives the tiles, right?&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;yes, if D is a subcontractor of C. otherwise both C and D must offer it.&lt;br&gt;&lt;/blockquote&gt;&lt;div&gt;&lt;br&gt;What constitutes being a subcontractor?  Subcontractor as in &amp;quot;work for hire&amp;quot;?  C has to offer it to whom?  I thought C only has to offer the database to D.&lt;br&gt;
&lt;br&gt;&amp;quot;You must also
offer to recipients of the Derivative Database or Produced Work...&amp;quot;&lt;br&gt;&lt;br&gt;So, if Company C makes a derived database, and gives it to Company D, and Company D makes a Produced Work, and gives it to Company E, Company C has to offer Company E the Derivative Database?&lt;br&gt;
&lt;br&gt;&lt;/div&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;im&quot;&gt;&amp;gt; Can users decline the offer, in which case I can delete the database?  Can I&lt;br&gt;
&amp;gt; give users the option to download the database immediately or to decline the&lt;br&gt;
&amp;gt; offer, so I don&amp;#39;t have to keep historical data around indefinitely?&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;it&amp;#39;s not necessary to keep historical data. and you don&amp;#39;t have to keep&lt;br&gt;
dumps around either. the offer is pretty much &amp;quot;if you contact me, i&amp;#39;ll&lt;br&gt;
give you my database as close as i can to the version you used&amp;quot;. if&lt;br&gt;
you practically can&amp;#39;t keep the dumps, then that&amp;#39;s not a problem.&lt;br&gt;
&lt;br&gt;
if you delete all records of the database, then your only options are&lt;br&gt;
to recreate it, or reveal the method used to create it.&lt;br&gt;&lt;/blockquote&gt;&lt;div&gt;&lt;br&gt;So, you kind of didn&amp;#39;t answer my question.  If I distribute a produced work, can I ask the recipient &amp;quot;Do you want the data?&amp;quot;, and if they say no, then I never have to worry about them coming back and saying &amp;quot;okay, now I want the data&amp;quot;?&lt;br&gt;
&lt;br&gt;I guess if I have to offer even downstream recipients the database, it doesn&amp;#39;t much matter.  That person might say they don&amp;#39;t want the data, and then give the produced work to a friend, who then calls me on the phone and demands the data.&lt;br&gt;
&lt;/div&gt;&lt;/div&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26769538&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26769538.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26769210</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-13T12:01:04Z</published>
	<updated>2009-12-13T12:01:04Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Sun, Dec 13, 2009 at 6:27 PM, Anthony &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26769210&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;osm@...&lt;/a&gt;&amp;gt; wrote:
&lt;div class='shrinkable-quote'&gt;&lt;br&gt;&amp;gt; On Sun, Dec 13, 2009 at 1:08 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26769210&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; On Sun, Dec 13, 2009 at 3:37 PM, Anthony &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26769210&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;osm@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; On Sun, Dec 13, 2009 at 2:37 AM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26769210&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; The example I described above clearly demonstrates that you can't
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; differentiate between company A who doesn't use a derived database and
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; company B who does.
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; What if company C makes a derived database and gives it to company D?
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; Does
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; company D have to release the derived database?
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; no. if company D is a subcontractor to company C and no produced works
&lt;br&gt;&amp;gt;&amp;gt; are published. if either company C or D publish produced works from
&lt;br&gt;&amp;gt;&amp;gt; the database, they must make an offer of it. if company D isn't a
&lt;br&gt;&amp;gt;&amp;gt; subcontractor then company C must make an offer of the database.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; Okay, so if company C makes derived database and gives it to company D, then
&lt;br&gt;&amp;gt; company D creates tiles with that database, company D has to offer the
&lt;br&gt;&amp;gt; database to anyone who receives the tiles, right?
&lt;/div&gt;&lt;br&gt;yes, if D is a subcontractor of C. otherwise both C and D must offer it.
&lt;br&gt;&lt;br&gt;&amp;gt; However, if company D downloads the original database from OSM, then company
&lt;br&gt;&amp;gt; D creates tiles with that database, company D doesn't have to offer the
&lt;br&gt;&amp;gt; database to anyone who receives the tiles, right?
&lt;br&gt;&lt;br&gt;they've almost certainly created a derivative database, for example if
&lt;br&gt;they're using postgis+mapnik, so i'd say they would have to offer that
&lt;br&gt;database.
&lt;br&gt;&lt;br&gt;&amp;gt; Rereading the ODbL, this seems like the most natural way to read it.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; Assuming these two points are true, what is considered the original
&lt;br&gt;&amp;gt; database?  Anything on the official (planet.openstreetmap.org) download
&lt;br&gt;&amp;gt; site?  Only databases which were created by OSMF employees?  Only the raw
&lt;br&gt;&amp;gt; on-disk PostgreSQL datastores?  Something else?
&lt;br&gt;&lt;br&gt;technically, it's the on-disk postgresql datastore, plus the server
&lt;br&gt;implementation. the planet is a database dump, and loading that into a
&lt;br&gt;database is creating a derivative.
&lt;br&gt;&lt;br&gt;&amp;gt; If I distribute a tile on March 31, 2010, what exactly do I need to offer?
&lt;br&gt;&amp;gt; The exact portion of the database which is used to create this tile?  If the
&lt;br&gt;&amp;gt; data later changes, I still need to keep the old version in case someone
&lt;br&gt;&amp;gt; takes me up on my offer, right?  Is it enough to keep the full history and
&lt;br&gt;&amp;gt; expect people to look at the timestamps to figure out the state of the
&lt;br&gt;&amp;gt; database at the time of their download?
&lt;br&gt;&lt;br&gt;no. LWG took legal advice on this and it's sufficient to provide the
&lt;br&gt;latest version of the database, or whatever you have which is as close
&lt;br&gt;to the version the user used as possible.
&lt;br&gt;&lt;br&gt;&amp;gt; Can users decline the offer, in which case I can delete the database?  Can I
&lt;br&gt;&amp;gt; give users the option to download the database immediately or to decline the
&lt;br&gt;&amp;gt; offer, so I don't have to keep historical data around indefinitely?
&lt;br&gt;&lt;br&gt;it's not necessary to keep historical data. and you don't have to keep
&lt;br&gt;dumps around either. the offer is pretty much &amp;quot;if you contact me, i'll
&lt;br&gt;give you my database as close as i can to the version you used&amp;quot;. if
&lt;br&gt;you practically can't keep the dumps, then that's not a problem.
&lt;br&gt;&lt;br&gt;if you delete all records of the database, then your only options are
&lt;br&gt;to recreate it, or reveal the method used to create it.
&lt;br&gt;&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; Do they have to mention
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; company C?
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; if D produces works, or further distributes the database or a
&lt;br&gt;&amp;gt;&amp;gt; derivative of it then yes.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; What if company C gives them permission not to, or if company C asks them
&lt;br&gt;&amp;gt; not to reveal who they are?
&lt;br&gt;&lt;br&gt;attribution is at the company's option, so if company C doesn't want
&lt;br&gt;to be attributed then D can't mention them. the reverse is also true,
&lt;br&gt;if company C wants to be attributed then D can't remove that
&lt;br&gt;attribution notice. of course, neither C or D can remove the
&lt;br&gt;attribution to OSM, as OSM wants to be attributed.
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26769210&amp;i=4&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26769210.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26768430</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-13T10:27:24Z</published>
	<updated>2009-12-13T10:27:24Z</updated>
	<author>
		<name>Anthony-32</name>
	</author>
	<content type="html">On Sun, Dec 13, 2009 at 1:08 PM, Matt Amos &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26768430&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;div class=&quot;gmail_quote&quot;&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div&gt;&lt;div&gt;&lt;/div&gt;&lt;div class=&quot;h5&quot;&gt;On Sun, Dec 13, 2009 at 3:37 PM, Anthony &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26768430&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;osm@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt; On Sun, Dec 13, 2009 at 2:37 AM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26768430&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt;&amp;gt;&lt;br&gt;
&amp;gt;&amp;gt; The example I described above clearly demonstrates that you can&amp;#39;t&lt;br&gt;
&amp;gt;&amp;gt; differentiate between company A who doesn&amp;#39;t use a derived database and&lt;br&gt;
&amp;gt;&amp;gt; company B who does.&lt;br&gt;
&amp;gt;&lt;br&gt;
&amp;gt; What if company C makes a derived database and gives it to company D?  Does&lt;br&gt;
&amp;gt; company D have to release the derived database?&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;&lt;/div&gt;no. if company D is a subcontractor to company C and no produced works&lt;br&gt;
are published. if either company C or D publish produced works from&lt;br&gt;
the database, they must make an offer of it. if company D isn&amp;#39;t a&lt;br&gt;
subcontractor then company C must make an offer of the database.&lt;br&gt;&lt;/blockquote&gt;&lt;div&gt;&lt;br&gt;Okay, so if company C makes derived database and gives it to company D, then company D creates tiles with that database, company D has to offer the database to anyone who receives the tiles, right?&lt;br&gt;
&lt;br&gt;However, if company D downloads the original database from OSM, then company D creates tiles with that database, company D doesn&amp;#39;t have to offer the database to anyone who receives the tiles, right?&lt;br&gt;&lt;br&gt;Rereading the ODbL, this seems like the most natural way to read it.&lt;br&gt;
&lt;br&gt;Assuming these two points are true, what is considered the original database?  Anything on the official (&lt;a href=&quot;http://planet.openstreetmap.org&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;planet.openstreetmap.org&lt;/a&gt;) download site?  Only databases which were created by OSMF employees?  Only the raw on-disk PostgreSQL datastores?  Something else?&lt;br&gt;
&lt;br&gt;If I distribute a tile on March 31, 2010, what exactly do I need to offer?  The exact portion of the database which is used to create this tile?  If the data later changes, I still need to keep the old version in case someone takes me up on my offer, right?  Is it enough to keep the full history and expect people to look at the timestamps to figure out the state of the database at the time of their download?&lt;br&gt;
&lt;br&gt;Can users decline the offer, in which case I can delete the database?  Can I give users the option to download the database immediately or to decline the offer, so I don&amp;#39;t have to keep historical data around indefinitely?&lt;br&gt;
&lt;br&gt;&lt;/div&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;im&quot;&gt;&amp;gt; Do they have to mention&lt;br&gt;
&amp;gt; company C?&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;if D produces works, or further distributes the database or a&lt;br&gt;
derivative of it then yes.&lt;br&gt;&lt;/blockquote&gt;&lt;div&gt;&lt;br&gt;What if company C gives them permission not to, or if company C asks them not to reveal who they are?&lt;br&gt;&lt;/div&gt;&lt;/div&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26768430&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26768430.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26768295</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-13T10:08:42Z</published>
	<updated>2009-12-13T10:08:42Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Sun, Dec 13, 2009 at 3:37 PM, Anthony &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26768295&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;osm@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt; On Sun, Dec 13, 2009 at 2:37 AM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26768295&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; The example I described above clearly demonstrates that you can't
&lt;br&gt;&amp;gt;&amp;gt; differentiate between company A who doesn't use a derived database and
&lt;br&gt;&amp;gt;&amp;gt; company B who does.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; What if company C makes a derived database and gives it to company D?  Does
&lt;br&gt;&amp;gt; company D have to release the derived database?
&lt;br&gt;&lt;br&gt;no. if company D is a subcontractor to company C and no produced works
&lt;br&gt;are published. if either company C or D publish produced works from
&lt;br&gt;the database, they must make an offer of it. if company D isn't a
&lt;br&gt;subcontractor then company C must make an offer of the database.
&lt;br&gt;&lt;br&gt;&amp;gt; Do they have to mention
&lt;br&gt;&amp;gt; company C?
&lt;br&gt;&lt;br&gt;if D produces works, or further distributes the database or a
&lt;br&gt;derivative of it then yes.
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26768295&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26768295.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26767091</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-13T07:37:15Z</published>
	<updated>2009-12-13T07:37:15Z</updated>
	<author>
		<name>Anthony-32</name>
	</author>
	<content type="html">On Sun, Dec 13, 2009 at 2:37 AM, 80n &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26767091&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;div class=&quot;gmail_quote&quot;&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;gmail_quote&quot;&gt;The example I described above clearly demonstrates that you can&amp;#39;t differentiate between company A who doesn&amp;#39;t use a derived database and company B who does.&lt;/div&gt;&lt;/blockquote&gt;&lt;div&gt;&lt;br&gt;What if company C makes a derived database and gives it to company D?  Does company D have to release the derived database?  Do they have to mention company C?&lt;br&gt;
&lt;/div&gt;&lt;/div&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26767091&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26767091.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26766374</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-13T06:06:54Z</published>
	<updated>2009-12-13T06:06:54Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Sun, Dec 13, 2009 at 7:37 AM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26766374&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt; It's clearly not the same difficulty.   And the point of this is that it's
&lt;br&gt;&amp;gt; going to be almost impossible to detect a derived database in use.  You said
&lt;br&gt;&amp;gt; yourself that you'd just assume that anyone processing OSM data would be
&lt;br&gt;&amp;gt; presumed to be using a derived database.
&lt;br&gt;&lt;br&gt;it is the same difficulty. it can be almost impossible to detect
&lt;br&gt;whether someone is using OSM data or not, especially if the output
&lt;br&gt;isn't tiles or extra data has been mixed in.
&lt;br&gt;&lt;br&gt;&amp;gt; The example I described above clearly demonstrates that you can't
&lt;br&gt;&amp;gt; differentiate between company A who doesn't use a derived database and
&lt;br&gt;&amp;gt; company B who does.  You counter example, that maps are just as difficult is
&lt;br&gt;&amp;gt; hardly relevant, and incorrect anyway.  In most cases you can detect the
&lt;br&gt;&amp;gt; infringment because you would have the evidence in front of you.
&lt;br&gt;&lt;br&gt;my counter example is relevant, as it shows that the situation isn't
&lt;br&gt;really changing; only the terminology is changing. clearly we aren't
&lt;br&gt;going to be able to agree on this, but for the benefit of anyone else
&lt;br&gt;with the stamina to have reached this far down the thread:
&lt;br&gt;&lt;br&gt;1) if a company is publishing produced works, and isn't making an
&lt;br&gt;offer of a database available, you can contact them and ask them
&lt;br&gt;(politely of course) whether they have forgotten to make an offer of
&lt;br&gt;their derived database available.
&lt;br&gt;&lt;br&gt;2) if a company is publishing maps, and you suspect they're derived
&lt;br&gt;from OSM but aren't appropriately attributed or licensed, you can
&lt;br&gt;contact them and ask them (politely of course) whether they have
&lt;br&gt;forgotten to put the appropriate attribution and license on their
&lt;br&gt;maps.
&lt;br&gt;&lt;br&gt;the situation we have at the moment is that most of these situations
&lt;br&gt;are clearly evidenced. with the ODbL i expect that to remain true,
&lt;br&gt;since it's going to be pretty obvious that company X's
&lt;br&gt;routing/geocoding/tiles aren't rendered directly from planet and will
&lt;br&gt;involve a derivative database. furthermore, i expect that in the
&lt;br&gt;future, as currently, most license violations will stem from an
&lt;br&gt;incomplete understanding of the license, or forgetfulness, more than
&lt;br&gt;maliciousness.
&lt;br&gt;&lt;br&gt;&amp;gt; The reality is that the derived database rule is almost unenforceable in the
&lt;br&gt;&amp;gt; way that you describe it.  It would be a massive drain on OSMF resources to
&lt;br&gt;&amp;gt; try enforcing such a policy and would certainly be a very strong case for
&lt;br&gt;&amp;gt; many commercial companies to avoid OSM data like the plague.
&lt;br&gt;&lt;br&gt;i don't believe so. have you talked to any commercial companies who
&lt;br&gt;would be more put off by the new license than the old?
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26766374&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26766374.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26764176</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T23:37:08Z</published>
	<updated>2009-12-12T23:37:08Z</updated>
	<author>
		<name>80n</name>
	</author>
	<content type="html">&lt;div class=&quot;gmail_quote&quot;&gt;On Sun, Dec 13, 2009 at 1:07 AM, Matt Amos &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26764176&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;im&quot;&gt;On Sat, Dec 12, 2009 at 10:45 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26764176&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt; On Sat, Dec 12, 2009 at 9:20 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26764176&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&lt;/div&gt;&lt;div class=&quot;im&quot;&gt;&amp;gt;&amp;gt; are there easter eggs in OSM? i thought we followed the &amp;quot;on the&lt;br&gt;
&amp;gt;&amp;gt; ground&amp;quot; rule? ;-)&lt;br&gt;
&amp;gt;&lt;br&gt;
&amp;gt; The two are not mutually exclusive.  Ordnance Survey are well known for&lt;br&gt;
&amp;gt; having very accurate maps, they are also known to have easter eggs.&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;sure. but each easter egg is a deliberate inaccuracy.&lt;br&gt;
&lt;div class=&quot;im&quot;&gt;&lt;br&gt;
&amp;gt;&amp;gt; it isn&amp;#39;t a good method of establishing grounds if the data may have&lt;br&gt;
&amp;gt;&amp;gt; been modified by the inclusion of 3rd party data, or processed in a&lt;br&gt;
&amp;gt;&amp;gt; way which would change the visual texture of the data. basically,&lt;br&gt;
&amp;gt;&amp;gt; while sometimes you can be sure there&amp;#39;s a derivative database or that&lt;br&gt;
&amp;gt;&amp;gt; data is from OSM, a lot of times you can&amp;#39;t be.&lt;br&gt;
&amp;gt;&amp;gt;&lt;br&gt;
&amp;gt; I think you&amp;#39;ve lost the thread.  Now, you are arguing that you can&amp;#39;t spot a&lt;br&gt;
&amp;gt; derivative database.&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;i&amp;#39;ve been arguing that from the start. not only have i been saying&lt;br&gt;
it&amp;#39;s difficult to tell if there&amp;#39;s a derivative database, i&amp;#39;ve been&lt;br&gt;
saying it&amp;#39;s the same difficulty as telling if a map is derived from&lt;br&gt;
OSM, or if a binary contains modified GPL code, or if a service is&lt;br&gt;
using modified AGPL code.&lt;br&gt;
&lt;div&gt;&lt;div&gt;&lt;/div&gt;&lt;br&gt;&lt;/div&gt;&lt;/blockquote&gt;&lt;div&gt;&lt;br&gt;It&amp;#39;s clearly not the same difficulty.   And the point of this is that it&amp;#39;s going to be almost impossible to detect a derived database in use.  You said yourself that you&amp;#39;d just assume that anyone processing OSM data would be presumed to be using a derived database.&lt;br&gt;
&lt;br&gt;&lt;/div&gt;&lt;/div&gt;The example I described above clearly demonstrates that you can&amp;#39;t differentiate between company A who doesn&amp;#39;t use a derived database and company B who does.  You counter example, that maps are just as difficult is hardly relevant, and incorrect anyway.  In most cases you can detect the infringment because you would have the evidence in front of you.&lt;br&gt;
&lt;br&gt;The reality is that the derived database rule is almost unenforceable in the way that you describe it.  It would be a massive drain on OSMF resources to try enforcing such a policy and would certainly be a very strong case for many commercial companies to avoid OSM data like the plague.&lt;br&gt;
&lt;br&gt;&lt;br&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26764176&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26764176.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26763092</id>
	<title>Re: ODbL Enforcement (Re:  OBbL and forks)</title>
	<published>2009-12-12T18:24:35Z</published>
	<updated>2009-12-12T18:24:35Z</updated>
	<author>
		<name>James Livingston-2</name>
	</author>
	<content type="html">On 12/12/2009, at 9:15 PM, Rob Myers wrote:
&lt;br&gt;&amp;gt; Rather than naming and shaming, the FSF and the SFLC always work quietly
&lt;br&gt;&amp;gt; to get compliance from people who break the GPL. They don't call them
&lt;br&gt;&amp;gt; out in public or drag their asses to court to make an example of them.
&lt;br&gt;&amp;gt; Legal action and the publicity that brings is a last resort. I think
&lt;br&gt;&amp;gt; that's a better balance.
&lt;br&gt;&lt;br&gt;I definitely agree - most GPL violations are done by someone who accidentally did so, because they didn't understand it properly. Quietly talking to them with the presumption of accidental violation is definitely what we'd want to do.
&lt;br&gt;&lt;br&gt;However there might come a time where someone is wilfully violating it, and talking to them doesn't help. I wasn't trying to start a debate about what we would do, with lawyers costing money and all, but what we could do about it.
&lt;br&gt;&lt;br&gt;&lt;br&gt;I was trying to find out whether my logic for the only real option being the Licensor suing for breach contract was correct, whether OSMF could claim to be the licensor if I got it via a third party. Oh, and jurisdictions would be fun with the lack of proper-law (choice of law) clause, for a contract which could span countries. Especially if the site you downloaded it from sent you to different servers based on geo-IP mapping or something
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26763092&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/OBbL-and-forks-tp26693334p26763092.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26762671</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T17:07:46Z</published>
	<updated>2009-12-12T17:07:46Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Sat, Dec 12, 2009 at 10:45 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26762671&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt; On Sat, Dec 12, 2009 at 9:20 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26762671&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt; are there easter eggs in OSM? i thought we followed the &amp;quot;on the
&lt;br&gt;&amp;gt;&amp;gt; ground&amp;quot; rule? ;-)
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; The two are not mutually exclusive.  Ordnance Survey are well known for
&lt;br&gt;&amp;gt; having very accurate maps, they are also known to have easter eggs.
&lt;br&gt;&lt;br&gt;sure. but each easter egg is a deliberate inaccuracy.
&lt;br&gt;&lt;br&gt;&amp;gt;&amp;gt; it isn't a good method of establishing grounds if the data may have
&lt;br&gt;&amp;gt;&amp;gt; been modified by the inclusion of 3rd party data, or processed in a
&lt;br&gt;&amp;gt;&amp;gt; way which would change the visual texture of the data. basically,
&lt;br&gt;&amp;gt;&amp;gt; while sometimes you can be sure there's a derivative database or that
&lt;br&gt;&amp;gt;&amp;gt; data is from OSM, a lot of times you can't be.
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt; I think you've lost the thread.  Now, you are arguing that you can't spot a
&lt;br&gt;&amp;gt; derivative database.
&lt;br&gt;&lt;br&gt;i've been arguing that from the start. not only have i been saying
&lt;br&gt;it's difficult to tell if there's a derivative database, i've been
&lt;br&gt;saying it's the same difficulty as telling if a map is derived from
&lt;br&gt;OSM, or if a binary contains modified GPL code, or if a service is
&lt;br&gt;using modified AGPL code.
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26762671&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26762671.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26762240</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T15:47:41Z</published>
	<updated>2009-12-12T15:47:41Z</updated>
	<author>
		<name>Frederik Ramm</name>
	</author>
	<content type="html">Hi,
&lt;br&gt;&lt;br&gt;Anthony wrote:
&lt;br&gt;&amp;gt; Where does one draw the line between a &amp;quot;Derivative Database&amp;quot;, a 
&lt;br&gt;&amp;gt; &amp;quot;Collective Database&amp;quot;, and a &amp;quot;Produced Work&amp;quot; anyway? &amp;nbsp;
&lt;br&gt;&lt;br&gt;Part of the answer is, in almost salomonic fashion, here:
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://wiki.openstreetmap.org/wiki/Open_Data_License/Produced_Work_-_Guideline&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://wiki.openstreetmap.org/wiki/Open_Data_License/Produced_Work_-_Guideline&lt;/a&gt;&lt;br&gt;&lt;br&gt;There's also tons of discussions about this on the lists which i suggest 
&lt;br&gt;you could read, e.g. start from
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/pipermail/legal-talk/2009-July/002673.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/pipermail/legal-talk/2009-July/002673.html&lt;/a&gt;&lt;br&gt;&lt;br&gt;Bye
&lt;br&gt;Frederik
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26762240&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26762240.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26762134</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T15:31:33Z</published>
	<updated>2009-12-12T15:31:33Z</updated>
	<author>
		<name>Anthony-32</name>
	</author>
	<content type="html">On Sat, Dec 12, 2009 at 6:26 PM, Anthony &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26762134&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;osm@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;div class=&quot;gmail_quote&quot;&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;gmail_quote&quot;&gt;&lt;div&gt;Where does one draw the line between a &amp;quot;Derivative Database&amp;quot;, a &amp;quot;Collective Database&amp;quot;, and a &amp;quot;Produced Work&amp;quot; anyway?  Can a &amp;quot;Produced Work&amp;quot; also be a &amp;quot;Derivative Database&amp;quot;?  If not, which definition overrides the other?  An image qualifies under the definition of &amp;quot;Database&amp;quot;, does it not?&lt;br&gt;

&lt;/div&gt;&lt;/div&gt;
&lt;/blockquote&gt;&lt;/div&gt;&lt;br&gt;What about a collection of rendered tiles.  That&amp;#39;s gotta be a Derivative Database, doesn&amp;#39;t it?  It&amp;#39;s definitely not a Collective Database.  The individual tiles are Produced Works, but the collection of tiles is a database.
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26762134&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26762134.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26762110</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T15:26:00Z</published>
	<updated>2009-12-12T15:26:00Z</updated>
	<author>
		<name>Anthony-32</name>
	</author>
	<content type="html">On Sat, Dec 12, 2009 at 6:10 PM, Frederik Ramm &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26762110&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;frederik@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;div class=&quot;gmail_quote&quot;&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;

I think we have now established that whenever you do something with OSM&lt;br&gt;
data that involves a derivative database, but just to make things&lt;br&gt;
simpler for you and not as an absolutely necessary component, then&lt;br&gt;
nobody can prove that you are using a derivative database, and nobody&lt;br&gt;
has a legal right to challenge you for an explanation - it&amp;#39;s your&lt;br&gt;
business secret.&lt;br&gt;&lt;/blockquote&gt;&lt;div&gt;&lt;br&gt;Where does one draw the line between a &amp;quot;Derivative Database&amp;quot;, a &amp;quot;Collective Database&amp;quot;, and a &amp;quot;Produced Work&amp;quot; anyway?  Can a &amp;quot;Produced Work&amp;quot; also be a &amp;quot;Derivative Database&amp;quot;?  If not, which definition overrides the other?  An image qualifies under the definition of &amp;quot;Database&amp;quot;, does it not?&lt;br&gt;
&lt;/div&gt;&lt;/div&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26762110&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26762110.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26761999</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T15:10:47Z</published>
	<updated>2009-12-12T15:10:47Z</updated>
	<author>
		<name>Frederik Ramm</name>
	</author>
	<content type="html">Hi,
&lt;br&gt;&lt;br&gt;80n wrote:
&lt;br&gt;&amp;gt; I think you've lost the thread. &amp;nbsp;Now, you are arguing that you can't 
&lt;br&gt;&amp;gt; spot a derivative database.
&lt;br&gt;&lt;br&gt;My original question was aiming at whether or not there are ways to 
&lt;br&gt;weasel yourself out of the requirement release derivative databases or 
&lt;br&gt;the algorithms leading to them.
&lt;br&gt;&lt;br&gt;I think we have now established that whenever you do something with OSM 
&lt;br&gt;data that involves a derivative database, but just to make things 
&lt;br&gt;simpler for you and not as an absolutely necessary component, then 
&lt;br&gt;nobody can prove that you are using a derivative database, and nobody 
&lt;br&gt;has a legal right to challenge you for an explanation - it's your 
&lt;br&gt;business secret.
&lt;br&gt;&lt;br&gt;People can write to you and ask; and if you don't reply (or reply that 
&lt;br&gt;you don't use a derivative database) all they can do is sue you for 
&lt;br&gt;breach of license and hope that the judicial process finds out the truth.
&lt;br&gt;&lt;br&gt;It is not such a big difference from what we have today. Even with 
&lt;br&gt;Easter Eggs and all, I can never prove beyond doubt that someone is 
&lt;br&gt;using OSM, I can only collect evidence and then ask a court to clear 
&lt;br&gt;things up.
&lt;br&gt;&lt;br&gt;But it is probably easier to collect that type of evidence than to 
&lt;br&gt;collect evidence for someone having a secret derived database.
&lt;br&gt;&lt;br&gt;Bye
&lt;br&gt;Frederik
&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761999&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26761999.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26761896</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T14:56:03Z</published>
	<updated>2009-12-12T14:56:03Z</updated>
	<author>
		<name>Frederik Ramm</name>
	</author>
	<content type="html">Hi,
&lt;br&gt;&lt;br&gt;Matt Amos wrote:
&lt;br&gt;&amp;gt; let's assume it's known that this company is definitely using OSM data
&lt;br&gt;&amp;gt; - determining that can be difficult, depending on exactly what it is
&lt;br&gt;&amp;gt; they're doing with the data. in general, it's very difficult to do
&lt;br&gt;&amp;gt; anything directly from the planet file alone, so i'd suspect that any
&lt;br&gt;&amp;gt; company doing anything with OSM data has a derived database of some
&lt;br&gt;&amp;gt; kind and, if there's no offer evident on their site, i'd contact them
&lt;br&gt;&amp;gt; about it.
&lt;br&gt;&lt;br&gt;I think it would be great to have some standardised &amp;quot;declaration form&amp;quot; 
&lt;br&gt;that we could point people to. Not something that people are forced to 
&lt;br&gt;use, but something they *can* use as an easy way to help them play by 
&lt;br&gt;the terms of the license if they want. Something like this:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;------------------------------
&lt;br&gt;&lt;br&gt;This site publicly uses data derived from OpenStreetMap.
&lt;br&gt;&lt;br&gt;Description of derived data: .......................................
&lt;br&gt;&lt;br&gt;[ ] We are making the derived data available
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp;[ ] here: .......................
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;in the following format: .....................
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;on a regular basis, licensed under the ODbL.
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp;[ ] on request; please contact ..................
&lt;br&gt;&lt;br&gt;[ ] We are making a &amp;quot;diff&amp;quot; file available that allows you to arrie at 
&lt;br&gt;the derived data if you have a recent OpenStreetMap database,
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp;[ ] here: ........................
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;in the following format: .....................
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;on a regular basis, licensed under the ODbL.
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp;[ ] on request; please contact ..................
&lt;br&gt;&lt;br&gt;[ ] We are providing a machine-readable description of the algorithm
&lt;br&gt;used to arrive at the derived data,
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp;[ ] here: ........................
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp;[ ] on request; please contact ..................
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;------------------------------
&lt;br&gt;&lt;br&gt;Another idea, again entirely voluntarily, would be to set up a register 
&lt;br&gt;of organisations using OpenStreetMap data, where they could create an 
&lt;br&gt;account and make the above declarations. If we sell that well, with a 
&lt;br&gt;&amp;quot;wizard&amp;quot; kind of user interface that guides them through their 
&lt;br&gt;obligations regarding ODbL, then many people would probably use it 
&lt;br&gt;because it makes everything simpler for them. The über cool thing about 
&lt;br&gt;this is that we'd get a list of OSM-using people for free ;-)
&lt;br&gt;&lt;br&gt;Bye
&lt;br&gt;Frederik
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761896&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26761896.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26761822</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T14:45:38Z</published>
	<updated>2009-12-12T14:45:38Z</updated>
	<author>
		<name>80n</name>
	</author>
	<content type="html">&lt;div class=&quot;gmail_quote&quot;&gt;On Sat, Dec 12, 2009 at 9:20 PM, Matt Amos &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761822&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;im&quot;&gt;On Sat, Dec 12, 2009 at 9:03 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761822&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt; On Sat, Dec 12, 2009 at 8:44 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761822&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&lt;/div&gt;&lt;div class=&quot;im&quot;&gt;&lt;/div&gt;&lt;/blockquote&gt;&amp;gt;&amp;gt; a lack of attribution is evident, but whether they&amp;#39;re using OSM data&lt;br&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;im&quot;&gt;
&amp;gt;&amp;gt; isn&amp;#39;t. you have no grounds for suspicion, but you might have a gut&lt;br&gt;
&amp;gt;&amp;gt; instinct. what do you do?&lt;br&gt;
&amp;gt;&amp;gt;&lt;br&gt;
&amp;gt; If you have no grounds for suspicion then you do nothing.&lt;br&gt;
&amp;gt;&lt;br&gt;
&amp;gt; But checking the Easter Eggs is a pretty good method of establishing grounds&lt;br&gt;
&amp;gt; in your example.  That doesn&amp;#39;t hold true for the derived databases in my&lt;br&gt;
&amp;gt; scenario.&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;are there easter eggs in OSM? i thought we followed the &amp;quot;on the&lt;br&gt;
ground&amp;quot; rule? ;-)&lt;/blockquote&gt;The two are not mutually exclusive.  Ordnance Survey are well known for having very accurate maps, they are also known to have easter eggs.&lt;br&gt;&lt;div&gt; &lt;/div&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;

&lt;br&gt;
it isn&amp;#39;t a good method of establishing grounds if the data may have&lt;br&gt;
been modified by the inclusion of 3rd party data, or processed in a&lt;br&gt;
way which would change the visual texture of the data. basically,&lt;br&gt;
while sometimes you can be sure there&amp;#39;s a derivative database or that&lt;br&gt;
data is from OSM, a lot of times you can&amp;#39;t be.&lt;br&gt;
&lt;div&gt;&lt;div&gt;&lt;/div&gt;&lt;div class=&quot;h5&quot;&gt;&lt;br&gt;&lt;/div&gt;&lt;/div&gt;&lt;/blockquote&gt;&lt;/div&gt;I think you&amp;#39;ve lost the thread.  Now, you are arguing that you can&amp;#39;t spot a derivative database.&lt;br&gt;&lt;br&gt;&lt;br&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761822&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26761822.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26761230</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T13:20:31Z</published>
	<updated>2009-12-12T13:20:31Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Sat, Dec 12, 2009 at 9:03 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761230&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;div class='shrinkable-quote'&gt;&lt;br&gt;&amp;gt; On Sat, Dec 12, 2009 at 8:44 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761230&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt; a lack of attribution is evident, but whether they're using OSM data
&lt;br&gt;&amp;gt;&amp;gt; isn't. you have no grounds for suspicion, but you might have a gut
&lt;br&gt;&amp;gt;&amp;gt; instinct. what do you do?
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt; If you have no grounds for suspicion then you do nothing.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; But checking the Easter Eggs is a pretty good method of establishing grounds
&lt;br&gt;&amp;gt; in your example.  That doesn't hold true for the derived databases in my
&lt;br&gt;&amp;gt; scenario.
&lt;/div&gt;&lt;br&gt;are there easter eggs in OSM? i thought we followed the &amp;quot;on the
&lt;br&gt;ground&amp;quot; rule? ;-)
&lt;br&gt;&lt;br&gt;it isn't a good method of establishing grounds if the data may have
&lt;br&gt;been modified by the inclusion of 3rd party data, or processed in a
&lt;br&gt;way which would change the visual texture of the data. basically,
&lt;br&gt;while sometimes you can be sure there's a derivative database or that
&lt;br&gt;data is from OSM, a lot of times you can't be.
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761230&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26761230.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26761136</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T13:03:17Z</published>
	<updated>2009-12-12T13:03:17Z</updated>
	<author>
		<name>80n</name>
	</author>
	<content type="html">&lt;div class=&quot;gmail_quote&quot;&gt;On Sat, Dec 12, 2009 at 8:44 PM, Matt Amos &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761136&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;im&quot;&gt;On Sat, Dec 12, 2009 at 8:20 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761136&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt; On Sat, Dec 12, 2009 at 8:09 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761136&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt;&amp;gt;&lt;br&gt;
&amp;gt;&amp;gt; On Sat, Dec 12, 2009 at 6:30 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761136&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt; On Sat, Dec 12, 2009 at 4:13 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761136&amp;i=4&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt;&amp;gt; On Sat, Dec 12, 2009 at 3:43 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761136&amp;i=5&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt;&amp;gt; &amp;gt; What kind of duck test can you use to be sure that a derived database&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt;&amp;gt; &amp;gt; is&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt;&amp;gt; &amp;gt; involved in the process?&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt;&amp;gt;&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt;&amp;gt; if you suspect that someone is using a derived database, and isn&amp;#39;t&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt;&amp;gt; making an offer of it, you are suspecting that they are in breach of&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt;&amp;gt; the ODbL. this can be tested by asking the company and, if they don&amp;#39;t&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt;&amp;gt; provide a satisfactory response, legal proceedings could follow.&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt;&amp;gt;&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt; Exactly.  On what grounds would you suspect that either company was&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt; using a&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt; derived database?&lt;br&gt;
&amp;gt;&amp;gt;&lt;br&gt;
&amp;gt;&amp;gt; by whatever grounds you&amp;#39;d suspect that a company was providing&lt;br&gt;
&amp;gt;&amp;gt; services based on AGPL software, or distributing a binary&lt;br&gt;
&amp;gt;&amp;gt; incorporating GPL software - gut instinct ;-)&lt;br&gt;
&amp;gt;&lt;br&gt;
&amp;gt; In the scenario I described you&amp;#39;d have no grounds for suspicion.&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;yes. and you&amp;#39;d have no grounds for suspicion if a company were using&lt;br&gt;
modified AGPL software, so you have to rely on gut instinct.&lt;br&gt;
&lt;div class=&quot;im&quot;&gt;&lt;br&gt;
&amp;gt;&amp;gt; let&amp;#39;s assume it&amp;#39;s known that this company is definitely using OSM data&lt;br&gt;
&amp;gt;&amp;gt; - determining that can be difficult, depending on exactly what it is&lt;br&gt;
&amp;gt;&amp;gt; they&amp;#39;re doing with the data. in general, it&amp;#39;s very difficult to do&lt;br&gt;
&amp;gt;&amp;gt; anything directly from the planet file alone, so i&amp;#39;d suspect that any&lt;br&gt;
&amp;gt;&amp;gt; company doing anything with OSM data has a derived database of some&lt;br&gt;
&amp;gt;&amp;gt; kind and, if there&amp;#39;s no offer evident on their site, i&amp;#39;d contact them&lt;br&gt;
&amp;gt;&amp;gt; about it.&lt;br&gt;
&amp;gt;&amp;gt;&lt;br&gt;
&amp;gt; You&amp;#39;re going to do that for every single organisation that publishes some&lt;br&gt;
&amp;gt; kind of OSM data?!!  Good luck.&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;no, i&amp;#39;m going to assume that most organisations and are going to read&lt;br&gt;
the license and abide by it, the same way they&amp;#39;d read and abide by any&lt;br&gt;
other open source/content license.&lt;br&gt;
&lt;div class=&quot;im&quot;&gt;&lt;br&gt;
&amp;gt;&amp;gt; it&amp;#39;s a similar situation to looking at a site and thinking they&amp;#39;re&lt;br&gt;
&amp;gt;&amp;gt; using OSM data to render a map, without respecting the license. it&amp;#39;s&lt;br&gt;
&amp;gt;&amp;gt; entirely possible that they have some other data source, or have&lt;br&gt;
&amp;gt;&amp;gt; collected the data themselves. so it&amp;#39;s a gut instinct whether or not&lt;br&gt;
&amp;gt;&amp;gt; you think any of the data has come from OSM and should be followed up.&lt;br&gt;
&amp;gt;&lt;br&gt;
&amp;gt; Not at all.  The lack of attribution is self evident.  A derived database is&lt;br&gt;
&amp;gt; not at all evident.&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;company A: publishing a map with no attribution, but it&amp;#39;s at least&lt;br&gt;
partly derived from OSM.&lt;br&gt;
company B: publishing a map with no attribution and it&amp;#39;s all their own data.&lt;br&gt;
&lt;br&gt;
a lack of attribution is evident, but whether they&amp;#39;re using OSM data&lt;br&gt;
isn&amp;#39;t. you have no grounds for suspicion, but you might have a gut&lt;br&gt;
instinct. what do you do?&lt;br&gt;
&lt;div&gt;&lt;div&gt;&lt;/div&gt;&lt;div class=&quot;h5&quot;&gt;&lt;br&gt;&lt;/div&gt;&lt;/div&gt;&lt;/blockquote&gt;&lt;/div&gt;If you have no grounds for suspicion then you do nothing.  &lt;br&gt;&lt;br&gt;But checking the Easter Eggs is a pretty good method of establishing grounds in your example.  That doesn&amp;#39;t hold true for the derived databases in my scenario.&lt;br&gt;
&lt;br&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26761136&amp;i=6&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26761136.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26760998</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T12:44:11Z</published>
	<updated>2009-12-12T12:44:11Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Sat, Dec 12, 2009 at 8:20 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760998&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;div class='shrinkable-quote'&gt;&lt;br&gt;&amp;gt; On Sat, Dec 12, 2009 at 8:09 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760998&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; On Sat, Dec 12, 2009 at 6:30 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760998&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; On Sat, Dec 12, 2009 at 4:13 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760998&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; On Sat, Dec 12, 2009 at 3:43 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760998&amp;i=4&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; &amp;gt; What kind of duck test can you use to be sure that a derived database
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; &amp;gt; is
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; &amp;gt; involved in the process?
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; if you suspect that someone is using a derived database, and isn't
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; making an offer of it, you are suspecting that they are in breach of
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; the ODbL. this can be tested by asking the company and, if they don't
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt; provide a satisfactory response, legal proceedings could follow.
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; Exactly.  On what grounds would you suspect that either company was
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; using a
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; derived database?
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; by whatever grounds you'd suspect that a company was providing
&lt;br&gt;&amp;gt;&amp;gt; services based on AGPL software, or distributing a binary
&lt;br&gt;&amp;gt;&amp;gt; incorporating GPL software - gut instinct ;-)
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; In the scenario I described you'd have no grounds for suspicion.
&lt;/div&gt;&lt;br&gt;yes. and you'd have no grounds for suspicion if a company were using
&lt;br&gt;modified AGPL software, so you have to rely on gut instinct.
&lt;br&gt;&lt;div class='shrinkable-quote'&gt;&lt;br&gt;&amp;gt;&amp;gt; let's assume it's known that this company is definitely using OSM data
&lt;br&gt;&amp;gt;&amp;gt; - determining that can be difficult, depending on exactly what it is
&lt;br&gt;&amp;gt;&amp;gt; they're doing with the data. in general, it's very difficult to do
&lt;br&gt;&amp;gt;&amp;gt; anything directly from the planet file alone, so i'd suspect that any
&lt;br&gt;&amp;gt;&amp;gt; company doing anything with OSM data has a derived database of some
&lt;br&gt;&amp;gt;&amp;gt; kind and, if there's no offer evident on their site, i'd contact them
&lt;br&gt;&amp;gt;&amp;gt; about it.
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt; You're going to do that for every single organisation that publishes some
&lt;br&gt;&amp;gt; kind of OSM data?!!  Good luck.
&lt;/div&gt;&lt;br&gt;no, i'm going to assume that most organisations and are going to read
&lt;br&gt;the license and abide by it, the same way they'd read and abide by any
&lt;br&gt;other open source/content license.
&lt;br&gt;&lt;br&gt;&amp;gt;&amp;gt; it's a similar situation to looking at a site and thinking they're
&lt;br&gt;&amp;gt;&amp;gt; using OSM data to render a map, without respecting the license. it's
&lt;br&gt;&amp;gt;&amp;gt; entirely possible that they have some other data source, or have
&lt;br&gt;&amp;gt;&amp;gt; collected the data themselves. so it's a gut instinct whether or not
&lt;br&gt;&amp;gt;&amp;gt; you think any of the data has come from OSM and should be followed up.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; Not at all.  The lack of attribution is self evident.  A derived database is
&lt;br&gt;&amp;gt; not at all evident.
&lt;br&gt;&lt;br&gt;company A: publishing a map with no attribution, but it's at least
&lt;br&gt;partly derived from OSM.
&lt;br&gt;company B: publishing a map with no attribution and it's all their own data.
&lt;br&gt;&lt;br&gt;a lack of attribution is evident, but whether they're using OSM data
&lt;br&gt;isn't. you have no grounds for suspicion, but you might have a gut
&lt;br&gt;instinct. what do you do?
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760998&amp;i=5&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26760998.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26760837</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T12:20:27Z</published>
	<updated>2009-12-12T12:20:27Z</updated>
	<author>
		<name>80n</name>
	</author>
	<content type="html">&lt;div class=&quot;gmail_quote&quot;&gt;On Sat, Dec 12, 2009 at 8:09 PM, Matt Amos &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760837&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;im&quot;&gt;On Sat, Dec 12, 2009 at 6:30 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760837&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt; On Sat, Dec 12, 2009 at 4:13 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760837&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt;&amp;gt; On Sat, Dec 12, 2009 at 3:43 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760837&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&lt;/div&gt;&lt;div class=&quot;im&quot;&gt;&amp;gt;&amp;gt; &amp;gt; What kind of duck test can you use to be sure that a derived database is&lt;br&gt;
&amp;gt;&amp;gt; &amp;gt; involved in the process?&lt;br&gt;
&amp;gt;&amp;gt;&lt;br&gt;
&amp;gt;&amp;gt; if you suspect that someone is using a derived database, and isn&amp;#39;t&lt;br&gt;
&amp;gt;&amp;gt; making an offer of it, you are suspecting that they are in breach of&lt;br&gt;
&amp;gt;&amp;gt; the ODbL. this can be tested by asking the company and, if they don&amp;#39;t&lt;br&gt;
&amp;gt;&amp;gt; provide a satisfactory response, legal proceedings could follow.&lt;br&gt;
&amp;gt;&amp;gt;&lt;br&gt;
&amp;gt; Exactly.  On what grounds would you suspect that either company was using a&lt;br&gt;
&amp;gt; derived database?&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;by whatever grounds you&amp;#39;d suspect that a company was providing&lt;br&gt;
services based on AGPL software, or distributing a binary&lt;br&gt;
incorporating GPL software - gut instinct ;-)&lt;br&gt;&lt;/blockquote&gt;&lt;div&gt;&lt;br&gt;In the scenario I described you&amp;#39;d have no grounds for suspicion.&lt;br&gt;&lt;br&gt;&lt;/div&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;

&lt;br&gt;
let&amp;#39;s assume it&amp;#39;s known that this company is definitely using OSM data&lt;br&gt;
- determining that can be difficult, depending on exactly what it is&lt;br&gt;
they&amp;#39;re doing with the data. in general, it&amp;#39;s very difficult to do&lt;br&gt;
anything directly from the planet file alone, so i&amp;#39;d suspect that any&lt;br&gt;
company doing anything with OSM data has a derived database of some&lt;br&gt;
kind and, if there&amp;#39;s no offer evident on their site, i&amp;#39;d contact them&lt;br&gt;
about it.&lt;br&gt;
&lt;br&gt;&lt;/blockquote&gt;&lt;div&gt;You&amp;#39;re going to do that for every single organisation that publishes some kind of OSM data?!!  Good luck.&lt;br&gt;&lt;br&gt; &lt;/div&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;

it&amp;#39;s a similar situation to looking at a site and thinking they&amp;#39;re&lt;br&gt;
using OSM data to render a map, without respecting the license. it&amp;#39;s&lt;br&gt;
entirely possible that they have some other data source, or have&lt;br&gt;
collected the data themselves. so it&amp;#39;s a gut instinct whether or not&lt;br&gt;
you think any of the data has come from OSM and should be followed up.&lt;br&gt;&lt;/blockquote&gt;&lt;div&gt;&lt;br&gt;Not at all.  The lack of attribution is self evident.  A derived database is not at all evident.&lt;br&gt;&lt;br&gt; &lt;/div&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;

&lt;div&gt;&lt;div&gt;&lt;/div&gt;&lt;div class=&quot;h5&quot;&gt;&lt;br&gt;
cheers,&lt;br&gt;
&lt;br&gt;
matt&lt;br&gt;
&lt;br&gt;
_______________________________________________&lt;br&gt;
legal-talk mailing list&lt;br&gt;
&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760837&amp;i=4&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;&lt;br&gt;
&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_blank&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;
&lt;/div&gt;&lt;/div&gt;&lt;/blockquote&gt;&lt;/div&gt;&lt;br&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760837&amp;i=5&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26760837.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26760738</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T12:09:46Z</published>
	<updated>2009-12-12T12:09:46Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Sat, Dec 12, 2009 at 6:30 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760738&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;div class='shrinkable-quote'&gt;&lt;br&gt;&amp;gt; On Sat, Dec 12, 2009 at 4:13 PM, Matt Amos &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760738&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt; On Sat, Dec 12, 2009 at 3:43 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760738&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; What kind of duck test can you use to be sure that a derived database is
&lt;br&gt;&amp;gt;&amp;gt; &amp;gt; involved in the process?
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; if you suspect that someone is using a derived database, and isn't
&lt;br&gt;&amp;gt;&amp;gt; making an offer of it, you are suspecting that they are in breach of
&lt;br&gt;&amp;gt;&amp;gt; the ODbL. this can be tested by asking the company and, if they don't
&lt;br&gt;&amp;gt;&amp;gt; provide a satisfactory response, legal proceedings could follow.
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt; Exactly.  On what grounds would you suspect that either company was using a
&lt;br&gt;&amp;gt; derived database?
&lt;/div&gt;&lt;br&gt;by whatever grounds you'd suspect that a company was providing
&lt;br&gt;services based on AGPL software, or distributing a binary
&lt;br&gt;incorporating GPL software - gut instinct ;-)
&lt;br&gt;&lt;br&gt;let's assume it's known that this company is definitely using OSM data
&lt;br&gt;- determining that can be difficult, depending on exactly what it is
&lt;br&gt;they're doing with the data. in general, it's very difficult to do
&lt;br&gt;anything directly from the planet file alone, so i'd suspect that any
&lt;br&gt;company doing anything with OSM data has a derived database of some
&lt;br&gt;kind and, if there's no offer evident on their site, i'd contact them
&lt;br&gt;about it.
&lt;br&gt;&lt;br&gt;it's a similar situation to looking at a site and thinking they're
&lt;br&gt;using OSM data to render a map, without respecting the license. it's
&lt;br&gt;entirely possible that they have some other data source, or have
&lt;br&gt;collected the data themselves. so it's a gut instinct whether or not
&lt;br&gt;you think any of the data has come from OSM and should be followed up.
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760738&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26760738.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26760023</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T10:30:21Z</published>
	<updated>2009-12-12T10:30:21Z</updated>
	<author>
		<name>80n</name>
	</author>
	<content type="html">&lt;div class=&quot;gmail_quote&quot;&gt;On Sat, Dec 12, 2009 at 4:13 PM, Matt Amos &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760023&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;zerebubuth@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div class=&quot;im&quot;&gt;On Sat, Dec 12, 2009 at 3:43 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760023&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:&lt;br&gt;
&amp;gt; On what basis can you demand from company B that they release their&lt;br&gt;
&amp;gt; intermediate database?  You don&amp;#39;t know (for sure) that they have an&lt;br&gt;
&amp;gt; intermediate database.  The ODbL doesn&amp;#39;t give you any rights to ask company&lt;br&gt;
&amp;gt; A to warrant that they are not using an intermediate database.&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;company B is required, under the ODbL, to provide an offer of their&lt;br&gt;
derived database (or a diff, etc...).&lt;br&gt;
&lt;div class=&quot;im&quot;&gt;&lt;br&gt;
&amp;gt; What kind of duck test can you use to be sure that a derived database is&lt;br&gt;
&amp;gt; involved in the process?&lt;br&gt;
&lt;br&gt;
&lt;/div&gt;if you suspect that someone is using a derived database, and isn&amp;#39;t&lt;br&gt;
making an offer of it, you are suspecting that they are in breach of&lt;br&gt;
the ODbL. this can be tested by asking the company and, if they don&amp;#39;t&lt;br&gt;
provide a satisfactory response, legal proceedings could follow.&lt;br&gt;
&lt;br&gt;&lt;/blockquote&gt;&lt;div&gt;Exactly.  On what grounds would you suspect that either company was using a derived database?&lt;br&gt;&lt;br&gt;&lt;br&gt; &lt;/div&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;

this is similar to the AGPL. if you suspected that someone was&lt;br&gt;
distributing or allowing &amp;quot;users [to] interact[...] remotely through a&lt;br&gt;
computer network&amp;quot; with a derivative version of AGPL&amp;#39;d code, you could&lt;br&gt;
ask them where the corresponding offer is and, if they don&amp;#39;t provide a&lt;br&gt;
satisfactory response, legal proceedings could follow.&lt;br&gt;
&lt;br&gt;
cheers,&lt;br&gt;
&lt;font color=&quot;#888888&quot;&gt;&lt;br&gt;
matt&lt;br&gt;
&lt;/font&gt;&lt;div&gt;&lt;div&gt;&lt;/div&gt;&lt;div class=&quot;h5&quot;&gt;&lt;br&gt;
_______________________________________________&lt;br&gt;
legal-talk mailing list&lt;br&gt;
&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760023&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;&lt;br&gt;
&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_blank&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;
&lt;/div&gt;&lt;/div&gt;&lt;/blockquote&gt;&lt;/div&gt;&lt;br&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26760023&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26760023.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26758806</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T08:13:15Z</published>
	<updated>2009-12-12T08:13:15Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Sat, Dec 12, 2009 at 3:43 PM, 80n &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26758806&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;80n80n@...&lt;/a&gt;&amp;gt; wrote:
&lt;br&gt;&amp;gt; On what basis can you demand from company B that they release their
&lt;br&gt;&amp;gt; intermediate database?  You don't know (for sure) that they have an
&lt;br&gt;&amp;gt; intermediate database.  The ODbL doesn't give you any rights to ask company
&lt;br&gt;&amp;gt; A to warrant that they are not using an intermediate database.
&lt;br&gt;&lt;br&gt;company B is required, under the ODbL, to provide an offer of their
&lt;br&gt;derived database (or a diff, etc...).
&lt;br&gt;&lt;br&gt;&amp;gt; What kind of duck test can you use to be sure that a derived database is
&lt;br&gt;&amp;gt; involved in the process?
&lt;br&gt;&lt;br&gt;if you suspect that someone is using a derived database, and isn't
&lt;br&gt;making an offer of it, you are suspecting that they are in breach of
&lt;br&gt;the ODbL. this can be tested by asking the company and, if they don't
&lt;br&gt;provide a satisfactory response, legal proceedings could follow.
&lt;br&gt;&lt;br&gt;this is similar to the AGPL. if you suspected that someone was
&lt;br&gt;distributing or allowing &amp;quot;users [to] interact[...] remotely through a
&lt;br&gt;computer network&amp;quot; with a derivative version of AGPL'd code, you could
&lt;br&gt;ask them where the corresponding offer is and, if they don't provide a
&lt;br&gt;satisfactory response, legal proceedings could follow.
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26758806&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26758806.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26758688</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T07:58:39Z</published>
	<updated>2009-12-12T07:58:39Z</updated>
	<author>
		<name>Matt Amos-3</name>
	</author>
	<content type="html">On Sat, Dec 12, 2009 at 12:07 PM, Frederik Ramm &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26758688&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;frederik@...&lt;/a&gt;&amp;gt; wrote:
&lt;div class='shrinkable-quote'&gt;&lt;br&gt;&amp;gt; Hi,
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt;    OdbL has this requirement where, if you publish a produced work
&lt;br&gt;&amp;gt; based on a derived database, you also have to publish either
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; (a) the derived database or
&lt;br&gt;&amp;gt; (b) a &amp;quot;diff&amp;quot; allowing someone to arrive at the derived database if he
&lt;br&gt;&amp;gt; has the original, publicly available database or
&lt;br&gt;&amp;gt; (c) an algorithm that does the same.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; Is that correct so far?
&lt;/div&gt;&lt;br&gt;you don't have to publish any of these. the language used is that you
&lt;br&gt;have to &amp;quot;offer&amp;quot; these things, which means you don't have to be able to
&lt;br&gt;host these things. for example, sending a DVD through the post is in
&lt;br&gt;compliance with the license.
&lt;br&gt;&lt;br&gt;also, these things have to be &amp;quot;in a machine readable form&amp;quot;.
&lt;br&gt;&lt;br&gt;&amp;gt; I guess it would probably permitted to specify a number of PostGIS
&lt;br&gt;&amp;gt; commands that achieve the changes. - Let us assume for a moment that
&lt;br&gt;&amp;gt; applying these PostGIS commands would require a machine with 192 GB of
&lt;br&gt;&amp;gt; RAM and Quad Quadcore processors and still take two weeks to complete,
&lt;br&gt;&amp;gt; putting it out of reach of many users. Would it still be permitted to do
&lt;br&gt;&amp;gt; that?
&lt;br&gt;&lt;br&gt;yes.
&lt;br&gt;&lt;br&gt;&amp;gt; Or, would it be allowable to say: &amp;quot;For simplification, a Douglas-Peucker
&lt;br&gt;&amp;gt; algorithm &amp;lt;link to DP wikipedia entry&amp;gt; is used.&amp;quot; (leaving open the exact
&lt;br&gt;&amp;gt; implementation and parametrisation of DP - bear in mind that with some
&lt;br&gt;&amp;gt; algorithms, how they work is easily explained but implementing them in a
&lt;br&gt;&amp;gt; way that runs on standard hardware may be a hard task).
&lt;br&gt;&lt;br&gt;no, i don't believe this would constitute &amp;quot;machine readable form&amp;quot;.
&lt;br&gt;&lt;br&gt;&amp;gt; Or, would it be allowed to say: &amp;quot;For simplification, just load the data
&lt;br&gt;&amp;gt; set into &amp;lt;name of horribly expensive proprietary ESRI program&amp;gt; and hit
&lt;br&gt;&amp;gt; Ctrl-S X Y, then choose Export to PostGIS&amp;quot;?
&lt;br&gt;&lt;br&gt;i think this would constitute &amp;quot;technological measures&amp;quot; of restriction,
&lt;br&gt;so i think you'd need to provide a parallel distribution of the full
&lt;br&gt;unrestricted output.
&lt;br&gt;&lt;br&gt;&amp;gt; What about: &amp;quot;For simplification, we did the following steps: &amp;lt;detailed
&lt;br&gt;&amp;gt; instructions that are easy to follow&amp;gt;. These steps in this sequence are
&lt;br&gt;&amp;gt; patented by us, so if you want to follow them, please apply to us for a
&lt;br&gt;&amp;gt; license to use our patent.&amp;quot;
&lt;br&gt;&lt;br&gt;again, i think this would constitute &amp;quot;technological measures&amp;quot;, and
&lt;br&gt;would require a parallel unrestricted distribution.
&lt;br&gt;&lt;br&gt;cheers,
&lt;br&gt;&lt;br&gt;matt
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26758688&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26758688.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26758575</id>
	<title>Re: ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T07:43:57Z</published>
	<updated>2009-12-12T07:43:57Z</updated>
	<author>
		<name>80n</name>
	</author>
	<content type="html">&lt;div class=&quot;gmail_quote&quot;&gt;On Sat, Dec 12, 2009 at 12:07 PM, Frederik Ramm &lt;span dir=&quot;ltr&quot;&gt;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26758575&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;frederik@...&lt;/a&gt;&amp;gt;&lt;/span&gt; wrote:&lt;br&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
Hi,&lt;br&gt;
&lt;br&gt;
    OdbL has this requirement where, if you publish a produced work&lt;br&gt;
based on a derived database, you also have to publish either&lt;br&gt;
&lt;br&gt;
(a) the derived database or&lt;br&gt;
(b) a &amp;quot;diff&amp;quot; allowing someone to arrive at the derived database if he&lt;br&gt;
has the original, publicly available database or&lt;br&gt;
(c) an algorithm that does the same.&lt;br&gt;
&lt;br&gt;
Is that correct so far?&lt;br&gt;
&lt;br&gt;&lt;/blockquote&gt;&lt;div&gt;&lt;br&gt;I don&amp;#39;t think it&amp;#39;s quite as simple as that.&lt;br&gt;&lt;br&gt;Suppose, considering your WMS example, two separate companies provide identical services:&lt;br&gt;&lt;br&gt;A) The first service uses massive processor power to analyse a raw planet dump and provides the output directly.  Perhaps a larger company such as Google might take this approach.&lt;br&gt;
&lt;br&gt;B) The second uses some algorithms and optimisations that involve creating a derived database, but results in exactly the same output as service A.  Perhaps, a smaller company such as Geofabrik might take this approach.&lt;br&gt;
&lt;br&gt;Let&amp;#39;s assume that neither company voluntarily publishes any information about their methods.&lt;br&gt;&lt;br&gt;On what basis can you demand from company B that they release their intermediate database?  You don&amp;#39;t know (for sure) that they have an intermediate database.  The ODbL doesn&amp;#39;t give you any rights to ask company A to warrant that they are not using an intermediate database.  &lt;br&gt;
&lt;br&gt;What kind of duck test can you use to be sure that a derived database is involved in the process?&lt;br&gt;&lt;br&gt;80n&lt;br&gt;&lt;br&gt; &lt;/div&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;

To use a simple example, let&amp;#39;s say I build a WMS that works with OSM&lt;br&gt;
data. To make this perform well at low zooms, I have to combine ways&lt;br&gt;
into longer bits and simplify their geometry. The result is clearly a&lt;br&gt;
derived database that falls under the above, and in practice I would&lt;br&gt;
probably choose the &amp;quot;a&amp;quot; route and simply make a weekly PostGIS dump&lt;br&gt;
available for download and be done with it.&lt;br&gt;
&lt;br&gt;
However, I wonder about the permitted ways of doing (c).&lt;br&gt;
&lt;br&gt;
I guess it would probably permitted to specify a number of PostGIS&lt;br&gt;
commands that achieve the changes. - Let us assume for a moment that&lt;br&gt;
applying these PostGIS commands would require a machine with 192 GB of&lt;br&gt;
RAM and Quad Quadcore processors and still take two weeks to complete,&lt;br&gt;
putting it out of reach of many users. Would it still be permitted to do&lt;br&gt;
that?&lt;br&gt;
&lt;br&gt;
Or, would it be allowable to say: &amp;quot;For simplification, a Douglas-Peucker&lt;br&gt;
algorithm &amp;lt;link to DP wikipedia entry&amp;gt; is used.&amp;quot; (leaving open the exact&lt;br&gt;
implementation and parametrisation of DP - bear in mind that with some&lt;br&gt;
algorithms, how they work is easily explained but implementing them in a&lt;br&gt;
way that runs on standard hardware may be a hard task).&lt;br&gt;
&lt;br&gt;
Or, would it be allowed to say: &amp;quot;For simplification, just load the data&lt;br&gt;
set into &amp;lt;name of horribly expensive proprietary ESRI program&amp;gt; and hit&lt;br&gt;
Ctrl-S X Y, then choose Export to PostGIS&amp;quot;?&lt;br&gt;
&lt;br&gt;
What about: &amp;quot;For simplification, we did the following steps: &amp;lt;detailed&lt;br&gt;
instructions that are easy to follow&amp;gt;. These steps in this sequence are&lt;br&gt;
patented by us, so if you want to follow them, please apply to us for a&lt;br&gt;
license to use our patent.&amp;quot;&lt;br&gt;
&lt;br&gt;
Bye&lt;br&gt;
Frederik&lt;br&gt;
&lt;br&gt;
_______________________________________________&lt;br&gt;
legal-talk mailing list&lt;br&gt;
&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26758575&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;&lt;br&gt;
&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_blank&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;
&lt;/blockquote&gt;&lt;/div&gt;&lt;br&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26758575&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26758575.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26757535</id>
	<title>Re: ODbL Enforcement (Re:  OBbL and forks)</title>
	<published>2009-12-12T05:19:36Z</published>
	<updated>2009-12-12T05:19:36Z</updated>
	<author>
		<name>Rob Myers</name>
	</author>
	<content type="html">On 12/12/09 12:27, Frederik Ramm wrote:
&lt;br&gt;&amp;gt; 
&lt;br&gt;&amp;gt; Agreed, although this of course requires determined and capable people 
&lt;br&gt;&amp;gt; to do the work. If there are such people in OSM who do that voluntarily 
&lt;br&gt;&amp;gt; then that's good. If there are no such people then I would object to 
&lt;br&gt;&amp;gt; spending money to hire them from outside the project.
&lt;br&gt;&lt;br&gt;Apart from anything else it's very hard to find people who are used to
&lt;br&gt;alternative licence law, so I understand this objection. :-)
&lt;br&gt;&lt;br&gt;That said, would you object to using a nonprofit resource like the
&lt;br&gt;Software Freedom Law Centre, where it doesn't take too much from OSM's
&lt;br&gt;time and money and the people involved hopefully understand where OSM is
&lt;br&gt;coming from?
&lt;br&gt;&lt;br&gt;- Rob.
&lt;br&gt;&lt;br&gt;&lt;br /&gt; &lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26757535&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;&lt;div class=&quot;small&quot;&gt;&lt;br/&gt;&lt;img src=&quot;http://old.nabble.com/images/icon_attachment.gif&quot; &gt; &lt;strong&gt;signature.asc&lt;/strong&gt; (269 bytes) &lt;a href=&quot;http://old.nabble.com/attachment/26757535/0/signature.asc&quot; target=&quot;_top&quot;&gt;Download Attachment&lt;/a&gt;&lt;/div&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/OBbL-and-forks-tp26693334p26757535.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26757330</id>
	<title>Re: OBbL and forks</title>
	<published>2009-12-12T04:48:11Z</published>
	<updated>2009-12-12T04:48:11Z</updated>
	<author>
		<name>andrzej zaborowski</name>
	</author>
	<content type="html">Hi,
&lt;br&gt;&lt;br&gt;2009/12/12 James Livingston &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26757330&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;doctau@...&lt;/a&gt;&amp;gt;:
&lt;br&gt;&amp;gt; One of the claimed problems with CC-BY-SA was that users were worried that they could be sued by any contributor for copyright infringement.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; Aside from any &amp;quot;can the data have copyright rights&amp;quot; questions, if OSMF was to claim some copyright in the data then they're basically implying that other contributors do too, and anyone of us could sue users. Which I don't think is what they want.
&lt;br&gt;&amp;gt;
&lt;br&gt;&lt;br&gt;I'm not sure if this was so bad, in the end this is like in most
&lt;br&gt;opensource projects (those that don't require copyright assignment).
&lt;br&gt;Of course contributions in OSM may be easier to make than code
&lt;br&gt;contributions, but a project like Linux still has more contributors
&lt;br&gt;(subjects owning copyright) than we have. &amp;nbsp;And those contributors have
&lt;br&gt;been successfully suing those who broke the rules, e.g. Harald Welte
&lt;br&gt;and his gpl-violations.org, without help from Linux Foundation.
&lt;br&gt;&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; Out of curiosity, could the license at all work if contributors didn't
&lt;br&gt;&amp;gt;&amp;gt; have to assign copyright *nor* database rights?  Apart from the fact
&lt;br&gt;&amp;gt;&amp;gt; that updating the license would require a new vote (or licensing under
&lt;br&gt;&amp;gt;&amp;gt; ODbL v1+, similar to GPLv2+), but could that be done?
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; As I understand it, contributors don't have to (and aren't being asked to) assign either of those rights in the &amp;quot;exclusive transfer&amp;quot; sense. We're giving OSMF non-exclusive permission to distribute our contributions under ODbL (and future licenses, etc.).
&lt;br&gt;&lt;br&gt;What if we didn't give it any special rights and be on par with
&lt;br&gt;potential forks? &amp;nbsp;Maybe the February license change should try to do
&lt;br&gt;one change at a time and people would be more happy to accept those
&lt;br&gt;changes? (I probably would be more happy, it would also be easier for
&lt;br&gt;me to convince the people whose CC-by-SA data I have imported, to
&lt;br&gt;agree to ODbL too)
&lt;br&gt;&lt;br&gt;Cheers
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26757330&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/OBbL-and-forks-tp26693334p26757330.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26757085</id>
	<title>ODbL: How obscure/inaccessible can published algorithms be?</title>
	<published>2009-12-12T04:07:24Z</published>
	<updated>2009-12-12T04:07:24Z</updated>
	<author>
		<name>Frederik Ramm</name>
	</author>
	<content type="html">Hi,
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; OdbL has this requirement where, if you publish a produced work 
&lt;br&gt;based on a derived database, you also have to publish either
&lt;br&gt;&lt;br&gt;(a) the derived database or
&lt;br&gt;(b) a &amp;quot;diff&amp;quot; allowing someone to arrive at the derived database if he 
&lt;br&gt;has the original, publicly available database or
&lt;br&gt;(c) an algorithm that does the same.
&lt;br&gt;&lt;br&gt;Is that correct so far?
&lt;br&gt;&lt;br&gt;To use a simple example, let's say I build a WMS that works with OSM 
&lt;br&gt;data. To make this perform well at low zooms, I have to combine ways 
&lt;br&gt;into longer bits and simplify their geometry. The result is clearly a 
&lt;br&gt;derived database that falls under the above, and in practice I would 
&lt;br&gt;probably choose the &amp;quot;a&amp;quot; route and simply make a weekly PostGIS dump 
&lt;br&gt;available for download and be done with it.
&lt;br&gt;&lt;br&gt;However, I wonder about the permitted ways of doing (c).
&lt;br&gt;&lt;br&gt;I guess it would probably permitted to specify a number of PostGIS 
&lt;br&gt;commands that achieve the changes. - Let us assume for a moment that 
&lt;br&gt;applying these PostGIS commands would require a machine with 192 GB of 
&lt;br&gt;RAM and Quad Quadcore processors and still take two weeks to complete, 
&lt;br&gt;putting it out of reach of many users. Would it still be permitted to do 
&lt;br&gt;that?
&lt;br&gt;&lt;br&gt;Or, would it be allowable to say: &amp;quot;For simplification, a Douglas-Peucker 
&lt;br&gt;algorithm &amp;lt;link to DP wikipedia entry&amp;gt; is used.&amp;quot; (leaving open the exact 
&lt;br&gt;implementation and parametrisation of DP - bear in mind that with some 
&lt;br&gt;algorithms, how they work is easily explained but implementing them in a 
&lt;br&gt;way that runs on standard hardware may be a hard task).
&lt;br&gt;&lt;br&gt;Or, would it be allowed to say: &amp;quot;For simplification, just load the data 
&lt;br&gt;set into &amp;lt;name of horribly expensive proprietary ESRI program&amp;gt; and hit 
&lt;br&gt;Ctrl-S X Y, then choose Export to PostGIS&amp;quot;?
&lt;br&gt;&lt;br&gt;What about: &amp;quot;For simplification, we did the following steps: &amp;lt;detailed 
&lt;br&gt;instructions that are easy to follow&amp;gt;. These steps in this sequence are 
&lt;br&gt;patented by us, so if you want to follow them, please apply to us for a 
&lt;br&gt;license to use our patent.&amp;quot;
&lt;br&gt;&lt;br&gt;Bye
&lt;br&gt;Frederik
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26757085&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ODbL%3A-How-obscure-inaccessible-can-published-algorithms-be--tp26757085p26757085.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26756763</id>
	<title>Re: ODbL Enforcement (Re:  OBbL and forks)</title>
	<published>2009-12-12T03:27:26Z</published>
	<updated>2009-12-12T03:27:26Z</updated>
	<author>
		<name>Frederik Ramm</name>
	</author>
	<content type="html">Hi,
&lt;br&gt;&lt;br&gt;Rob Myers wrote:
&lt;br&gt;&amp;gt; Rather than naming and shaming, the FSF and the SFLC always work quietly
&lt;br&gt;&amp;gt; to get compliance from people who break the GPL. They don't call them
&lt;br&gt;&amp;gt; out in public or drag their asses to court to make an example of them.
&lt;br&gt;&amp;gt; Legal action and the publicity that brings is a last resort. I think
&lt;br&gt;&amp;gt; that's a better balance.
&lt;br&gt;&lt;br&gt;Agreed, although this of course requires determined and capable people 
&lt;br&gt;to do the work. If there are such people in OSM who do that voluntarily 
&lt;br&gt;then that's good. If there are no such people then I would object to 
&lt;br&gt;spending money to hire them from outside the project.
&lt;br&gt;&lt;br&gt;Bye
&lt;br&gt;Frederik
&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26756763&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/OBbL-and-forks-tp26693334p26756763.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26756658</id>
	<title>Re: ODbL Enforcement (Re:  OBbL and forks)</title>
	<published>2009-12-12T03:15:37Z</published>
	<updated>2009-12-12T03:15:37Z</updated>
	<author>
		<name>Rob Myers</name>
	</author>
	<content type="html">On 12/12/09 11:49, Frederik Ramm wrote:
&lt;br&gt;&amp;gt; 
&lt;br&gt;&amp;gt; but even with ODbL in place and considering the best interests of the 
&lt;br&gt;&amp;gt; project as a whole, for me it would be perfectly sufficient to be able 
&lt;br&gt;&amp;gt; to say publicly that X is using OSM illegally. 
&lt;br&gt;&lt;br&gt;Rather than naming and shaming, the FSF and the SFLC always work quietly
&lt;br&gt;to get compliance from people who break the GPL. They don't call them
&lt;br&gt;out in public or drag their asses to court to make an example of them.
&lt;br&gt;Legal action and the publicity that brings is a last resort. I think
&lt;br&gt;that's a better balance.
&lt;br&gt;&lt;br&gt;- Rob.
&lt;br&gt;&lt;br&gt;&lt;br /&gt; &lt;br /&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26756658&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;&lt;div class=&quot;small&quot;&gt;&lt;br/&gt;&lt;img src=&quot;http://old.nabble.com/images/icon_attachment.gif&quot; &gt; &lt;strong&gt;signature.asc&lt;/strong&gt; (269 bytes) &lt;a href=&quot;http://old.nabble.com/attachment/26756658/0/signature.asc&quot; target=&quot;_top&quot;&gt;Download Attachment&lt;/a&gt;&lt;/div&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/OBbL-and-forks-tp26693334p26756658.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26756490</id>
	<title>Re: ODbL Enforcement (Re:  OBbL and forks)</title>
	<published>2009-12-12T02:49:25Z</published>
	<updated>2009-12-12T02:49:25Z</updated>
	<author>
		<name>Frederik Ramm</name>
	</author>
	<content type="html">Hi,
&lt;br&gt;&lt;br&gt;James Livingston wrote:
&lt;br&gt;&amp;gt; Which brings us on to enforcement - at some point a user is going to use 
&lt;br&gt;&amp;gt; ODbL licensed data, not comply with the licence, and not respond to 
&lt;br&gt;&amp;gt; asking nicely. Who is going to sue them to enforce the ODbL and for 
&lt;br&gt;&amp;gt; what?
&lt;br&gt;&lt;br&gt;I am certainly not going to sue anybody. I consider my data PD anyway, 
&lt;br&gt;but even with ODbL in place and considering the best interests of the 
&lt;br&gt;project as a whole, for me it would be perfectly sufficient to be able 
&lt;br&gt;to say publicly that X is using OSM illegally. I would definitely oppose 
&lt;br&gt;any allocation of funds or effort to chase violators over and above that.
&lt;br&gt;&lt;br&gt;Bye
&lt;br&gt;Frederik
&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26756490&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/OBbL-and-forks-tp26693334p26756490.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26755486</id>
	<title>Re: OBbL and forks</title>
	<published>2009-12-11T23:04:26Z</published>
	<updated>2009-12-11T23:04:26Z</updated>
	<author>
		<name>Gervase Markham-4</name>
	</author>
	<content type="html">On 08/12/09 15:14, andrzej zaborowski wrote:
&lt;br&gt;&amp;gt; Right, so this is one thing that isn't being made so clear. &amp;nbsp;It's been
&lt;br&gt;&amp;gt; said multiple times that the ODbL transition in summary is the spirit
&lt;br&gt;&amp;gt; of CC-By-SA taken and made into a proper license for a database. &amp;nbsp;But
&lt;br&gt;&amp;gt; actually it's the spirit of CC-By-SA + copyright assignment, like that
&lt;br&gt;&amp;gt; of Mozilla and others, which makes a difference.
&lt;br&gt;&lt;br&gt;Correction: Mozilla does not require copyright assignment. (However, 
&lt;br&gt;your point is correct.)
&lt;br&gt;&lt;br&gt;Gerv
&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26755486&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/OBbL-and-forks-tp26693334p26755486.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26755479</id>
	<title>Re: OBbL and forks</title>
	<published>2009-12-11T23:03:04Z</published>
	<updated>2009-12-11T23:03:04Z</updated>
	<author>
		<name>Gervase Markham-4</name>
	</author>
	<content type="html">On 09/12/09 09:48, Ed Avis wrote:
&lt;br&gt;&amp;gt; A related question is that if a fork happened, could it then be merged back
&lt;br&gt;&amp;gt; into the main OSM project?
&lt;br&gt;&lt;br&gt;Just like any other ODbL contribution, this could only be done if the 
&lt;br&gt;contributors signed the Contributor Terms, or the OSMF agreed to waive 
&lt;br&gt;the signing of them.
&lt;br&gt;&lt;br&gt;Gerv
&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;legal-talk mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26755479&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;legal-talk@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;http://lists.openstreetmap.org/listinfo/legal-talk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lists.openstreetmap.org/listinfo/legal-talk&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/OBbL-and-forks-tp26693334p26755479.html" />
</entry>

</feed>
