{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CF6ZR42A25MTBIIT22PKR6PEIN","short_pith_number":"pith:CF6ZR42A","canonical_record":{"source":{"id":"1001.0529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-01-04T15:09:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"051070d8ea2a4dc463e554396e51b2a76e26419eacca652ecfba0451e3e1b608","abstract_canon_sha256":"49bfbf727043ce0ad9e05d196c8ab46c687f12441ddddce855e14094e0afa170"},"schema_version":"1.0"},"canonical_sha256":"117d98f340d75930a113d69ea8f9e44351164b088ec63a8208786c938fe5cf55","source":{"kind":"arxiv","id":"1001.0529","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0529","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0529v2","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0529","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"CF6ZR42A25MT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CF6ZR42A25MTBIIT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CF6ZR42A","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CF6ZR42A25MTBIIT22PKR6PEIN","target":"record","payload":{"canonical_record":{"source":{"id":"1001.0529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-01-04T15:09:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"051070d8ea2a4dc463e554396e51b2a76e26419eacca652ecfba0451e3e1b608","abstract_canon_sha256":"49bfbf727043ce0ad9e05d196c8ab46c687f12441ddddce855e14094e0afa170"},"schema_version":"1.0"},"canonical_sha256":"117d98f340d75930a113d69ea8f9e44351164b088ec63a8208786c938fe5cf55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:57.497813Z","signature_b64":"Y3xye3RoLS3NIRj+R0D1PGNIjXmiibS8hlPWdrgXmaxP+Yveghlqox0aZS0CdVHjcN5d7HgwKYzlLn1aL//TCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"117d98f340d75930a113d69ea8f9e44351164b088ec63a8208786c938fe5cf55","last_reissued_at":"2026-05-18T02:27:57.497104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:57.497104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.0529","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-18T02:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E3mUwGgLmLo0mZQ0O3ovxpM8JXiO5dAVHJNvnwEnDzbDM3IVHnvjExyCr30bjk3CfuptsW0mKntLbZWaXDWfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:43:04.657938Z"},"content_sha256":"80065957623e2a2e7183a90553f53cbc96010af17e5f41f25cbda765247544ad","schema_version":"1.0","event_id":"sha256:80065957623e2a2e7183a90553f53cbc96010af17e5f41f25cbda765247544ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CF6ZR42A25MTBIIT22PKR6PEIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Iterated Dominance, Matrix Elimination, and Matched Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Felix Brandt, Felix Fischer, Markus Holzer","submitted_at":"2010-01-04T15:09:53Z","abstract_excerpt":"We study computational problems arising from the iterated removal of weakly dominated actions in anonymous games. Our main result shows that it is NP-complete to decide whether an anonymous game with three actions can be solved via iterated weak dominance. The two-action case can be reformulated as a natural elimination problem on a matrix, the complexity of which turns out to be surprisingly difficult to characterize and ultimately remains open. We however establish connections to a matching problem along paths in a directed graph, which is computationally hard in general but can also be used"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0529","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-18T02:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53BsadxmCi/uB7eCdXZYDu2UXogy37OSrPTaNkufTI35W+ZjwHYABIg+i6QZMsgjyxxe698eKmvqKbXWwgQABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:43:04.658416Z"},"content_sha256":"a44e59cd0f78dd2a35cca186464ce676065075f3d853adf27d2bfbbbccc1acfe","schema_version":"1.0","event_id":"sha256:a44e59cd0f78dd2a35cca186464ce676065075f3d853adf27d2bfbbbccc1acfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN/bundle.json","state_url":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CF6ZR42A25MTBIIT22PKR6PEIN/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-27T14:43:04Z","links":{"resolver":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN","bundle":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN/bundle.json","state":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CF6ZR42A25MTBIIT22PKR6PEIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CF6ZR42A25MTBIIT22PKR6PEIN","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":"49bfbf727043ce0ad9e05d196c8ab46c687f12441ddddce855e14094e0afa170","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-01-04T15:09:53Z","title_canon_sha256":"051070d8ea2a4dc463e554396e51b2a76e26419eacca652ecfba0451e3e1b608"},"schema_version":"1.0","source":{"id":"1001.0529","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0529","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0529v2","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0529","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"CF6ZR42A25MT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CF6ZR42A25MTBIIT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CF6ZR42A","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:a44e59cd0f78dd2a35cca186464ce676065075f3d853adf27d2bfbbbccc1acfe","target":"graph","created_at":"2026-05-18T02:27:57Z","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 study computational problems arising from the iterated removal of weakly dominated actions in anonymous games. Our main result shows that it is NP-complete to decide whether an anonymous game with three actions can be solved via iterated weak dominance. The two-action case can be reformulated as a natural elimination problem on a matrix, the complexity of which turns out to be surprisingly difficult to characterize and ultimately remains open. We however establish connections to a matching problem along paths in a directed graph, which is computationally hard in general but can also be used","authors_text":"Felix Brandt, Felix Fischer, Markus Holzer","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-01-04T15:09:53Z","title":"On Iterated Dominance, Matrix Elimination, and Matched Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0529","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:80065957623e2a2e7183a90553f53cbc96010af17e5f41f25cbda765247544ad","target":"record","created_at":"2026-05-18T02:27:57Z","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":"49bfbf727043ce0ad9e05d196c8ab46c687f12441ddddce855e14094e0afa170","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-01-04T15:09:53Z","title_canon_sha256":"051070d8ea2a4dc463e554396e51b2a76e26419eacca652ecfba0451e3e1b608"},"schema_version":"1.0","source":{"id":"1001.0529","kind":"arxiv","version":2}},"canonical_sha256":"117d98f340d75930a113d69ea8f9e44351164b088ec63a8208786c938fe5cf55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"117d98f340d75930a113d69ea8f9e44351164b088ec63a8208786c938fe5cf55","first_computed_at":"2026-05-18T02:27:57.497104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:57.497104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y3xye3RoLS3NIRj+R0D1PGNIjXmiibS8hlPWdrgXmaxP+Yveghlqox0aZS0CdVHjcN5d7HgwKYzlLn1aL//TCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:57.497813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.0529","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80065957623e2a2e7183a90553f53cbc96010af17e5f41f25cbda765247544ad","sha256:a44e59cd0f78dd2a35cca186464ce676065075f3d853adf27d2bfbbbccc1acfe"],"state_sha256":"b1b77083d6e7a308bd02d1835ebda9e384f14326ee713a200e58fd4309cad1bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ha6q336P4/jNBgfaIjIsvCfDfYt3asUhEmrH0g0rfJVmD9+AYgEiBE1aRkT8XKaDTRznIlnP9pZJmmJgACiKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:43:04.661247Z","bundle_sha256":"75774ceafd37a1409b1b444763cde5893a5dd3b52fb7d7c5c3d02bab1b3dc019"}}