{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CUQEWTALKWAVS2353YF7MZEL6C","short_pith_number":"pith:CUQEWTAL","schema_version":"1.0","canonical_sha256":"15204b4c0b5581596b7dde0bf6648bf0af91eb2135a21dce2f64c61977c373d6","source":{"kind":"arxiv","id":"1112.4264","version":1},"attestation_state":"computed","paper":{"title":"Bounded-Distance Network Creation Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a","submitted_at":"2011-12-19T08:30:51Z","abstract_excerpt":"A network creation game simulates a decentralized and non-cooperative building of a communication network. Informally, there are $n$ players sitting on the network nodes, which attempt to establish a reciprocal communication by activating, incurring a certain cost, any of their incident links. The goal of each player is to have all the other nodes as close as possible in the resulting network, while buying as few links as possible. According to this intuition, any model of the game must then appropriately address a balance between these two conflicting objectives. Motivated by the fact that a "},"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":"1112.4264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-12-19T08:30:51Z","cross_cats_sorted":[],"title_canon_sha256":"5ff26a84fc15694abfa6d42cb03e8e2764e21c25be94a4fb0e8880d2c2e6c6a0","abstract_canon_sha256":"ebb4b65427017eef33713605ac9cd838bdad932e10456f9cc0ea4ccb6950fbb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:06.735088Z","signature_b64":"n8IdWgoKOsL2rl6z3gNYENcba+qpuHlmhPFwldTJgu0fQNvuUIVVJT1hW1SphPLkBY+IGwGTEHNfha6Cqx/HAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15204b4c0b5581596b7dde0bf6648bf0af91eb2135a21dce2f64c61977c373d6","last_reissued_at":"2026-05-18T04:06:06.734365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:06.734365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded-Distance Network Creation Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a","submitted_at":"2011-12-19T08:30:51Z","abstract_excerpt":"A network creation game simulates a decentralized and non-cooperative building of a communication network. Informally, there are $n$ players sitting on the network nodes, which attempt to establish a reciprocal communication by activating, incurring a certain cost, any of their incident links. The goal of each player is to have all the other nodes as close as possible in the resulting network, while buying as few links as possible. According to this intuition, any model of the game must then appropriately address a balance between these two conflicting objectives. Motivated by the fact that a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4264","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.4264","created_at":"2026-05-18T04:06:06.734481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.4264v1","created_at":"2026-05-18T04:06:06.734481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4264","created_at":"2026-05-18T04:06:06.734481+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUQEWTALKWAV","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUQEWTALKWAVS235","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUQEWTAL","created_at":"2026-05-18T12:26:26.731475+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/CUQEWTALKWAVS2353YF7MZEL6C","json":"https://pith.science/pith/CUQEWTALKWAVS2353YF7MZEL6C.json","graph_json":"https://pith.science/api/pith-number/CUQEWTALKWAVS2353YF7MZEL6C/graph.json","events_json":"https://pith.science/api/pith-number/CUQEWTALKWAVS2353YF7MZEL6C/events.json","paper":"https://pith.science/paper/CUQEWTAL"},"agent_actions":{"view_html":"https://pith.science/pith/CUQEWTALKWAVS2353YF7MZEL6C","download_json":"https://pith.science/pith/CUQEWTALKWAVS2353YF7MZEL6C.json","view_paper":"https://pith.science/paper/CUQEWTAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.4264&json=true","fetch_graph":"https://pith.science/api/pith-number/CUQEWTALKWAVS2353YF7MZEL6C/graph.json","fetch_events":"https://pith.science/api/pith-number/CUQEWTALKWAVS2353YF7MZEL6C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUQEWTALKWAVS2353YF7MZEL6C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUQEWTALKWAVS2353YF7MZEL6C/action/storage_attestation","attest_author":"https://pith.science/pith/CUQEWTALKWAVS2353YF7MZEL6C/action/author_attestation","sign_citation":"https://pith.science/pith/CUQEWTALKWAVS2353YF7MZEL6C/action/citation_signature","submit_replication":"https://pith.science/pith/CUQEWTALKWAVS2353YF7MZEL6C/action/replication_record"}},"created_at":"2026-05-18T04:06:06.734481+00:00","updated_at":"2026-05-18T04:06:06.734481+00:00"}