{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4COPTKFPRF7GZXHQOP5AKBJMMQ","short_pith_number":"pith:4COPTKFP","canonical_record":{"source":{"id":"1703.00683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-02T09:42:47Z","cross_cats_sorted":[],"title_canon_sha256":"71bdf96a40170d63a3d14dc2f73ca55591851280fb1c815dc9be584952379e64","abstract_canon_sha256":"49008bf763a6e63cb757eda8873475ceab05eab0ab34f53a25da0d4c9daaf96e"},"schema_version":"1.0"},"canonical_sha256":"e09cf9a8af897e6cdcf073fa05052c64238ab6dbfc0859ad264f8e323bdcfc3f","source":{"kind":"arxiv","id":"1703.00683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00683","created_at":"2026-05-18T00:49:41Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00683v1","created_at":"2026-05-18T00:49:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00683","created_at":"2026-05-18T00:49:41Z"},{"alias_kind":"pith_short_12","alias_value":"4COPTKFPRF7G","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4COPTKFPRF7GZXHQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4COPTKFP","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4COPTKFPRF7GZXHQOP5AKBJMMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-02T09:42:47Z","cross_cats_sorted":[],"title_canon_sha256":"71bdf96a40170d63a3d14dc2f73ca55591851280fb1c815dc9be584952379e64","abstract_canon_sha256":"49008bf763a6e63cb757eda8873475ceab05eab0ab34f53a25da0d4c9daaf96e"},"schema_version":"1.0"},"canonical_sha256":"e09cf9a8af897e6cdcf073fa05052c64238ab6dbfc0859ad264f8e323bdcfc3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:41.074935Z","signature_b64":"ye/4C8VTv7/lig6R/cnqGEp+ke2RGDebO1zPHYh7tjoFYUuuumFPhz5WrIVweBROlAieK7GorZSVrkSmITGKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e09cf9a8af897e6cdcf073fa05052c64238ab6dbfc0859ad264f8e323bdcfc3f","last_reissued_at":"2026-05-18T00:49:41.074249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:41.074249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00683","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TpgGHjzUe19nFHEwLt/zEja1gdEICfFE/1terx2qTXGiTNjKlDe5osfAZ2pq7N9RgFiGozzODfSAuUzXznWhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:07:10.483581Z"},"content_sha256":"96caf714e47ad01dfd0ba80bef5c333fe2e5431c7b655308d5859eb87511feb9","schema_version":"1.0","event_id":"sha256:96caf714e47ad01dfd0ba80bef5c333fe2e5431c7b655308d5859eb87511feb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4COPTKFPRF7GZXHQOP5AKBJMMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parity Games, Imperfect Information and Structural Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bernd Puchala, Roman Rabinovich","submitted_at":"2017-03-02T09:42:47Z","abstract_excerpt":"We address the problem of solving parity games with imperfect information on finite graphs of bounded structural complexity. It is a major open problem whether parity games with perfect information can be solved in PTIME. Restricting the structural complexity of the game arenas, however, often leads to efficient algorithms for parity games. Such results are known for graph classes of bounded tree-width, DAG-width, directed path-width, and entanglement, which we describe in terms of cops and robber games. Conversely, the introduction of imperfect information makes the problem more difficult, it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00683","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O94H3W/X35Jh9lrooKuXolFF8A5XUBC1uzlr/5udM8ZwNh9R/HtST8ibrmEHrlLq5sht0TBsBIG5hpryPA10CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:07:10.484269Z"},"content_sha256":"51a68102d9ae5583f61b836257af34d4ac7a98f01f20e2efccc8b98ede3e729d","schema_version":"1.0","event_id":"sha256:51a68102d9ae5583f61b836257af34d4ac7a98f01f20e2efccc8b98ede3e729d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4COPTKFPRF7GZXHQOP5AKBJMMQ/bundle.json","state_url":"https://pith.science/pith/4COPTKFPRF7GZXHQOP5AKBJMMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4COPTKFPRF7GZXHQOP5AKBJMMQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T01:07:10Z","links":{"resolver":"https://pith.science/pith/4COPTKFPRF7GZXHQOP5AKBJMMQ","bundle":"https://pith.science/pith/4COPTKFPRF7GZXHQOP5AKBJMMQ/bundle.json","state":"https://pith.science/pith/4COPTKFPRF7GZXHQOP5AKBJMMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4COPTKFPRF7GZXHQOP5AKBJMMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4COPTKFPRF7GZXHQOP5AKBJMMQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"49008bf763a6e63cb757eda8873475ceab05eab0ab34f53a25da0d4c9daaf96e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-02T09:42:47Z","title_canon_sha256":"71bdf96a40170d63a3d14dc2f73ca55591851280fb1c815dc9be584952379e64"},"schema_version":"1.0","source":{"id":"1703.00683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00683","created_at":"2026-05-18T00:49:41Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00683v1","created_at":"2026-05-18T00:49:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00683","created_at":"2026-05-18T00:49:41Z"},{"alias_kind":"pith_short_12","alias_value":"4COPTKFPRF7G","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4COPTKFPRF7GZXHQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4COPTKFP","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:51a68102d9ae5583f61b836257af34d4ac7a98f01f20e2efccc8b98ede3e729d","target":"graph","created_at":"2026-05-18T00:49:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We address the problem of solving parity games with imperfect information on finite graphs of bounded structural complexity. It is a major open problem whether parity games with perfect information can be solved in PTIME. Restricting the structural complexity of the game arenas, however, often leads to efficient algorithms for parity games. Such results are known for graph classes of bounded tree-width, DAG-width, directed path-width, and entanglement, which we describe in terms of cops and robber games. Conversely, the introduction of imperfect information makes the problem more difficult, it","authors_text":"Bernd Puchala, Roman Rabinovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-02T09:42:47Z","title":"Parity Games, Imperfect Information and Structural Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00683","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:96caf714e47ad01dfd0ba80bef5c333fe2e5431c7b655308d5859eb87511feb9","target":"record","created_at":"2026-05-18T00:49:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"49008bf763a6e63cb757eda8873475ceab05eab0ab34f53a25da0d4c9daaf96e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-02T09:42:47Z","title_canon_sha256":"71bdf96a40170d63a3d14dc2f73ca55591851280fb1c815dc9be584952379e64"},"schema_version":"1.0","source":{"id":"1703.00683","kind":"arxiv","version":1}},"canonical_sha256":"e09cf9a8af897e6cdcf073fa05052c64238ab6dbfc0859ad264f8e323bdcfc3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e09cf9a8af897e6cdcf073fa05052c64238ab6dbfc0859ad264f8e323bdcfc3f","first_computed_at":"2026-05-18T00:49:41.074249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:41.074249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ye/4C8VTv7/lig6R/cnqGEp+ke2RGDebO1zPHYh7tjoFYUuuumFPhz5WrIVweBROlAieK7GorZSVrkSmITGKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:41.074935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96caf714e47ad01dfd0ba80bef5c333fe2e5431c7b655308d5859eb87511feb9","sha256:51a68102d9ae5583f61b836257af34d4ac7a98f01f20e2efccc8b98ede3e729d"],"state_sha256":"fa9ec7db6933541a1fe6c505a41a35c94a4328ac587af62e360f03286a8f023e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2tNoje9jdtmx3WduL9KCV2jIBx9AN9Leklt64snMeygXNKFcyOOFs3aNpXHeC6+xZkxpiNKRK80OpePk43W7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T01:07:10.487743Z","bundle_sha256":"90f3d7658c3321756824a2a222c94fbd43fe680b2b9e6b6b67924bbefb92903c"}}