{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BDIHCBHDFADRSOJDWZ5WVSNC5N","short_pith_number":"pith:BDIHCBHD","schema_version":"1.0","canonical_sha256":"08d07104e32807193923b67b6ac9a2eb442c45865245eee1f582bc0a6824ad64","source":{"kind":"arxiv","id":"1410.0833","version":4},"attestation_state":"computed","paper":{"title":"Improved Algorithms for Parity and Streett objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer","submitted_at":"2014-10-03T12:24:33Z","abstract_excerpt":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on $n$ vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time $O(n^{5/2})$ and for (2) k-pair Streett objectives in graphs in time"},"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":"1410.0833","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T12:24:33Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d4146de0b04a2f093ddbfd072b934479d44b4e0430f19eb6828c6add744de9f5","abstract_canon_sha256":"4e19c77dc43faac9fa9212f6d4017161c89e10c6b1540c8e3ba3eab6cc1a5467"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:23.996129Z","signature_b64":"A7JF8+fXetbEnnTsxQQnT1A4NhJ/lY7PUaocOBIoqGORpGTg4mFNS7oLXZl0SkGeMbz7cdWCuwVfq+U5H/dUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08d07104e32807193923b67b6ac9a2eb442c45865245eee1f582bc0a6824ad64","last_reissued_at":"2026-05-17T23:51:23.995543Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:23.995543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithms for Parity and Streett objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer","submitted_at":"2014-10-03T12:24:33Z","abstract_excerpt":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on $n$ vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time $O(n^{5/2})$ and for (2) k-pair Streett objectives in graphs in time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0833","kind":"arxiv","version":4},"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":"1410.0833","created_at":"2026-05-17T23:51:23.995641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0833v4","created_at":"2026-05-17T23:51:23.995641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0833","created_at":"2026-05-17T23:51:23.995641+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDIHCBHDFADR","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDIHCBHDFADRSOJD","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDIHCBHD","created_at":"2026-05-18T12:28:22.404517+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/BDIHCBHDFADRSOJDWZ5WVSNC5N","json":"https://pith.science/pith/BDIHCBHDFADRSOJDWZ5WVSNC5N.json","graph_json":"https://pith.science/api/pith-number/BDIHCBHDFADRSOJDWZ5WVSNC5N/graph.json","events_json":"https://pith.science/api/pith-number/BDIHCBHDFADRSOJDWZ5WVSNC5N/events.json","paper":"https://pith.science/paper/BDIHCBHD"},"agent_actions":{"view_html":"https://pith.science/pith/BDIHCBHDFADRSOJDWZ5WVSNC5N","download_json":"https://pith.science/pith/BDIHCBHDFADRSOJDWZ5WVSNC5N.json","view_paper":"https://pith.science/paper/BDIHCBHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0833&json=true","fetch_graph":"https://pith.science/api/pith-number/BDIHCBHDFADRSOJDWZ5WVSNC5N/graph.json","fetch_events":"https://pith.science/api/pith-number/BDIHCBHDFADRSOJDWZ5WVSNC5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDIHCBHDFADRSOJDWZ5WVSNC5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDIHCBHDFADRSOJDWZ5WVSNC5N/action/storage_attestation","attest_author":"https://pith.science/pith/BDIHCBHDFADRSOJDWZ5WVSNC5N/action/author_attestation","sign_citation":"https://pith.science/pith/BDIHCBHDFADRSOJDWZ5WVSNC5N/action/citation_signature","submit_replication":"https://pith.science/pith/BDIHCBHDFADRSOJDWZ5WVSNC5N/action/replication_record"}},"created_at":"2026-05-17T23:51:23.995641+00:00","updated_at":"2026-05-17T23:51:23.995641+00:00"}