{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JKVNFXGQPKLZQEYTEK53X5MXNN","short_pith_number":"pith:JKVNFXGQ","canonical_record":{"source":{"id":"1303.3777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-13T18:11:16Z","cross_cats_sorted":["cs.DS","cs.GT"],"title_canon_sha256":"bc8a5f28ae752515be4936e190f1d208dee029aabf4711bc4cb97e505992f38d","abstract_canon_sha256":"4fe1c0d4da37e0882f800676dac4c27626ad71502fce9ace7177311719284c9b"},"schema_version":"1.0"},"canonical_sha256":"4aaad2dcd07a9798131322bbbbf5976b4db7e6476cf367527a9adf889ef5cb76","source":{"kind":"arxiv","id":"1303.3777","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3777","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3777v2","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3777","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"JKVNFXGQPKLZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JKVNFXGQPKLZQEYT","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JKVNFXGQ","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JKVNFXGQPKLZQEYTEK53X5MXNN","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-13T18:11:16Z","cross_cats_sorted":["cs.DS","cs.GT"],"title_canon_sha256":"bc8a5f28ae752515be4936e190f1d208dee029aabf4711bc4cb97e505992f38d","abstract_canon_sha256":"4fe1c0d4da37e0882f800676dac4c27626ad71502fce9ace7177311719284c9b"},"schema_version":"1.0"},"canonical_sha256":"4aaad2dcd07a9798131322bbbbf5976b4db7e6476cf367527a9adf889ef5cb76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:46.547800Z","signature_b64":"rhn9qsaEI0FGjHDTA+cvQDj/J+O5WhjBrTvpKsb5YyFUxam8q/+bLCQ3BuNxv2ixQsmzn5YcgXfs7maMQ5utCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aaad2dcd07a9798131322bbbbf5976b4db7e6476cf367527a9adf889ef5cb76","last_reissued_at":"2026-05-18T03:17:46.546909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:46.546909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3777","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-18T03:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pl5HlF/fuvu6f5F+OE8Em0oWoVL8TKS5QyN4GP1TVsKcaea9mBOdQGyxKuOIK6jr6h1zmcGYg1MgJcTqqaPcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:54:45.886359Z"},"content_sha256":"5a366ea10b340b029db5dc18b413997d95b94dc2c2b13a86e1328ff372ca40bd","schema_version":"1.0","event_id":"sha256:5a366ea10b340b029db5dc18b413997d95b94dc2c2b13a86e1328ff372ca40bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JKVNFXGQPKLZQEYTEK53X5MXNN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternating Traps in Muller and Parity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.GT"],"primary_cat":"cs.LO","authors_text":"A. Grinshpun, A. Tarfulea, P. Phalitnonkiat, S. Rubin","submitted_at":"2013-03-13T18:11:16Z","abstract_excerpt":"Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is to compute the winning regions for the players. Different classes and representations of Muller games lead to problems of varying computational complexity. One such class are parity games; these are of particular significance in computational complexity, as they remain one of the few combinatorial problems known to be in NP and co-NP but not known to be in P. We show that winning regions for a Muller game can be det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3777","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-18T03:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G8G4SxsQbtyfgewHkSMLPqMw861aNhZv8q6B3+sARqIhge/VQHdYgpCyATPLHWm2ydbFDnlBe7UASV+pDcpIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:54:45.886729Z"},"content_sha256":"8e0142fe626c172f68a938cc36f0b95a22183490fd016ee994bb79783e2a61ca","schema_version":"1.0","event_id":"sha256:8e0142fe626c172f68a938cc36f0b95a22183490fd016ee994bb79783e2a61ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKVNFXGQPKLZQEYTEK53X5MXNN/bundle.json","state_url":"https://pith.science/pith/JKVNFXGQPKLZQEYTEK53X5MXNN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKVNFXGQPKLZQEYTEK53X5MXNN/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-03T02:54:45Z","links":{"resolver":"https://pith.science/pith/JKVNFXGQPKLZQEYTEK53X5MXNN","bundle":"https://pith.science/pith/JKVNFXGQPKLZQEYTEK53X5MXNN/bundle.json","state":"https://pith.science/pith/JKVNFXGQPKLZQEYTEK53X5MXNN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKVNFXGQPKLZQEYTEK53X5MXNN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JKVNFXGQPKLZQEYTEK53X5MXNN","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":"4fe1c0d4da37e0882f800676dac4c27626ad71502fce9ace7177311719284c9b","cross_cats_sorted":["cs.DS","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-13T18:11:16Z","title_canon_sha256":"bc8a5f28ae752515be4936e190f1d208dee029aabf4711bc4cb97e505992f38d"},"schema_version":"1.0","source":{"id":"1303.3777","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3777","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3777v2","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3777","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"JKVNFXGQPKLZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JKVNFXGQPKLZQEYT","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JKVNFXGQ","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:8e0142fe626c172f68a938cc36f0b95a22183490fd016ee994bb79783e2a61ca","target":"graph","created_at":"2026-05-18T03:17:46Z","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":"Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is to compute the winning regions for the players. Different classes and representations of Muller games lead to problems of varying computational complexity. One such class are parity games; these are of particular significance in computational complexity, as they remain one of the few combinatorial problems known to be in NP and co-NP but not known to be in P. We show that winning regions for a Muller game can be det","authors_text":"A. Grinshpun, A. Tarfulea, P. Phalitnonkiat, S. Rubin","cross_cats":["cs.DS","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-13T18:11:16Z","title":"Alternating Traps in Muller and Parity Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3777","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:5a366ea10b340b029db5dc18b413997d95b94dc2c2b13a86e1328ff372ca40bd","target":"record","created_at":"2026-05-18T03:17:46Z","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":"4fe1c0d4da37e0882f800676dac4c27626ad71502fce9ace7177311719284c9b","cross_cats_sorted":["cs.DS","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-13T18:11:16Z","title_canon_sha256":"bc8a5f28ae752515be4936e190f1d208dee029aabf4711bc4cb97e505992f38d"},"schema_version":"1.0","source":{"id":"1303.3777","kind":"arxiv","version":2}},"canonical_sha256":"4aaad2dcd07a9798131322bbbbf5976b4db7e6476cf367527a9adf889ef5cb76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4aaad2dcd07a9798131322bbbbf5976b4db7e6476cf367527a9adf889ef5cb76","first_computed_at":"2026-05-18T03:17:46.546909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:46.546909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rhn9qsaEI0FGjHDTA+cvQDj/J+O5WhjBrTvpKsb5YyFUxam8q/+bLCQ3BuNxv2ixQsmzn5YcgXfs7maMQ5utCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:46.547800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3777","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a366ea10b340b029db5dc18b413997d95b94dc2c2b13a86e1328ff372ca40bd","sha256:8e0142fe626c172f68a938cc36f0b95a22183490fd016ee994bb79783e2a61ca"],"state_sha256":"13d9f099c9540694052e899c9038bdfac100a0e8a3bfa6ac19cbe4d761c0a090"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NbNgDLiz8+GB0Lw8q1wTAhC9pOfB8pM6UFoyi5tuQsEDAzD33gAm2Zkut+HdwtPouPDJqMYZrEeZPxTdp9zvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:54:45.888762Z","bundle_sha256":"e52b0b5815bcc5501e077f0a9901d435cb9ddd302760b2df09c08ff2c95b890f"}}