{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KIHR2A5Z5KWPVI3QVPGACM5JCJ","short_pith_number":"pith:KIHR2A5Z","schema_version":"1.0","canonical_sha256":"520f1d03b9eaacfaa370abcc0133a9125604b31236900fa131b05eb570bd0e55","source":{"kind":"arxiv","id":"1104.4423","version":2},"attestation_state":"computed","paper":{"title":"Enforcing efficient equilibria in network design games via subsidies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Angelo Fanelli, Christos Kalaitzis, Ioannis Caragiannis, John Augustine","submitted_at":"2011-04-22T12:00:10Z","abstract_excerpt":"The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network links is as low as possible. The Minimum Spanning Tree problem, which is well-understood, is a nice example.\n  In this paper, we consider the natural scenario in which the connectivity requirements are posed by selfish users who have agreed to sha"},"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":"1104.4423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-22T12:00:10Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"50b8831cf4fcb8dc240b684f23ed50c0bb685449e740ab2351d0793885ab197e","abstract_canon_sha256":"22fbd2badf15013bff4e3a4890f786ef8c3aa96d95318116796419441549700a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:34.389790Z","signature_b64":"/I7FtnmyHwsb7ieegmg6Uu/q+XMizorpv4uuaXNXXfxiTpLGUBllYB/L9RBhgz37cBfMr9VqlOHb7ckGMxjaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"520f1d03b9eaacfaa370abcc0133a9125604b31236900fa131b05eb570bd0e55","last_reissued_at":"2026-05-18T04:18:34.389281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:34.389281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enforcing efficient equilibria in network design games via subsidies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Angelo Fanelli, Christos Kalaitzis, Ioannis Caragiannis, John Augustine","submitted_at":"2011-04-22T12:00:10Z","abstract_excerpt":"The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network links is as low as possible. The Minimum Spanning Tree problem, which is well-understood, is a nice example.\n  In this paper, we consider the natural scenario in which the connectivity requirements are posed by selfish users who have agreed to sha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4423","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":"1104.4423","created_at":"2026-05-18T04:18:34.389349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4423v2","created_at":"2026-05-18T04:18:34.389349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4423","created_at":"2026-05-18T04:18:34.389349+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIHR2A5Z5KWP","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIHR2A5Z5KWPVI3Q","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIHR2A5Z","created_at":"2026-05-18T12:26:32.869790+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/KIHR2A5Z5KWPVI3QVPGACM5JCJ","json":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ.json","graph_json":"https://pith.science/api/pith-number/KIHR2A5Z5KWPVI3QVPGACM5JCJ/graph.json","events_json":"https://pith.science/api/pith-number/KIHR2A5Z5KWPVI3QVPGACM5JCJ/events.json","paper":"https://pith.science/paper/KIHR2A5Z"},"agent_actions":{"view_html":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ","download_json":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ.json","view_paper":"https://pith.science/paper/KIHR2A5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4423&json=true","fetch_graph":"https://pith.science/api/pith-number/KIHR2A5Z5KWPVI3QVPGACM5JCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KIHR2A5Z5KWPVI3QVPGACM5JCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/action/storage_attestation","attest_author":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/action/author_attestation","sign_citation":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/action/citation_signature","submit_replication":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/action/replication_record"}},"created_at":"2026-05-18T04:18:34.389349+00:00","updated_at":"2026-05-18T04:18:34.389349+00:00"}