{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:A26TWIAKKFWNEWNQ3PS3YXMWGR","short_pith_number":"pith:A26TWIAK","canonical_record":{"source":{"id":"1506.04047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-12T15:43:38Z","cross_cats_sorted":["cs.DM","cs.MA","math.CO","math.OC"],"title_canon_sha256":"24df9512a53adeef57dcdad6ae8e3c3027f944b66107663e14a2b1cd7b0cdaaf","abstract_canon_sha256":"b3e063c53ab52399773941877843f53f732c9d8cd73b21cbf892674c6d2761ac"},"schema_version":"1.0"},"canonical_sha256":"06bd3b200a516cd259b0dbe5bc5d963461b00bdd8ee0d6add97fb675c9510cd8","source":{"kind":"arxiv","id":"1506.04047","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04047","created_at":"2026-05-18T01:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04047v2","created_at":"2026-05-18T01:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04047","created_at":"2026-05-18T01:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"A26TWIAKKFWN","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A26TWIAKKFWNEWNQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A26TWIAK","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:A26TWIAKKFWNEWNQ3PS3YXMWGR","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-12T15:43:38Z","cross_cats_sorted":["cs.DM","cs.MA","math.CO","math.OC"],"title_canon_sha256":"24df9512a53adeef57dcdad6ae8e3c3027f944b66107663e14a2b1cd7b0cdaaf","abstract_canon_sha256":"b3e063c53ab52399773941877843f53f732c9d8cd73b21cbf892674c6d2761ac"},"schema_version":"1.0"},"canonical_sha256":"06bd3b200a516cd259b0dbe5bc5d963461b00bdd8ee0d6add97fb675c9510cd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:16.073957Z","signature_b64":"LPDbfHSRp1feTTVg4TJTftz1PY+NMEbmX1Oe5MjRNaBPxq42ce+Q8nGHQuQkQi/qi4Y/nKkbOHv+kp10kfZxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06bd3b200a516cd259b0dbe5bc5d963461b00bdd8ee0d6add97fb675c9510cd8","last_reissued_at":"2026-05-18T01:19:16.073363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:16.073363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04047","source_version":2,"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:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NczYY0PKVNrHErO6xNSVA+WODXK/s5FEjM1+Uf+jEA4+28/G5DrSjv5I+7pLn9yz1WJFRMh4FRigkt8TewHCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:24:13.721722Z"},"content_sha256":"523a09510445286894f1d013964c3c850e779afc6be8f4a501a32fc3819768ab","schema_version":"1.0","event_id":"sha256:523a09510445286894f1d013964c3c850e779afc6be8f4a501a32fc3819768ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:A26TWIAKKFWNEWNQ3PS3YXMWGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithm for the Binary-Preference Capacitated Selfish Replication Game and a Tight Bound on its Price of Anarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.MA","math.CO","math.OC"],"primary_cat":"cs.GT","authors_text":"Seyed Rasoul Etesami, Tamer Basar","submitted_at":"2015-06-12T15:43:38Z","abstract_excerpt":"We consider the capacitated selfish replication (CSR) game with binary preferences, over general undirected networks. We first show that such games have an associated ordinary potential function, and hence always admit a pure-strategy Nash equilibrium (NE). Further, when the minimum degree of the network and the number of resources are of the same order, there exists an exact polynomial time algorithm which can find a NE. Following this, we study the price of anarchy of such games, and show that it is bounded above by 3; we further provide some instances for which the price of anarchy is at le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04047","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"},"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:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyYIX0VW2pX4NMcdrL5yp/AWnuXWoy8jL9Ttnn+NwcDMCHWQPHo3SdaQjmEJt1buOU7TJDBoR+prYA5G6MtpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:24:13.722484Z"},"content_sha256":"a5f2644c44de0f3ce3ada07ca36c42c76f24cfc0774ad8ede8219e4abf4db18f","schema_version":"1.0","event_id":"sha256:a5f2644c44de0f3ce3ada07ca36c42c76f24cfc0774ad8ede8219e4abf4db18f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A26TWIAKKFWNEWNQ3PS3YXMWGR/bundle.json","state_url":"https://pith.science/pith/A26TWIAKKFWNEWNQ3PS3YXMWGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A26TWIAKKFWNEWNQ3PS3YXMWGR/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-31T18:24:13Z","links":{"resolver":"https://pith.science/pith/A26TWIAKKFWNEWNQ3PS3YXMWGR","bundle":"https://pith.science/pith/A26TWIAKKFWNEWNQ3PS3YXMWGR/bundle.json","state":"https://pith.science/pith/A26TWIAKKFWNEWNQ3PS3YXMWGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A26TWIAKKFWNEWNQ3PS3YXMWGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:A26TWIAKKFWNEWNQ3PS3YXMWGR","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":"b3e063c53ab52399773941877843f53f732c9d8cd73b21cbf892674c6d2761ac","cross_cats_sorted":["cs.DM","cs.MA","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-12T15:43:38Z","title_canon_sha256":"24df9512a53adeef57dcdad6ae8e3c3027f944b66107663e14a2b1cd7b0cdaaf"},"schema_version":"1.0","source":{"id":"1506.04047","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04047","created_at":"2026-05-18T01:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04047v2","created_at":"2026-05-18T01:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04047","created_at":"2026-05-18T01:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"A26TWIAKKFWN","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A26TWIAKKFWNEWNQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A26TWIAK","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:a5f2644c44de0f3ce3ada07ca36c42c76f24cfc0774ad8ede8219e4abf4db18f","target":"graph","created_at":"2026-05-18T01:19:16Z","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":"We consider the capacitated selfish replication (CSR) game with binary preferences, over general undirected networks. We first show that such games have an associated ordinary potential function, and hence always admit a pure-strategy Nash equilibrium (NE). Further, when the minimum degree of the network and the number of resources are of the same order, there exists an exact polynomial time algorithm which can find a NE. Following this, we study the price of anarchy of such games, and show that it is bounded above by 3; we further provide some instances for which the price of anarchy is at le","authors_text":"Seyed Rasoul Etesami, Tamer Basar","cross_cats":["cs.DM","cs.MA","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-12T15:43:38Z","title":"Approximation Algorithm for the Binary-Preference Capacitated Selfish Replication Game and a Tight Bound on its Price of Anarchy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04047","kind":"arxiv","version":2},"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:523a09510445286894f1d013964c3c850e779afc6be8f4a501a32fc3819768ab","target":"record","created_at":"2026-05-18T01:19:16Z","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":"b3e063c53ab52399773941877843f53f732c9d8cd73b21cbf892674c6d2761ac","cross_cats_sorted":["cs.DM","cs.MA","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-12T15:43:38Z","title_canon_sha256":"24df9512a53adeef57dcdad6ae8e3c3027f944b66107663e14a2b1cd7b0cdaaf"},"schema_version":"1.0","source":{"id":"1506.04047","kind":"arxiv","version":2}},"canonical_sha256":"06bd3b200a516cd259b0dbe5bc5d963461b00bdd8ee0d6add97fb675c9510cd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06bd3b200a516cd259b0dbe5bc5d963461b00bdd8ee0d6add97fb675c9510cd8","first_computed_at":"2026-05-18T01:19:16.073363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:16.073363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LPDbfHSRp1feTTVg4TJTftz1PY+NMEbmX1Oe5MjRNaBPxq42ce+Q8nGHQuQkQi/qi4Y/nKkbOHv+kp10kfZxBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:16.073957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04047","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:523a09510445286894f1d013964c3c850e779afc6be8f4a501a32fc3819768ab","sha256:a5f2644c44de0f3ce3ada07ca36c42c76f24cfc0774ad8ede8219e4abf4db18f"],"state_sha256":"74f1d9513a580c190b11c978ddbdb18ffa541d4d2557c63a3e1e4562c75176c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2RTWSFs+MCvVMBsu0z2+dHMzka1HM8ilRgVagIOcEhHIfyMGpgpTZJ3Mt7YqtKQXqhYBnMzvJnvhduRfF5ALDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:24:13.726362Z","bundle_sha256":"9c1dc0a44f995f5b989bc7b8a90ef6661d9fcfafa2154fde4080e102347143d2"}}