{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:S555MQHJQUV3GB2EH76TYLIFC3","short_pith_number":"pith:S555MQHJ","schema_version":"1.0","canonical_sha256":"977bd640e9852bb307443ffd3c2d0516fa381f9d2292a6b10f580b99c56cfde7","source":{"kind":"arxiv","id":"1610.00571","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Complexity of Parity Games with Bounded Tree-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Nicolas Markey, Patricia Bouyer, Vincent Jug\\'e","submitted_at":"2016-10-03T14:40:55Z","abstract_excerpt":"Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of two-player parity games over graphs of bounded tree-width, where updates may add or delete edges, or change the owner or color of states. We show that this problem is in DynFO (with LOGSPACE precomputation); this is achieved by a reduction to a Dyck-path problem on an acyclic automaton."},"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":"1610.00571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-03T14:40:55Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"cc51681720b81285a811aae379321591b864f6932aaf07d291834f2f273c0b2a","abstract_canon_sha256":"8ced359eabc559c71903240296885883b2fd5fba6a6af045d64212870cf25800"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:25.222725Z","signature_b64":"EpKlvCRS6bhk9tsxbsrs9IqaJLDE21O5TvMOetRp0H39rG4tdVpg8YIQPJGAfxue2SGI/TSxSbOWsqPJyhQDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"977bd640e9852bb307443ffd3c2d0516fa381f9d2292a6b10f580b99c56cfde7","last_reissued_at":"2026-05-18T01:03:25.222252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:25.222252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Complexity of Parity Games with Bounded Tree-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Nicolas Markey, Patricia Bouyer, Vincent Jug\\'e","submitted_at":"2016-10-03T14:40:55Z","abstract_excerpt":"Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of two-player parity games over graphs of bounded tree-width, where updates may add or delete edges, or change the owner or color of states. We show that this problem is in DynFO (with LOGSPACE precomputation); this is achieved by a reduction to a Dyck-path problem on an acyclic automaton."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00571","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":"1610.00571","created_at":"2026-05-18T01:03:25.222330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00571v1","created_at":"2026-05-18T01:03:25.222330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00571","created_at":"2026-05-18T01:03:25.222330+00:00"},{"alias_kind":"pith_short_12","alias_value":"S555MQHJQUV3","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"S555MQHJQUV3GB2E","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"S555MQHJ","created_at":"2026-05-18T12:30:41.710351+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/S555MQHJQUV3GB2EH76TYLIFC3","json":"https://pith.science/pith/S555MQHJQUV3GB2EH76TYLIFC3.json","graph_json":"https://pith.science/api/pith-number/S555MQHJQUV3GB2EH76TYLIFC3/graph.json","events_json":"https://pith.science/api/pith-number/S555MQHJQUV3GB2EH76TYLIFC3/events.json","paper":"https://pith.science/paper/S555MQHJ"},"agent_actions":{"view_html":"https://pith.science/pith/S555MQHJQUV3GB2EH76TYLIFC3","download_json":"https://pith.science/pith/S555MQHJQUV3GB2EH76TYLIFC3.json","view_paper":"https://pith.science/paper/S555MQHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00571&json=true","fetch_graph":"https://pith.science/api/pith-number/S555MQHJQUV3GB2EH76TYLIFC3/graph.json","fetch_events":"https://pith.science/api/pith-number/S555MQHJQUV3GB2EH76TYLIFC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S555MQHJQUV3GB2EH76TYLIFC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S555MQHJQUV3GB2EH76TYLIFC3/action/storage_attestation","attest_author":"https://pith.science/pith/S555MQHJQUV3GB2EH76TYLIFC3/action/author_attestation","sign_citation":"https://pith.science/pith/S555MQHJQUV3GB2EH76TYLIFC3/action/citation_signature","submit_replication":"https://pith.science/pith/S555MQHJQUV3GB2EH76TYLIFC3/action/replication_record"}},"created_at":"2026-05-18T01:03:25.222330+00:00","updated_at":"2026-05-18T01:03:25.222330+00:00"}