{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XMQHT6CBNKQW27IIQOHMX6VZDS","short_pith_number":"pith:XMQHT6CB","schema_version":"1.0","canonical_sha256":"bb2079f8416aa16d7d08838ecbfab91cb11b3ce3d72c71afc2de585cb5a94780","source":{"kind":"arxiv","id":"1706.10200","version":1},"attestation_state":"computed","paper":{"title":"Selfish Network Creation with Non-Uniform Edge Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI"],"primary_cat":"cs.GT","authors_text":"Ankit Chauhan, Anna Melnichenko, Louise Molitor, Pascal Lenzner","submitted_at":"2017-06-30T13:56:56Z","abstract_excerpt":"Network creation games investigate complex networks from a game-theoretic point of view. Based on the original model by Fabrikant et al. [PODC'03] many variants have been introduced. However, almost all versions have the drawback that edges are treated uniformly, i.e. every edge has the same cost and that this common parameter heavily influences the outcomes and the analysis of these games.\n  We propose and analyze simple and natural parameter-free network creation games with non-uniform edge cost. Our models are inspired by social networks where the cost of forming a link is proportional to t"},"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":"1706.10200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-06-30T13:56:56Z","cross_cats_sorted":["cs.DM","cs.NI"],"title_canon_sha256":"ee82c64464b0892b7e4b5273a5d8a1829b9d14e53f4b23964688b3067424bb84","abstract_canon_sha256":"1ed1bd3916d70e230b1209495fee5f70c93a394079a36983439ba5e5ea05ed76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:09.166057Z","signature_b64":"Hrf5vCFO6bKsv/uvNK84M0jd6etnQ0TqTZ2nwWeNdG3jCQelQMyBxkveezo1mLdk3mBm2PznM2vbDBjjmFmTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb2079f8416aa16d7d08838ecbfab91cb11b3ce3d72c71afc2de585cb5a94780","last_reissued_at":"2026-05-18T00:41:09.165299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:09.165299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selfish Network Creation with Non-Uniform Edge Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI"],"primary_cat":"cs.GT","authors_text":"Ankit Chauhan, Anna Melnichenko, Louise Molitor, Pascal Lenzner","submitted_at":"2017-06-30T13:56:56Z","abstract_excerpt":"Network creation games investigate complex networks from a game-theoretic point of view. Based on the original model by Fabrikant et al. [PODC'03] many variants have been introduced. However, almost all versions have the drawback that edges are treated uniformly, i.e. every edge has the same cost and that this common parameter heavily influences the outcomes and the analysis of these games.\n  We propose and analyze simple and natural parameter-free network creation games with non-uniform edge cost. Our models are inspired by social networks where the cost of forming a link is proportional to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10200","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":"1706.10200","created_at":"2026-05-18T00:41:09.165447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.10200v1","created_at":"2026-05-18T00:41:09.165447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10200","created_at":"2026-05-18T00:41:09.165447+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMQHT6CBNKQW","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMQHT6CBNKQW27II","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMQHT6CB","created_at":"2026-05-18T12:31:56.362134+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/XMQHT6CBNKQW27IIQOHMX6VZDS","json":"https://pith.science/pith/XMQHT6CBNKQW27IIQOHMX6VZDS.json","graph_json":"https://pith.science/api/pith-number/XMQHT6CBNKQW27IIQOHMX6VZDS/graph.json","events_json":"https://pith.science/api/pith-number/XMQHT6CBNKQW27IIQOHMX6VZDS/events.json","paper":"https://pith.science/paper/XMQHT6CB"},"agent_actions":{"view_html":"https://pith.science/pith/XMQHT6CBNKQW27IIQOHMX6VZDS","download_json":"https://pith.science/pith/XMQHT6CBNKQW27IIQOHMX6VZDS.json","view_paper":"https://pith.science/paper/XMQHT6CB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.10200&json=true","fetch_graph":"https://pith.science/api/pith-number/XMQHT6CBNKQW27IIQOHMX6VZDS/graph.json","fetch_events":"https://pith.science/api/pith-number/XMQHT6CBNKQW27IIQOHMX6VZDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMQHT6CBNKQW27IIQOHMX6VZDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMQHT6CBNKQW27IIQOHMX6VZDS/action/storage_attestation","attest_author":"https://pith.science/pith/XMQHT6CBNKQW27IIQOHMX6VZDS/action/author_attestation","sign_citation":"https://pith.science/pith/XMQHT6CBNKQW27IIQOHMX6VZDS/action/citation_signature","submit_replication":"https://pith.science/pith/XMQHT6CBNKQW27IIQOHMX6VZDS/action/replication_record"}},"created_at":"2026-05-18T00:41:09.165447+00:00","updated_at":"2026-05-18T00:41:09.165447+00:00"}