{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CF6ZR42A25MTBIIT22PKR6PEIN","short_pith_number":"pith:CF6ZR42A","schema_version":"1.0","canonical_sha256":"117d98f340d75930a113d69ea8f9e44351164b088ec63a8208786c938fe5cf55","source":{"kind":"arxiv","id":"1001.0529","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1001.0529","created_at":"2026-05-18T02:27:57.497215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.0529v2","created_at":"2026-05-18T02:27:57.497215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0529","created_at":"2026-05-18T02:27:57.497215+00:00"},{"alias_kind":"pith_short_12","alias_value":"CF6ZR42A25MT","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CF6ZR42A25MTBIIT","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CF6ZR42A","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN","json":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN.json","graph_json":"https://pith.science/api/pith-number/CF6ZR42A25MTBIIT22PKR6PEIN/graph.json","events_json":"https://pith.science/api/pith-number/CF6ZR42A25MTBIIT22PKR6PEIN/events.json","paper":"https://pith.science/paper/CF6ZR42A"},"agent_actions":{"view_html":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN","download_json":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN.json","view_paper":"https://pith.science/paper/CF6ZR42A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.0529&json=true","fetch_graph":"https://pith.science/api/pith-number/CF6ZR42A25MTBIIT22PKR6PEIN/graph.json","fetch_events":"https://pith.science/api/pith-number/CF6ZR42A25MTBIIT22PKR6PEIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN/action/storage_attestation","attest_author":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN/action/author_attestation","sign_citation":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN/action/citation_signature","submit_replication":"https://pith.science/pith/CF6ZR42A25MTBIIT22PKR6PEIN/action/replication_record"}},"created_at":"2026-05-18T02:27:57.497215+00:00","updated_at":"2026-05-18T02:27:57.497215+00:00"}