{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FSQZKVMWTUAKBA3FSQ45IQLN7S","short_pith_number":"pith:FSQZKVMW","schema_version":"1.0","canonical_sha256":"2ca19555969d00a083659439d4416dfc9385e1290853ea9c717dfab545f8595d","source":{"kind":"arxiv","id":"1706.06139","version":1},"attestation_state":"computed","paper":{"title":"Faster Algorithms for Mean-Payoff Parity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Alexander Svozil, Krishnendu Chatterjee, Monika Henzinger","submitted_at":"2017-06-19T18:59:10Z","abstract_excerpt":"Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative go"},"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":"1706.06139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-06-19T18:59:10Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"c045551c7f47fe0c33b91a9c2b5bc2793bf27122f4d664e111193308d6ca1603","abstract_canon_sha256":"bdff0801d8d2efb70a2d38b16dc73034c9576c4f02a5161f4119744e0a5f40e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:04.163102Z","signature_b64":"clxDkk0VqD3l59L8ZaA3epoaF8JQKKJNLTyiwgdJEdM/G1pushu+JJ0LaD1MrpyB0YWtSg0/eIih5ZlNuPruBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ca19555969d00a083659439d4416dfc9385e1290853ea9c717dfab545f8595d","last_reissued_at":"2026-05-18T00:42:04.162448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:04.162448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for Mean-Payoff Parity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Alexander Svozil, Krishnendu Chatterjee, Monika Henzinger","submitted_at":"2017-06-19T18:59:10Z","abstract_excerpt":"Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative go"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06139","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":"1706.06139","created_at":"2026-05-18T00:42:04.162545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06139v1","created_at":"2026-05-18T00:42:04.162545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06139","created_at":"2026-05-18T00:42:04.162545+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSQZKVMWTUAK","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSQZKVMWTUAKBA3F","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSQZKVMW","created_at":"2026-05-18T12:31:15.632608+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/FSQZKVMWTUAKBA3FSQ45IQLN7S","json":"https://pith.science/pith/FSQZKVMWTUAKBA3FSQ45IQLN7S.json","graph_json":"https://pith.science/api/pith-number/FSQZKVMWTUAKBA3FSQ45IQLN7S/graph.json","events_json":"https://pith.science/api/pith-number/FSQZKVMWTUAKBA3FSQ45IQLN7S/events.json","paper":"https://pith.science/paper/FSQZKVMW"},"agent_actions":{"view_html":"https://pith.science/pith/FSQZKVMWTUAKBA3FSQ45IQLN7S","download_json":"https://pith.science/pith/FSQZKVMWTUAKBA3FSQ45IQLN7S.json","view_paper":"https://pith.science/paper/FSQZKVMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06139&json=true","fetch_graph":"https://pith.science/api/pith-number/FSQZKVMWTUAKBA3FSQ45IQLN7S/graph.json","fetch_events":"https://pith.science/api/pith-number/FSQZKVMWTUAKBA3FSQ45IQLN7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSQZKVMWTUAKBA3FSQ45IQLN7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSQZKVMWTUAKBA3FSQ45IQLN7S/action/storage_attestation","attest_author":"https://pith.science/pith/FSQZKVMWTUAKBA3FSQ45IQLN7S/action/author_attestation","sign_citation":"https://pith.science/pith/FSQZKVMWTUAKBA3FSQ45IQLN7S/action/citation_signature","submit_replication":"https://pith.science/pith/FSQZKVMWTUAKBA3FSQ45IQLN7S/action/replication_record"}},"created_at":"2026-05-18T00:42:04.162545+00:00","updated_at":"2026-05-18T00:42:04.162545+00:00"}