{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:N4Y6XRZL7HIKCHECJFMEFULTKQ","short_pith_number":"pith:N4Y6XRZL","schema_version":"1.0","canonical_sha256":"6f31ebc72bf9d0a11c82495842d173542d8e32d48216011c1247cb9be5e0598d","source":{"kind":"arxiv","id":"1212.4797","version":2},"attestation_state":"computed","paper":{"title":"On Dynamics in Selfish Network Creation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.DS"],"primary_cat":"cs.GT","authors_text":"Bernd Kawald, Pascal Lenzner","submitted_at":"2012-12-19T19:17:57Z","abstract_excerpt":"We consider the dynamic behavior of several variants of the Network Creation Game, introduced by Fabrikant et al. [PODC'03]. Equilibrium networks in these models have desirable properties like low social cost and small diameter, which makes them attractive for the decentralized creation of overlay-networks. Unfortunately, due to the non-constructiveness of the Nash equilibrium, no distributed algorithm for finding such networks is known. We treat these games as sequential-move games and analyze whether (uncoordinated) selfish play eventually converges to an equilibrium state. Thus, we shed lig"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1212.4797","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-12-19T19:17:57Z","cross_cats_sorted":["cs.DS","math.DS"],"title_canon_sha256":"f528395d8913b1b1b3a27709b32b99146f512858ffe96c6dad25c4956f2f8a04","abstract_canon_sha256":"859e3dd3102f62e91cd2c6aeb56d7f94099e2a8b69a4db19e6211d7c5cdf9d8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:41.553091Z","signature_b64":"/YQtZbyeCjzb8XcR5x8ZM1iHGKbUDT+Un72ohsWsSQrglesrjgdlbP+z77PdddfNLwwkX+oKGvBZoUcoWw14Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f31ebc72bf9d0a11c82495842d173542d8e32d48216011c1247cb9be5e0598d","last_reissued_at":"2026-05-18T03:24:41.552552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:41.552552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Dynamics in Selfish Network Creation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.DS"],"primary_cat":"cs.GT","authors_text":"Bernd Kawald, Pascal Lenzner","submitted_at":"2012-12-19T19:17:57Z","abstract_excerpt":"We consider the dynamic behavior of several variants of the Network Creation Game, introduced by Fabrikant et al. [PODC'03]. Equilibrium networks in these models have desirable properties like low social cost and small diameter, which makes them attractive for the decentralized creation of overlay-networks. Unfortunately, due to the non-constructiveness of the Nash equilibrium, no distributed algorithm for finding such networks is known. We treat these games as sequential-move games and analyze whether (uncoordinated) selfish play eventually converges to an equilibrium state. Thus, we shed lig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4797","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.4797","created_at":"2026-05-18T03:24:41.552636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4797v2","created_at":"2026-05-18T03:24:41.552636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4797","created_at":"2026-05-18T03:24:41.552636+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4Y6XRZL7HIK","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4Y6XRZL7HIKCHEC","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4Y6XRZL","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N4Y6XRZL7HIKCHECJFMEFULTKQ","json":"https://pith.science/pith/N4Y6XRZL7HIKCHECJFMEFULTKQ.json","graph_json":"https://pith.science/api/pith-number/N4Y6XRZL7HIKCHECJFMEFULTKQ/graph.json","events_json":"https://pith.science/api/pith-number/N4Y6XRZL7HIKCHECJFMEFULTKQ/events.json","paper":"https://pith.science/paper/N4Y6XRZL"},"agent_actions":{"view_html":"https://pith.science/pith/N4Y6XRZL7HIKCHECJFMEFULTKQ","download_json":"https://pith.science/pith/N4Y6XRZL7HIKCHECJFMEFULTKQ.json","view_paper":"https://pith.science/paper/N4Y6XRZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4797&json=true","fetch_graph":"https://pith.science/api/pith-number/N4Y6XRZL7HIKCHECJFMEFULTKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/N4Y6XRZL7HIKCHECJFMEFULTKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4Y6XRZL7HIKCHECJFMEFULTKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4Y6XRZL7HIKCHECJFMEFULTKQ/action/storage_attestation","attest_author":"https://pith.science/pith/N4Y6XRZL7HIKCHECJFMEFULTKQ/action/author_attestation","sign_citation":"https://pith.science/pith/N4Y6XRZL7HIKCHECJFMEFULTKQ/action/citation_signature","submit_replication":"https://pith.science/pith/N4Y6XRZL7HIKCHECJFMEFULTKQ/action/replication_record"}},"created_at":"2026-05-18T03:24:41.552636+00:00","updated_at":"2026-05-18T03:24:41.552636+00:00"}