{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3ROEVKTAKQTZSBXQQFGL4ZHTTP","short_pith_number":"pith:3ROEVKTA","schema_version":"1.0","canonical_sha256":"dc5c4aaa6054279906f0814cbe64f39beea7eaa3cae7181d535267a871e06313","source":{"kind":"arxiv","id":"1610.06515","version":1},"attestation_state":"computed","paper":{"title":"On the Price of Stability of Undirected Multicast Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, Rupert Freeman, Samuel Haney","submitted_at":"2016-10-20T17:40:16Z","abstract_excerpt":"In multicast network design games, a set of agents choose paths from their source locations to a common sink with the goal of minimizing their individual costs, where the cost of an edge is divided equally among the agents using it. Since the work of Anshelevich et al. (FOCS 2004) that introduced network design games, the main open problem in this field has been the price of stability (PoS) of multicast games. For the special case of broadcast games (every vertex is a terminal, i.e., has an agent), a series of works has culminated in a constant upper bound on the PoS (Bilo` et al., FOCS 2013)."},"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":"1610.06515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-20T17:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"dd8c842007e3f828820edbc64e120a8f71dbfc262283689c4277b755efc90930","abstract_canon_sha256":"d5964cc96b8e0c690302ac053a314ae9c1fcdc73e15c5b31de36c184762c3708"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:42.987961Z","signature_b64":"TNdzq0SKR9QwzqVStsTW31+g/Ll+IDPFq4crC6Zl/9l36S0REWP0RaLVxCmBoNiS+gcXMbws8l18BHrCegd/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc5c4aaa6054279906f0814cbe64f39beea7eaa3cae7181d535267a871e06313","last_reissued_at":"2026-05-18T01:01:42.987301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:42.987301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Price of Stability of Undirected Multicast Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, Rupert Freeman, Samuel Haney","submitted_at":"2016-10-20T17:40:16Z","abstract_excerpt":"In multicast network design games, a set of agents choose paths from their source locations to a common sink with the goal of minimizing their individual costs, where the cost of an edge is divided equally among the agents using it. Since the work of Anshelevich et al. (FOCS 2004) that introduced network design games, the main open problem in this field has been the price of stability (PoS) of multicast games. For the special case of broadcast games (every vertex is a terminal, i.e., has an agent), a series of works has culminated in a constant upper bound on the PoS (Bilo` et al., FOCS 2013)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06515","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":"1610.06515","created_at":"2026-05-18T01:01:42.987421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06515v1","created_at":"2026-05-18T01:01:42.987421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06515","created_at":"2026-05-18T01:01:42.987421+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ROEVKTAKQTZ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ROEVKTAKQTZSBXQ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ROEVKTA","created_at":"2026-05-18T12:29:55.572404+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/3ROEVKTAKQTZSBXQQFGL4ZHTTP","json":"https://pith.science/pith/3ROEVKTAKQTZSBXQQFGL4ZHTTP.json","graph_json":"https://pith.science/api/pith-number/3ROEVKTAKQTZSBXQQFGL4ZHTTP/graph.json","events_json":"https://pith.science/api/pith-number/3ROEVKTAKQTZSBXQQFGL4ZHTTP/events.json","paper":"https://pith.science/paper/3ROEVKTA"},"agent_actions":{"view_html":"https://pith.science/pith/3ROEVKTAKQTZSBXQQFGL4ZHTTP","download_json":"https://pith.science/pith/3ROEVKTAKQTZSBXQQFGL4ZHTTP.json","view_paper":"https://pith.science/paper/3ROEVKTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06515&json=true","fetch_graph":"https://pith.science/api/pith-number/3ROEVKTAKQTZSBXQQFGL4ZHTTP/graph.json","fetch_events":"https://pith.science/api/pith-number/3ROEVKTAKQTZSBXQQFGL4ZHTTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ROEVKTAKQTZSBXQQFGL4ZHTTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ROEVKTAKQTZSBXQQFGL4ZHTTP/action/storage_attestation","attest_author":"https://pith.science/pith/3ROEVKTAKQTZSBXQQFGL4ZHTTP/action/author_attestation","sign_citation":"https://pith.science/pith/3ROEVKTAKQTZSBXQQFGL4ZHTTP/action/citation_signature","submit_replication":"https://pith.science/pith/3ROEVKTAKQTZSBXQQFGL4ZHTTP/action/replication_record"}},"created_at":"2026-05-18T01:01:42.987421+00:00","updated_at":"2026-05-18T01:01:42.987421+00:00"}