{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OWPSQGUFHTXEDXDFPQGVNOCPQR","short_pith_number":"pith:OWPSQGUF","schema_version":"1.0","canonical_sha256":"759f281a853cee41dc657c0d56b84f8469d0bd5c49bb0e18dd46dbec43a05b8e","source":{"kind":"arxiv","id":"1509.07207","version":1},"attestation_state":"computed","paper":{"title":"Improvement in Small Progress Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Maciej Gazda, Tim A.C. Willemse","submitted_at":"2015-09-24T01:53:52Z","abstract_excerpt":"Small Progress Measures is one of the classical parity game solving algorithms. For games with n vertices, m edges and d different priorities, the original algorithm computes the winning regions and a winning strategy for one of the players in O(dm.(n/floor(d/2))^floor(d/2)) time. Computing a winning strategy for the other player requires a re-run of the algorithm on that player's winning region, thus increasing the runtime complexity to O(dm.(n/ceil(d/2))^ceil(d/2)) for computing the winning regions and winning strategies for both players. We modify the algorithm so that it derives the winnin"},"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":"1509.07207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-09-24T01:53:52Z","cross_cats_sorted":[],"title_canon_sha256":"99231078961e4ccae774f8398b55ebb7e9acbcdc8bf577dc36af25d3a0dafa8c","abstract_canon_sha256":"eb19b02ba50fd72b0d69f148c6d799bfcbc25752fa942df422a3f180d9b3538e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:09.582808Z","signature_b64":"dZh+10Ox6whPsyyN7uacspX35S3ORH7oB84S+GGw4E7v8wvZgBVWfcOPAu24bq63/d1PODCdehlJE2Ehw2bpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"759f281a853cee41dc657c0d56b84f8469d0bd5c49bb0e18dd46dbec43a05b8e","last_reissued_at":"2026-05-18T01:32:09.582082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:09.582082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improvement in Small Progress Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Maciej Gazda, Tim A.C. Willemse","submitted_at":"2015-09-24T01:53:52Z","abstract_excerpt":"Small Progress Measures is one of the classical parity game solving algorithms. For games with n vertices, m edges and d different priorities, the original algorithm computes the winning regions and a winning strategy for one of the players in O(dm.(n/floor(d/2))^floor(d/2)) time. Computing a winning strategy for the other player requires a re-run of the algorithm on that player's winning region, thus increasing the runtime complexity to O(dm.(n/ceil(d/2))^ceil(d/2)) for computing the winning regions and winning strategies for both players. We modify the algorithm so that it derives the winnin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07207","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":"1509.07207","created_at":"2026-05-18T01:32:09.582198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07207v1","created_at":"2026-05-18T01:32:09.582198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07207","created_at":"2026-05-18T01:32:09.582198+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWPSQGUFHTXE","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWPSQGUFHTXEDXDF","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWPSQGUF","created_at":"2026-05-18T12:29:34.919912+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/OWPSQGUFHTXEDXDFPQGVNOCPQR","json":"https://pith.science/pith/OWPSQGUFHTXEDXDFPQGVNOCPQR.json","graph_json":"https://pith.science/api/pith-number/OWPSQGUFHTXEDXDFPQGVNOCPQR/graph.json","events_json":"https://pith.science/api/pith-number/OWPSQGUFHTXEDXDFPQGVNOCPQR/events.json","paper":"https://pith.science/paper/OWPSQGUF"},"agent_actions":{"view_html":"https://pith.science/pith/OWPSQGUFHTXEDXDFPQGVNOCPQR","download_json":"https://pith.science/pith/OWPSQGUFHTXEDXDFPQGVNOCPQR.json","view_paper":"https://pith.science/paper/OWPSQGUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07207&json=true","fetch_graph":"https://pith.science/api/pith-number/OWPSQGUFHTXEDXDFPQGVNOCPQR/graph.json","fetch_events":"https://pith.science/api/pith-number/OWPSQGUFHTXEDXDFPQGVNOCPQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWPSQGUFHTXEDXDFPQGVNOCPQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWPSQGUFHTXEDXDFPQGVNOCPQR/action/storage_attestation","attest_author":"https://pith.science/pith/OWPSQGUFHTXEDXDFPQGVNOCPQR/action/author_attestation","sign_citation":"https://pith.science/pith/OWPSQGUFHTXEDXDFPQGVNOCPQR/action/citation_signature","submit_replication":"https://pith.science/pith/OWPSQGUFHTXEDXDFPQGVNOCPQR/action/replication_record"}},"created_at":"2026-05-18T01:32:09.582198+00:00","updated_at":"2026-05-18T01:32:09.582198+00:00"}