{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QTKV3UUQ2363WGZTQJS4WP3XXH","short_pith_number":"pith:QTKV3UUQ","canonical_record":{"source":{"id":"2501.12302","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-01-21T17:15:38Z","cross_cats_sorted":[],"title_canon_sha256":"85ec150772a5879be863d99109a58abf85d866eca0c3cd4e2eeece007dde17f3","abstract_canon_sha256":"d8f873275f3be7ea08e0a65b3efd999199ac06f50ed3237f4c0b7d51423f536b"},"schema_version":"1.0"},"canonical_sha256":"84d55dd290d6fdbb1b338265cb3f77b9f7e46c2c1952ac93d34b5b7d014816e3","source":{"kind":"arxiv","id":"2501.12302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12302","created_at":"2026-05-28T21:06:52Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12302v1","created_at":"2026-05-28T21:06:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12302","created_at":"2026-05-28T21:06:52Z"},{"alias_kind":"pith_short_12","alias_value":"QTKV3UUQ2363","created_at":"2026-05-28T21:06:52Z"},{"alias_kind":"pith_short_16","alias_value":"QTKV3UUQ2363WGZT","created_at":"2026-05-28T21:06:52Z"},{"alias_kind":"pith_short_8","alias_value":"QTKV3UUQ","created_at":"2026-05-28T21:06:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QTKV3UUQ2363WGZTQJS4WP3XXH","target":"record","payload":{"canonical_record":{"source":{"id":"2501.12302","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-01-21T17:15:38Z","cross_cats_sorted":[],"title_canon_sha256":"85ec150772a5879be863d99109a58abf85d866eca0c3cd4e2eeece007dde17f3","abstract_canon_sha256":"d8f873275f3be7ea08e0a65b3efd999199ac06f50ed3237f4c0b7d51423f536b"},"schema_version":"1.0"},"canonical_sha256":"84d55dd290d6fdbb1b338265cb3f77b9f7e46c2c1952ac93d34b5b7d014816e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T21:06:52.639500Z","signature_b64":"BvS8Rgr7LdDqHznRfVs2ssLNKzQoHtPJIEDW+soE89njN2wg8fqqqDHtyBWPOYxYfuYHZHK0Ci6iBiLw/WRHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84d55dd290d6fdbb1b338265cb3f77b9f7e46c2c1952ac93d34b5b7d014816e3","last_reissued_at":"2026-05-28T21:06:52.638548Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T21:06:52.638548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.12302","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-28T21:06:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjoDW7ZLxvK7D5MJkeTi5P/aWFxEG66U79DmSgjU0hGsVbsVr+jtCMY+VTXeD1Lo6Eb/pRP1Os4y8Uh+ckVJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:41:49.822923Z"},"content_sha256":"134ca1c4bb839fe555f24db6b61837a6b167672d8e59dafdec654bc940bb593e","schema_version":"1.0","event_id":"sha256:134ca1c4bb839fe555f24db6b61837a6b167672d8e59dafdec654bc940bb593e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QTKV3UUQ2363WGZTQJS4WP3XXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"History-Deterministic Parity Automata: Games, Complexity, and the 2-Token Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Keya Prakash","submitted_at":"2025-01-21T17:15:38Z","abstract_excerpt":"History-deterministic automata are a restricted class of nondeterministic automata where the nondeterminism while reading an input can be resolved successfully based on the prefix read so far. History-deterministic automata are exponentially more succinct than deterministic automata, while still retaining some of the algorithmic properties of deterministic automata, especially in the context of reactive synthesis.\n  This thesis focuses on the problem of checking history-determinism for parity automata. Our main result is the 2-token theorem, due to which we obtain that checking history-determi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12302","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.12302/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-28T21:06:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLvqp+IkEEJRk9QlJWP6g150o4NWSolxD1nkb+zat/u3OxS6fCUSnPHjd+5JgngRXjVt+jbVo9eYdbG8a62iAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:41:49.823306Z"},"content_sha256":"6f3aa9d739b6dd4dcfd3d288cc105f7ca53fdac110db4d4018898f944b7e1085","schema_version":"1.0","event_id":"sha256:6f3aa9d739b6dd4dcfd3d288cc105f7ca53fdac110db4d4018898f944b7e1085"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QTKV3UUQ2363WGZTQJS4WP3XXH/bundle.json","state_url":"https://pith.science/pith/QTKV3UUQ2363WGZTQJS4WP3XXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QTKV3UUQ2363WGZTQJS4WP3XXH/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-06-05T09:41:49Z","links":{"resolver":"https://pith.science/pith/QTKV3UUQ2363WGZTQJS4WP3XXH","bundle":"https://pith.science/pith/QTKV3UUQ2363WGZTQJS4WP3XXH/bundle.json","state":"https://pith.science/pith/QTKV3UUQ2363WGZTQJS4WP3XXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QTKV3UUQ2363WGZTQJS4WP3XXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QTKV3UUQ2363WGZTQJS4WP3XXH","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":"d8f873275f3be7ea08e0a65b3efd999199ac06f50ed3237f4c0b7d51423f536b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-01-21T17:15:38Z","title_canon_sha256":"85ec150772a5879be863d99109a58abf85d866eca0c3cd4e2eeece007dde17f3"},"schema_version":"1.0","source":{"id":"2501.12302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12302","created_at":"2026-05-28T21:06:52Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12302v1","created_at":"2026-05-28T21:06:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12302","created_at":"2026-05-28T21:06:52Z"},{"alias_kind":"pith_short_12","alias_value":"QTKV3UUQ2363","created_at":"2026-05-28T21:06:52Z"},{"alias_kind":"pith_short_16","alias_value":"QTKV3UUQ2363WGZT","created_at":"2026-05-28T21:06:52Z"},{"alias_kind":"pith_short_8","alias_value":"QTKV3UUQ","created_at":"2026-05-28T21:06:52Z"}],"graph_snapshots":[{"event_id":"sha256:6f3aa9d739b6dd4dcfd3d288cc105f7ca53fdac110db4d4018898f944b7e1085","target":"graph","created_at":"2026-05-28T21:06:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.12302/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"History-deterministic automata are a restricted class of nondeterministic automata where the nondeterminism while reading an input can be resolved successfully based on the prefix read so far. History-deterministic automata are exponentially more succinct than deterministic automata, while still retaining some of the algorithmic properties of deterministic automata, especially in the context of reactive synthesis.\n  This thesis focuses on the problem of checking history-determinism for parity automata. Our main result is the 2-token theorem, due to which we obtain that checking history-determi","authors_text":"Keya Prakash","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-01-21T17:15:38Z","title":"History-Deterministic Parity Automata: Games, Complexity, and the 2-Token Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12302","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:134ca1c4bb839fe555f24db6b61837a6b167672d8e59dafdec654bc940bb593e","target":"record","created_at":"2026-05-28T21:06:52Z","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":"d8f873275f3be7ea08e0a65b3efd999199ac06f50ed3237f4c0b7d51423f536b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-01-21T17:15:38Z","title_canon_sha256":"85ec150772a5879be863d99109a58abf85d866eca0c3cd4e2eeece007dde17f3"},"schema_version":"1.0","source":{"id":"2501.12302","kind":"arxiv","version":1}},"canonical_sha256":"84d55dd290d6fdbb1b338265cb3f77b9f7e46c2c1952ac93d34b5b7d014816e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84d55dd290d6fdbb1b338265cb3f77b9f7e46c2c1952ac93d34b5b7d014816e3","first_computed_at":"2026-05-28T21:06:52.638548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T21:06:52.638548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BvS8Rgr7LdDqHznRfVs2ssLNKzQoHtPJIEDW+soE89njN2wg8fqqqDHtyBWPOYxYfuYHZHK0Ci6iBiLw/WRHBw==","signature_status":"signed_v1","signed_at":"2026-05-28T21:06:52.639500Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.12302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:134ca1c4bb839fe555f24db6b61837a6b167672d8e59dafdec654bc940bb593e","sha256:6f3aa9d739b6dd4dcfd3d288cc105f7ca53fdac110db4d4018898f944b7e1085"],"state_sha256":"2c477fa3b958e27e0d33884c65f4c2e86fcdfb9a381b6c23928a3187747926b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFpYiv4arxZrMjJYqsZCM1tnBKaoYVXhCEvi4SCyuhH8RKeJShEpCBCz7NURJ8arPc+7kxKK/RzOGBspKVH/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:41:49.825452Z","bundle_sha256":"713cecf5b0e47e114ec5a657b78c5617f0e39fd77e015a40b01619ed9fb8f1db"}}