{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S2LCEKANVA7U5IYFAOJIEIQGBC","short_pith_number":"pith:S2LCEKAN","canonical_record":{"source":{"id":"1703.02088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-06T19:58:20Z","cross_cats_sorted":[],"title_canon_sha256":"5bc88ab08f36496e25d324bcdff8b7ca47c38212e326d9cac311320f25bc9b63","abstract_canon_sha256":"73c303115c7f3d9b99eb9bc73b8763b3a6f0d2f9bb87b9ad807d2f3e2bffa1fe"},"schema_version":"1.0"},"canonical_sha256":"969622280da83f4ea305039282220608a82270438743cb67f5a234e87df18f6f","source":{"kind":"arxiv","id":"1703.02088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02088","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02088v1","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02088","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"S2LCEKANVA7U","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S2LCEKANVA7U5IYF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S2LCEKAN","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S2LCEKANVA7U5IYFAOJIEIQGBC","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-06T19:58:20Z","cross_cats_sorted":[],"title_canon_sha256":"5bc88ab08f36496e25d324bcdff8b7ca47c38212e326d9cac311320f25bc9b63","abstract_canon_sha256":"73c303115c7f3d9b99eb9bc73b8763b3a6f0d2f9bb87b9ad807d2f3e2bffa1fe"},"schema_version":"1.0"},"canonical_sha256":"969622280da83f4ea305039282220608a82270438743cb67f5a234e87df18f6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:20.729077Z","signature_b64":"ednJHLHxUTxmgGgDzWWf6z1X3xkLOKqlbUpw2dxStJY6V+3rpBTJSrgJyaK8Icp3hDcgTatMzUaOt7Wn+04jAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"969622280da83f4ea305039282220608a82270438743cb67f5a234e87df18f6f","last_reissued_at":"2026-05-18T00:49:20.728635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:20.728635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02088","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJ5CYCMGZxW7HtJ/moAjB89FTV32gBFDF6s7F4GYV9mYUpi3aatnkoseLMc6YanllODuzOxefugXHw077iAmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:10:04.556059Z"},"content_sha256":"ac538a953048683945b7dc56320276c6b207d0548c8670f709dddcf3bea4e2f5","schema_version":"1.0","event_id":"sha256:ac538a953048683945b7dc56320276c6b207d0548c8670f709dddcf3bea4e2f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S2LCEKANVA7U5IYFAOJIEIQGBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Naming Game on the complete graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eric Foxall","submitted_at":"2017-03-06T19:58:20Z","abstract_excerpt":"We consider a model of language development, known as the naming game, in which agents invent, share and then select descriptive words for a single object, in such a way as to promote local consensus. When formulated on a finite and connected graph, a global consensus eventually emerges in which all agents use a common unique word. Previous numerical studies of the model on the complete graph with $n$ agents suggest that when no words initially exist, the time to consensus is of order $n^{1/2}$, assuming each agent speaks at a constant rate. We show rigorously that the time to consensus is at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02088","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ciazHX9f7ckYeXmrGrA2ENGTQNvVDQJ2VNc0YQxKkp9lmFRgnjVdGv8hXMF/iAOlAqnoftrHxtBpvaSqPf9ZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:10:04.556737Z"},"content_sha256":"49f1ab8549a6476ab8f3af2484186551484abd0874d9adffa02a845f9d25e5bc","schema_version":"1.0","event_id":"sha256:49f1ab8549a6476ab8f3af2484186551484abd0874d9adffa02a845f9d25e5bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2LCEKANVA7U5IYFAOJIEIQGBC/bundle.json","state_url":"https://pith.science/pith/S2LCEKANVA7U5IYFAOJIEIQGBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2LCEKANVA7U5IYFAOJIEIQGBC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T13:10:04Z","links":{"resolver":"https://pith.science/pith/S2LCEKANVA7U5IYFAOJIEIQGBC","bundle":"https://pith.science/pith/S2LCEKANVA7U5IYFAOJIEIQGBC/bundle.json","state":"https://pith.science/pith/S2LCEKANVA7U5IYFAOJIEIQGBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2LCEKANVA7U5IYFAOJIEIQGBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S2LCEKANVA7U5IYFAOJIEIQGBC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"73c303115c7f3d9b99eb9bc73b8763b3a6f0d2f9bb87b9ad807d2f3e2bffa1fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-06T19:58:20Z","title_canon_sha256":"5bc88ab08f36496e25d324bcdff8b7ca47c38212e326d9cac311320f25bc9b63"},"schema_version":"1.0","source":{"id":"1703.02088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02088","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02088v1","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02088","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"S2LCEKANVA7U","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S2LCEKANVA7U5IYF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S2LCEKAN","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:49f1ab8549a6476ab8f3af2484186551484abd0874d9adffa02a845f9d25e5bc","target":"graph","created_at":"2026-05-18T00:49:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider a model of language development, known as the naming game, in which agents invent, share and then select descriptive words for a single object, in such a way as to promote local consensus. When formulated on a finite and connected graph, a global consensus eventually emerges in which all agents use a common unique word. Previous numerical studies of the model on the complete graph with $n$ agents suggest that when no words initially exist, the time to consensus is of order $n^{1/2}$, assuming each agent speaks at a constant rate. We show rigorously that the time to consensus is at ","authors_text":"Eric Foxall","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-06T19:58:20Z","title":"The Naming Game on the complete graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02088","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ac538a953048683945b7dc56320276c6b207d0548c8670f709dddcf3bea4e2f5","target":"record","created_at":"2026-05-18T00:49:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"73c303115c7f3d9b99eb9bc73b8763b3a6f0d2f9bb87b9ad807d2f3e2bffa1fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-06T19:58:20Z","title_canon_sha256":"5bc88ab08f36496e25d324bcdff8b7ca47c38212e326d9cac311320f25bc9b63"},"schema_version":"1.0","source":{"id":"1703.02088","kind":"arxiv","version":1}},"canonical_sha256":"969622280da83f4ea305039282220608a82270438743cb67f5a234e87df18f6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"969622280da83f4ea305039282220608a82270438743cb67f5a234e87df18f6f","first_computed_at":"2026-05-18T00:49:20.728635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:20.728635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ednJHLHxUTxmgGgDzWWf6z1X3xkLOKqlbUpw2dxStJY6V+3rpBTJSrgJyaK8Icp3hDcgTatMzUaOt7Wn+04jAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:20.729077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac538a953048683945b7dc56320276c6b207d0548c8670f709dddcf3bea4e2f5","sha256:49f1ab8549a6476ab8f3af2484186551484abd0874d9adffa02a845f9d25e5bc"],"state_sha256":"3a57053769ba07d771dd2bc4812b4f31547917fadc300c12e2bf8f3a14a60f00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOg6WzQqR853Gyak1b/EWFPsrUgTg82/MOi+uUsI4EtQx8YEkC1Nxb5ywPuk3/mhHr3Dl7h2s626/r/LzpFDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T13:10:04.560344Z","bundle_sha256":"16fdcbbe9c660372f61c645ebe7016cb378a635d5932b3188c7c28f2ac847243"}}