{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IKPSQSTHFXO3HE2S5DLBJMX2ES","short_pith_number":"pith:IKPSQSTH","schema_version":"1.0","canonical_sha256":"429f284a672dddb39352e8d614b2fa24a6dc2455808d88f2b37e906eb9dc63fb","source":{"kind":"arxiv","id":"1208.1640","version":1},"attestation_state":"computed","paper":{"title":"Graph Operations on Parity Games and Polynomial-Time Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Alexandru I. Tomescu, Christoph Dittmann, Stephan Kreutzer","submitted_at":"2012-08-08T11:04:55Z","abstract_excerpt":"Parity games are games that are played on directed graphs whose vertices are labeled by natural numbers, called priorities. The players push a token along the edges of the digraph. The winner is determined by the parity of the greatest priority occurring infinitely often in this infinite play.\n  A motivation for studying parity games comes from the area of formal verification of systems by model checking. Deciding the winner in a parity game is polynomial time equivalent to the model checking problem of the modal mu-calculus. Another strong motivation lies in the fact that the exact complexity"},"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":"1208.1640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T11:04:55Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b4be8746c0881c813ea60667dfe1212a1a54dfe0923fd2d9c64c0a56a5a19c4e","abstract_canon_sha256":"48cfb5180d839e855896e4fddd23f966b50b1dc026f245e4e72ff3bbc0154c38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:01.415511Z","signature_b64":"ZWwtZ8tr09Bohl6E7/bf9rfn6zjcF4LR+q9GziLYbXyn5Ay9afEuPIfn9crsxujsHg644CXfJizo8TZ5j1fcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"429f284a672dddb39352e8d614b2fa24a6dc2455808d88f2b37e906eb9dc63fb","last_reissued_at":"2026-05-18T02:21:01.414958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:01.414958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Operations on Parity Games and Polynomial-Time Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Alexandru I. Tomescu, Christoph Dittmann, Stephan Kreutzer","submitted_at":"2012-08-08T11:04:55Z","abstract_excerpt":"Parity games are games that are played on directed graphs whose vertices are labeled by natural numbers, called priorities. The players push a token along the edges of the digraph. The winner is determined by the parity of the greatest priority occurring infinitely often in this infinite play.\n  A motivation for studying parity games comes from the area of formal verification of systems by model checking. Deciding the winner in a parity game is polynomial time equivalent to the model checking problem of the modal mu-calculus. Another strong motivation lies in the fact that the exact complexity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1640","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.1640","created_at":"2026-05-18T02:21:01.415043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1640v1","created_at":"2026-05-18T02:21:01.415043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1640","created_at":"2026-05-18T02:21:01.415043+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKPSQSTHFXO3","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKPSQSTHFXO3HE2S","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKPSQSTH","created_at":"2026-05-18T12:27:09.501522+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/IKPSQSTHFXO3HE2S5DLBJMX2ES","json":"https://pith.science/pith/IKPSQSTHFXO3HE2S5DLBJMX2ES.json","graph_json":"https://pith.science/api/pith-number/IKPSQSTHFXO3HE2S5DLBJMX2ES/graph.json","events_json":"https://pith.science/api/pith-number/IKPSQSTHFXO3HE2S5DLBJMX2ES/events.json","paper":"https://pith.science/paper/IKPSQSTH"},"agent_actions":{"view_html":"https://pith.science/pith/IKPSQSTHFXO3HE2S5DLBJMX2ES","download_json":"https://pith.science/pith/IKPSQSTHFXO3HE2S5DLBJMX2ES.json","view_paper":"https://pith.science/paper/IKPSQSTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1640&json=true","fetch_graph":"https://pith.science/api/pith-number/IKPSQSTHFXO3HE2S5DLBJMX2ES/graph.json","fetch_events":"https://pith.science/api/pith-number/IKPSQSTHFXO3HE2S5DLBJMX2ES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKPSQSTHFXO3HE2S5DLBJMX2ES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKPSQSTHFXO3HE2S5DLBJMX2ES/action/storage_attestation","attest_author":"https://pith.science/pith/IKPSQSTHFXO3HE2S5DLBJMX2ES/action/author_attestation","sign_citation":"https://pith.science/pith/IKPSQSTHFXO3HE2S5DLBJMX2ES/action/citation_signature","submit_replication":"https://pith.science/pith/IKPSQSTHFXO3HE2S5DLBJMX2ES/action/replication_record"}},"created_at":"2026-05-18T02:21:01.415043+00:00","updated_at":"2026-05-18T02:21:01.415043+00:00"}