{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AOA5MRBSVU6Z7DVTKFZYYKEB57","short_pith_number":"pith:AOA5MRBS","canonical_record":{"source":{"id":"1903.06288","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SY","submitted_at":"2019-03-14T22:44:55Z","cross_cats_sorted":["cs.GT","cs.MA"],"title_canon_sha256":"81012498d1fe794e65a58660d2ed39626ec122aed8652f9ea2704476e1b69f67","abstract_canon_sha256":"c88ddd7ec07fa90df26aa1d0103f59397693b2d5420d9f6449e9898df4a5f24d"},"schema_version":"1.0"},"canonical_sha256":"0381d64432ad3d9f8eb351738c2881efdbe09dc8e6fefb5bd4b8b37130ccd738","source":{"kind":"arxiv","id":"1903.06288","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06288","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06288v1","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06288","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"AOA5MRBSVU6Z","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AOA5MRBSVU6Z7DVT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AOA5MRBS","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AOA5MRBSVU6Z7DVTKFZYYKEB57","target":"record","payload":{"canonical_record":{"source":{"id":"1903.06288","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SY","submitted_at":"2019-03-14T22:44:55Z","cross_cats_sorted":["cs.GT","cs.MA"],"title_canon_sha256":"81012498d1fe794e65a58660d2ed39626ec122aed8652f9ea2704476e1b69f67","abstract_canon_sha256":"c88ddd7ec07fa90df26aa1d0103f59397693b2d5420d9f6449e9898df4a5f24d"},"schema_version":"1.0"},"canonical_sha256":"0381d64432ad3d9f8eb351738c2881efdbe09dc8e6fefb5bd4b8b37130ccd738","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:11.222790Z","signature_b64":"CsBccnghsl/Dd1DXNvSTPxxD1eA8htUtE4NL/ehd2l2YkLGauHsG0ntDJz013jLbxqUlfmw1hzdueDpNafD9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0381d64432ad3d9f8eb351738c2881efdbe09dc8e6fefb5bd4b8b37130ccd738","last_reissued_at":"2026-05-17T23:51:11.222164Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:11.222164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.06288","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-17T23:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaQssfLG+MMwgf8Hm2OkkOgmnWc66cLwWj9g0NQPgvV2gb/zh/xPUXWB/D4344GovaXIbUZsvmq6q0pOL8t3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:19:38.542413Z"},"content_sha256":"e479f81c0b46dbde197c97d096c4ee7e56ad99cc5f166b3efe1c9f6d177e5cd6","schema_version":"1.0","event_id":"sha256:e479f81c0b46dbde197c97d096c4ee7e56ad99cc5f166b3efe1c9f6d177e5cd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AOA5MRBSVU6Z7DVTKFZYYKEB57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Price of Anarchy in Cost-Sharing Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.SY","authors_text":"Dario Paccagnan, Jason R. Marden, Rahul Chandan","submitted_at":"2019-03-14T22:44:55Z","abstract_excerpt":"The design of distributed algorithms is central to the study of multiagent systems control. In this paper, we consider a class of combinatorial cost-minimization problems and propose a framework for designing distributed algorithms with a priori performance guarantees that are near-optimal. We approach this problem from a game-theoretic perspective, assigning agents cost functions such that the equilibrium efficiency (price of anarchy) is optimized. Once agents' cost functions have been specified, any algorithm capable of computing a Nash equilibrium of the system inherits a performance guaran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06288","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-17T23:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HqYwcr1Ooj7oGpBNu9v3LKoGkO9W88iFHHOyVFGPGRYl4sHA0PCXbh9PsXjmAksowDqNC2mjfVGIw0GzILuLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:19:38.543046Z"},"content_sha256":"5be95d0c160d1686b3a33b31b688046fc895e0eb8f34ef9ccf04cdd1fe578b65","schema_version":"1.0","event_id":"sha256:5be95d0c160d1686b3a33b31b688046fc895e0eb8f34ef9ccf04cdd1fe578b65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/bundle.json","state_url":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/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-06-06T15:19:38Z","links":{"resolver":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57","bundle":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/bundle.json","state":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AOA5MRBSVU6Z7DVTKFZYYKEB57","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":"c88ddd7ec07fa90df26aa1d0103f59397693b2d5420d9f6449e9898df4a5f24d","cross_cats_sorted":["cs.GT","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SY","submitted_at":"2019-03-14T22:44:55Z","title_canon_sha256":"81012498d1fe794e65a58660d2ed39626ec122aed8652f9ea2704476e1b69f67"},"schema_version":"1.0","source":{"id":"1903.06288","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06288","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06288v1","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06288","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"AOA5MRBSVU6Z","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AOA5MRBSVU6Z7DVT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AOA5MRBS","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:5be95d0c160d1686b3a33b31b688046fc895e0eb8f34ef9ccf04cdd1fe578b65","target":"graph","created_at":"2026-05-17T23:51:11Z","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":"The design of distributed algorithms is central to the study of multiagent systems control. In this paper, we consider a class of combinatorial cost-minimization problems and propose a framework for designing distributed algorithms with a priori performance guarantees that are near-optimal. We approach this problem from a game-theoretic perspective, assigning agents cost functions such that the equilibrium efficiency (price of anarchy) is optimized. Once agents' cost functions have been specified, any algorithm capable of computing a Nash equilibrium of the system inherits a performance guaran","authors_text":"Dario Paccagnan, Jason R. Marden, Rahul Chandan","cross_cats":["cs.GT","cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SY","submitted_at":"2019-03-14T22:44:55Z","title":"Optimal Price of Anarchy in Cost-Sharing Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06288","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:e479f81c0b46dbde197c97d096c4ee7e56ad99cc5f166b3efe1c9f6d177e5cd6","target":"record","created_at":"2026-05-17T23:51:11Z","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":"c88ddd7ec07fa90df26aa1d0103f59397693b2d5420d9f6449e9898df4a5f24d","cross_cats_sorted":["cs.GT","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SY","submitted_at":"2019-03-14T22:44:55Z","title_canon_sha256":"81012498d1fe794e65a58660d2ed39626ec122aed8652f9ea2704476e1b69f67"},"schema_version":"1.0","source":{"id":"1903.06288","kind":"arxiv","version":1}},"canonical_sha256":"0381d64432ad3d9f8eb351738c2881efdbe09dc8e6fefb5bd4b8b37130ccd738","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0381d64432ad3d9f8eb351738c2881efdbe09dc8e6fefb5bd4b8b37130ccd738","first_computed_at":"2026-05-17T23:51:11.222164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:11.222164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CsBccnghsl/Dd1DXNvSTPxxD1eA8htUtE4NL/ehd2l2YkLGauHsG0ntDJz013jLbxqUlfmw1hzdueDpNafD9Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:11.222790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06288","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e479f81c0b46dbde197c97d096c4ee7e56ad99cc5f166b3efe1c9f6d177e5cd6","sha256:5be95d0c160d1686b3a33b31b688046fc895e0eb8f34ef9ccf04cdd1fe578b65"],"state_sha256":"6b73a2072ca21e9fd01af2875636b1a282a3ee700c2b9896d06898f7424ac34b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHDj4osobAGJQ4W0I3DQYQVbYUMaauMoI0d2vsD9kd48xikL1M1hhW+FD5oaS94OdqKCegDQy5rBq+7VFgFHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:19:38.546737Z","bundle_sha256":"854e76ae47f224ccbd78396c5053740ad6b0e4c90cf1e1f42f7f69590db6e0b1"}}