{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WMKQFJARMN7PRTAX7S7YMK2HNO","short_pith_number":"pith:WMKQFJAR","schema_version":"1.0","canonical_sha256":"b31502a411637ef8cc17fcbf862b476b8617d18bdc67630ea6d795e67eb3f80e","source":{"kind":"arxiv","id":"1507.04222","version":1},"attestation_state":"computed","paper":{"title":"Multicast Network Design Game on a Ring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Akaki Mamageishvili, Matus Mihalak","submitted_at":"2015-07-15T13:53:57Z","abstract_excerpt":"In this paper we study quality measures of different solution concepts for the multicast network design game on a ring topology. We recall from the literature a lower bound of 4/3 and prove a matching upper bound for the price of stability, which is the ratio of the social costs of a best Nash equilibrium and of a general optimum. Therefore, we answer an open question posed by Fanelli et al. in [12]. We prove an upper bound of 2 for the ratio of the costs of a potential optimizer and of an optimum, provide a construction of a lower bound, and give a computer-assisted argument that it reaches $"},"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":"1507.04222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-15T13:53:57Z","cross_cats_sorted":[],"title_canon_sha256":"440860d81f60f8879b86435599ffb037a34dc231516051f2300fb58e3d540c6a","abstract_canon_sha256":"5b8a93d9d4dbb3e3b84c743d05c5c7b44cb36eac8687557bc076aa6c476e8b4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:48.820423Z","signature_b64":"ht359KjL6M8WyB/P+2Nw+68IAWJMKlTghShUHJ+07ekr8EethNOUkTQGB6TAorwM2qhXcBLRiWU4LvmarUT3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b31502a411637ef8cc17fcbf862b476b8617d18bdc67630ea6d795e67eb3f80e","last_reissued_at":"2026-05-18T01:36:48.819817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:48.819817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicast Network Design Game on a Ring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Akaki Mamageishvili, Matus Mihalak","submitted_at":"2015-07-15T13:53:57Z","abstract_excerpt":"In this paper we study quality measures of different solution concepts for the multicast network design game on a ring topology. We recall from the literature a lower bound of 4/3 and prove a matching upper bound for the price of stability, which is the ratio of the social costs of a best Nash equilibrium and of a general optimum. Therefore, we answer an open question posed by Fanelli et al. in [12]. We prove an upper bound of 2 for the ratio of the costs of a potential optimizer and of an optimum, provide a construction of a lower bound, and give a computer-assisted argument that it reaches $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04222","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":"1507.04222","created_at":"2026-05-18T01:36:48.819929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04222v1","created_at":"2026-05-18T01:36:48.819929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04222","created_at":"2026-05-18T01:36:48.819929+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMKQFJARMN7P","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMKQFJARMN7PRTAX","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMKQFJAR","created_at":"2026-05-18T12:29:47.479230+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/WMKQFJARMN7PRTAX7S7YMK2HNO","json":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO.json","graph_json":"https://pith.science/api/pith-number/WMKQFJARMN7PRTAX7S7YMK2HNO/graph.json","events_json":"https://pith.science/api/pith-number/WMKQFJARMN7PRTAX7S7YMK2HNO/events.json","paper":"https://pith.science/paper/WMKQFJAR"},"agent_actions":{"view_html":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO","download_json":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO.json","view_paper":"https://pith.science/paper/WMKQFJAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04222&json=true","fetch_graph":"https://pith.science/api/pith-number/WMKQFJARMN7PRTAX7S7YMK2HNO/graph.json","fetch_events":"https://pith.science/api/pith-number/WMKQFJARMN7PRTAX7S7YMK2HNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/action/storage_attestation","attest_author":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/action/author_attestation","sign_citation":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/action/citation_signature","submit_replication":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/action/replication_record"}},"created_at":"2026-05-18T01:36:48.819929+00:00","updated_at":"2026-05-18T01:36:48.819929+00:00"}