{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YVPGVXUF5TGCWS5RWSLTGXTBYS","short_pith_number":"pith:YVPGVXUF","canonical_record":{"source":{"id":"2103.16405","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-03-30T14:58:25Z","cross_cats_sorted":[],"title_canon_sha256":"c26fcd1128b022a0b11446116fa7d3730d9ce7ceec7e790b8deb668ff139de46","abstract_canon_sha256":"906882ed54cf650b96f591581bc6cfc7dcb019d30f4033e0d9d209df7d636e59"},"schema_version":"1.0"},"canonical_sha256":"c55e6ade85eccc2b4bb1b497335e61c4b6a347ae886780d054daf12d212f3f46","source":{"kind":"arxiv","id":"2103.16405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.16405","created_at":"2026-07-05T02:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"2103.16405v1","created_at":"2026-07-05T02:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.16405","created_at":"2026-07-05T02:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"YVPGVXUF5TGC","created_at":"2026-07-05T02:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"YVPGVXUF5TGCWS5R","created_at":"2026-07-05T02:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"YVPGVXUF","created_at":"2026-07-05T02:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YVPGVXUF5TGCWS5RWSLTGXTBYS","target":"record","payload":{"canonical_record":{"source":{"id":"2103.16405","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-03-30T14:58:25Z","cross_cats_sorted":[],"title_canon_sha256":"c26fcd1128b022a0b11446116fa7d3730d9ce7ceec7e790b8deb668ff139de46","abstract_canon_sha256":"906882ed54cf650b96f591581bc6cfc7dcb019d30f4033e0d9d209df7d636e59"},"schema_version":"1.0"},"canonical_sha256":"c55e6ade85eccc2b4bb1b497335e61c4b6a347ae886780d054daf12d212f3f46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:27:51.564748Z","signature_b64":"Vh+KP894t1iwZLzhp00B1qva+OpQsXFdrMTxVNG2wUsnBNiangiInGkgVLdS3XIVtWiWWcgg9dgcyrLbs7S2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c55e6ade85eccc2b4bb1b497335e61c4b6a347ae886780d054daf12d212f3f46","last_reissued_at":"2026-07-05T02:27:51.564259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:27:51.564259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.16405","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-07-05T02:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sijeiUkjqFaI+3HMe+POnKCgL5mmTcpIsWmeFFuFfCZHP9Z0xXqtXVQ44JG3UUBu5y8CQYw0jOsfkle7ofdRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:06:19.329157Z"},"content_sha256":"967251b4f4b8d15ae77808bd6d4116dedf7ee1f2667113cd9a586da82230f433","schema_version":"1.0","event_id":"sha256:967251b4f4b8d15ae77808bd6d4116dedf7ee1f2667113cd9a586da82230f433"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YVPGVXUF5TGCWS5RWSLTGXTBYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Price of Anarchy is Fragile in Single-Selection Coverage Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Joshua Seaton, Philip Brown","submitted_at":"2021-03-30T14:58:25Z","abstract_excerpt":"This paper considers coverage games in which a group of agents are tasked with identifying the highest-value subset of resources; in this context, game-theoretic approaches are known to yield Nash equilibria within a factor of 2 of optimal. We consider the case that some of the agents suffer a communication failure and cannot observe the actions of other agents; in this case, recent work has shown that if there are k>0 compromised agents, Nash equilibria are only guaranteed to be within a factor of k+1 of optimal. However, the present paper shows that this worst-case guarantee is fragile; in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.16405","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.16405/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8uSa+DrbJ9dahPzclhq727zwCN45w9QGKkuT6Wt5iJQyd9uC5rbjbc1b7DlzXLmGY2mlEkf2yyhuQzVD6EdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:06:19.330746Z"},"content_sha256":"a62e11a90e4e4a29d234275651b08f5f6741ced0ec778cb88d37149f7d0a57d8","schema_version":"1.0","event_id":"sha256:a62e11a90e4e4a29d234275651b08f5f6741ced0ec778cb88d37149f7d0a57d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVPGVXUF5TGCWS5RWSLTGXTBYS/bundle.json","state_url":"https://pith.science/pith/YVPGVXUF5TGCWS5RWSLTGXTBYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVPGVXUF5TGCWS5RWSLTGXTBYS/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-08-04T10:06:19Z","links":{"resolver":"https://pith.science/pith/YVPGVXUF5TGCWS5RWSLTGXTBYS","bundle":"https://pith.science/pith/YVPGVXUF5TGCWS5RWSLTGXTBYS/bundle.json","state":"https://pith.science/pith/YVPGVXUF5TGCWS5RWSLTGXTBYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVPGVXUF5TGCWS5RWSLTGXTBYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YVPGVXUF5TGCWS5RWSLTGXTBYS","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":"906882ed54cf650b96f591581bc6cfc7dcb019d30f4033e0d9d209df7d636e59","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-03-30T14:58:25Z","title_canon_sha256":"c26fcd1128b022a0b11446116fa7d3730d9ce7ceec7e790b8deb668ff139de46"},"schema_version":"1.0","source":{"id":"2103.16405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.16405","created_at":"2026-07-05T02:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"2103.16405v1","created_at":"2026-07-05T02:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.16405","created_at":"2026-07-05T02:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"YVPGVXUF5TGC","created_at":"2026-07-05T02:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"YVPGVXUF5TGCWS5R","created_at":"2026-07-05T02:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"YVPGVXUF","created_at":"2026-07-05T02:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:a62e11a90e4e4a29d234275651b08f5f6741ced0ec778cb88d37149f7d0a57d8","target":"graph","created_at":"2026-07-05T02:27:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.16405/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers coverage games in which a group of agents are tasked with identifying the highest-value subset of resources; in this context, game-theoretic approaches are known to yield Nash equilibria within a factor of 2 of optimal. We consider the case that some of the agents suffer a communication failure and cannot observe the actions of other agents; in this case, recent work has shown that if there are k>0 compromised agents, Nash equilibria are only guaranteed to be within a factor of k+1 of optimal. However, the present paper shows that this worst-case guarantee is fragile; in a","authors_text":"Joshua Seaton, Philip Brown","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-03-30T14:58:25Z","title":"The Price of Anarchy is Fragile in Single-Selection Coverage Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.16405","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:967251b4f4b8d15ae77808bd6d4116dedf7ee1f2667113cd9a586da82230f433","target":"record","created_at":"2026-07-05T02:27:51Z","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":"906882ed54cf650b96f591581bc6cfc7dcb019d30f4033e0d9d209df7d636e59","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-03-30T14:58:25Z","title_canon_sha256":"c26fcd1128b022a0b11446116fa7d3730d9ce7ceec7e790b8deb668ff139de46"},"schema_version":"1.0","source":{"id":"2103.16405","kind":"arxiv","version":1}},"canonical_sha256":"c55e6ade85eccc2b4bb1b497335e61c4b6a347ae886780d054daf12d212f3f46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c55e6ade85eccc2b4bb1b497335e61c4b6a347ae886780d054daf12d212f3f46","first_computed_at":"2026-07-05T02:27:51.564259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:27:51.564259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vh+KP894t1iwZLzhp00B1qva+OpQsXFdrMTxVNG2wUsnBNiangiInGkgVLdS3XIVtWiWWcgg9dgcyrLbs7S2AA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:27:51.564748Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.16405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:967251b4f4b8d15ae77808bd6d4116dedf7ee1f2667113cd9a586da82230f433","sha256:a62e11a90e4e4a29d234275651b08f5f6741ced0ec778cb88d37149f7d0a57d8"],"state_sha256":"2797ae64108b76ed7faad01a002947d910dd5f275128f45f4312a257766a38c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNwIsZndO25tsxykdwmBTLICl1xA5rwjzUSCXjqbnmwwFdjrbW04ELeXOH0b609Av6Cftbnm2armnk8Up4KoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T10:06:19.341624Z","bundle_sha256":"b4035788909201a6724932dd34f20ea344b3b78ed0a88c370d96127163ff484b"}}