{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WMKQFJARMN7PRTAX7S7YMK2HNO","short_pith_number":"pith:WMKQFJAR","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"},"canonical_sha256":"b31502a411637ef8cc17fcbf862b476b8617d18bdc67630ea6d795e67eb3f80e","source":{"kind":"arxiv","id":"1507.04222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04222","created_at":"2026-05-18T01:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04222v1","created_at":"2026-05-18T01:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04222","created_at":"2026-05-18T01:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"WMKQFJARMN7P","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WMKQFJARMN7PRTAX","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WMKQFJAR","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WMKQFJARMN7PRTAX7S7YMK2HNO","target":"record","payload":{"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"},"canonical_sha256":"b31502a411637ef8cc17fcbf862b476b8617d18bdc67630ea6d795e67eb3f80e","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"},"source_kind":"arxiv","source_id":"1507.04222","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Sp/xH97xkLEDW+D4y9htiARQGOreWNWUSxanyRY/5+phLVrKeQKcalzpTOcGVI98tzHoBH6k+RpynpYKMugAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:19:57.251747Z"},"content_sha256":"6233f59b9b928c220b74758c446b5135e9a1f12920a05632ae12d6062613c66b","schema_version":"1.0","event_id":"sha256:6233f59b9b928c220b74758c446b5135e9a1f12920a05632ae12d6062613c66b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WMKQFJARMN7PRTAX7S7YMK2HNO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QbF6JPJvY6cPHJR2fJve7FFKaQOIcVXPcd4/hH8q4VZsZiYqCgnTnr0kZ0KpSemiggooU59djqlTrFCzMWCbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:19:57.252386Z"},"content_sha256":"09990bc28b72de9d7165a53bb3827076addda07e2d59bfc199d8b1b8e15cdb85","schema_version":"1.0","event_id":"sha256:09990bc28b72de9d7165a53bb3827076addda07e2d59bfc199d8b1b8e15cdb85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/bundle.json","state_url":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T05:19:57Z","links":{"resolver":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO","bundle":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/bundle.json","state":"https://pith.science/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMKQFJARMN7PRTAX7S7YMK2HNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WMKQFJARMN7PRTAX7S7YMK2HNO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5b8a93d9d4dbb3e3b84c743d05c5c7b44cb36eac8687557bc076aa6c476e8b4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-15T13:53:57Z","title_canon_sha256":"440860d81f60f8879b86435599ffb037a34dc231516051f2300fb58e3d540c6a"},"schema_version":"1.0","source":{"id":"1507.04222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04222","created_at":"2026-05-18T01:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04222v1","created_at":"2026-05-18T01:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04222","created_at":"2026-05-18T01:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"WMKQFJARMN7P","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WMKQFJARMN7PRTAX","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WMKQFJAR","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:09990bc28b72de9d7165a53bb3827076addda07e2d59bfc199d8b1b8e15cdb85","target":"graph","created_at":"2026-05-18T01:36:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 $","authors_text":"Akaki Mamageishvili, Matus Mihalak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-15T13:53:57Z","title":"Multicast Network Design Game on a Ring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04222","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6233f59b9b928c220b74758c446b5135e9a1f12920a05632ae12d6062613c66b","target":"record","created_at":"2026-05-18T01:36:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5b8a93d9d4dbb3e3b84c743d05c5c7b44cb36eac8687557bc076aa6c476e8b4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-15T13:53:57Z","title_canon_sha256":"440860d81f60f8879b86435599ffb037a34dc231516051f2300fb58e3d540c6a"},"schema_version":"1.0","source":{"id":"1507.04222","kind":"arxiv","version":1}},"canonical_sha256":"b31502a411637ef8cc17fcbf862b476b8617d18bdc67630ea6d795e67eb3f80e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b31502a411637ef8cc17fcbf862b476b8617d18bdc67630ea6d795e67eb3f80e","first_computed_at":"2026-05-18T01:36:48.819817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:48.819817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ht359KjL6M8WyB/P+2Nw+68IAWJMKlTghShUHJ+07ekr8EethNOUkTQGB6TAorwM2qhXcBLRiWU4LvmarUT3Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:48.820423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6233f59b9b928c220b74758c446b5135e9a1f12920a05632ae12d6062613c66b","sha256:09990bc28b72de9d7165a53bb3827076addda07e2d59bfc199d8b1b8e15cdb85"],"state_sha256":"df8d0347a9f32d2605be75fcfb6cf5dd780efdacc00a6200dac7f534220f0d1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"62r11W+Uk4IDd07qIbYb1ZMHmu17KmV5dThy8/ouEtgF8Z7kPsxm58i6g/vatz98E59wTKoC/Ltr+FslifEjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:19:57.255713Z","bundle_sha256":"84cfb685382e011f21c0f9f1b351975614390bc28f2b1c36268281d1e421e2dd"}}