{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4SZ3KZSRVSXGGS2ZX2A656BI2H","short_pith_number":"pith:4SZ3KZSR","canonical_record":{"source":{"id":"1609.03460","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-12T16:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"10399fd81b2e5b2f518ba176eb5642fbce13f97f4101bc81de22e766d1884a69","abstract_canon_sha256":"be87b1d821cde6466f45e75aaf5fa61104375dd3cd1e01c09ad78b4b52eed8d9"},"schema_version":"1.0"},"canonical_sha256":"e4b3b56651acae634b59be81eef828d1fb70c698f41d03ab49a9ffb9aa4ee561","source":{"kind":"arxiv","id":"1609.03460","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03460","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03460v2","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03460","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"pith_short_12","alias_value":"4SZ3KZSRVSXG","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4SZ3KZSRVSXGGS2Z","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4SZ3KZSR","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4SZ3KZSRVSXGGS2ZX2A656BI2H","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03460","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-12T16:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"10399fd81b2e5b2f518ba176eb5642fbce13f97f4101bc81de22e766d1884a69","abstract_canon_sha256":"be87b1d821cde6466f45e75aaf5fa61104375dd3cd1e01c09ad78b4b52eed8d9"},"schema_version":"1.0"},"canonical_sha256":"e4b3b56651acae634b59be81eef828d1fb70c698f41d03ab49a9ffb9aa4ee561","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:48.817427Z","signature_b64":"qJL0gCD7pT9dX3xoFXWxWUHt2mcZFiCxbLV5d9uipoLGYH2AORaefMo8sCUvtfKsWKwCKvkWDjxgKcNPOxmJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4b3b56651acae634b59be81eef828d1fb70c698f41d03ab49a9ffb9aa4ee561","last_reissued_at":"2026-05-18T00:30:48.816885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:48.816885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03460","source_version":2,"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:30:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n63ZbGYq/t4XkWT8w+pdeCImRO/jo99DLXsVnljSGRzD+qznTsBjfsD6azj6+JM+TSl/yNXnrsnfwPxTysGFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:38:59.383194Z"},"content_sha256":"f7a45cbcc32a7071064dd6f600cb93e346f3339536080c95445f97b34a8f4919","schema_version":"1.0","event_id":"sha256:f7a45cbcc32a7071064dd6f600cb93e346f3339536080c95445f97b34a8f4919"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4SZ3KZSRVSXGGS2ZX2A656BI2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Universality and Related Problems for Partially Ordered NFAs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Markus Kr\\\"otzsch, Micha\\\"el Thomazo, Tom\\'a\\v{s} Masopust","submitted_at":"2016-09-12T16:10:28Z","abstract_excerpt":"Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, that is, for which cycles occur only in the form of self-loops on a single state. A poNFA is universal if it accepts all words over its input alphabet. Deciding universality is PSPACE-complete for poNFAs, and we show that this remains true even when restricting to a fixed alphabet. This is nontrivial since standard encodings of alphabet symbols in, e.g., binary can turn self-loops into longer cycles. A lower coNP-complete complexity bound can be obtained if we requi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03460","kind":"arxiv","version":2},"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:30:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PDFmqU4gYh8iJO24XBNn1Z+JA4YvG0PtnFyjTS8Ocuj1d5lkMQLf/42cn8n24sBxGjJrRUtgB+yDP23CjF1sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:38:59.383896Z"},"content_sha256":"b2679793b27adfa8ca10a54539984369a4cd7f0a1b4e3c5e29379f8549104a67","schema_version":"1.0","event_id":"sha256:b2679793b27adfa8ca10a54539984369a4cd7f0a1b4e3c5e29379f8549104a67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SZ3KZSRVSXGGS2ZX2A656BI2H/bundle.json","state_url":"https://pith.science/pith/4SZ3KZSRVSXGGS2ZX2A656BI2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SZ3KZSRVSXGGS2ZX2A656BI2H/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-26T12:38:59Z","links":{"resolver":"https://pith.science/pith/4SZ3KZSRVSXGGS2ZX2A656BI2H","bundle":"https://pith.science/pith/4SZ3KZSRVSXGGS2ZX2A656BI2H/bundle.json","state":"https://pith.science/pith/4SZ3KZSRVSXGGS2ZX2A656BI2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SZ3KZSRVSXGGS2ZX2A656BI2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4SZ3KZSRVSXGGS2ZX2A656BI2H","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":"be87b1d821cde6466f45e75aaf5fa61104375dd3cd1e01c09ad78b4b52eed8d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-12T16:10:28Z","title_canon_sha256":"10399fd81b2e5b2f518ba176eb5642fbce13f97f4101bc81de22e766d1884a69"},"schema_version":"1.0","source":{"id":"1609.03460","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03460","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03460v2","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03460","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"pith_short_12","alias_value":"4SZ3KZSRVSXG","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4SZ3KZSRVSXGGS2Z","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4SZ3KZSR","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:b2679793b27adfa8ca10a54539984369a4cd7f0a1b4e3c5e29379f8549104a67","target":"graph","created_at":"2026-05-18T00:30:48Z","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":"Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, that is, for which cycles occur only in the form of self-loops on a single state. A poNFA is universal if it accepts all words over its input alphabet. Deciding universality is PSPACE-complete for poNFAs, and we show that this remains true even when restricting to a fixed alphabet. This is nontrivial since standard encodings of alphabet symbols in, e.g., binary can turn self-loops into longer cycles. A lower coNP-complete complexity bound can be obtained if we requi","authors_text":"Markus Kr\\\"otzsch, Micha\\\"el Thomazo, Tom\\'a\\v{s} Masopust","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-12T16:10:28Z","title":"Complexity of Universality and Related Problems for Partially Ordered NFAs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03460","kind":"arxiv","version":2},"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:f7a45cbcc32a7071064dd6f600cb93e346f3339536080c95445f97b34a8f4919","target":"record","created_at":"2026-05-18T00:30:48Z","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":"be87b1d821cde6466f45e75aaf5fa61104375dd3cd1e01c09ad78b4b52eed8d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-12T16:10:28Z","title_canon_sha256":"10399fd81b2e5b2f518ba176eb5642fbce13f97f4101bc81de22e766d1884a69"},"schema_version":"1.0","source":{"id":"1609.03460","kind":"arxiv","version":2}},"canonical_sha256":"e4b3b56651acae634b59be81eef828d1fb70c698f41d03ab49a9ffb9aa4ee561","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4b3b56651acae634b59be81eef828d1fb70c698f41d03ab49a9ffb9aa4ee561","first_computed_at":"2026-05-18T00:30:48.816885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:48.816885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qJL0gCD7pT9dX3xoFXWxWUHt2mcZFiCxbLV5d9uipoLGYH2AORaefMo8sCUvtfKsWKwCKvkWDjxgKcNPOxmJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:48.817427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03460","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7a45cbcc32a7071064dd6f600cb93e346f3339536080c95445f97b34a8f4919","sha256:b2679793b27adfa8ca10a54539984369a4cd7f0a1b4e3c5e29379f8549104a67"],"state_sha256":"5ac0a8a8de8487f994e94bdd627b342203fb8e54261793fb74f6b6ee5b83fe5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ou2zcqbuclJX9nVx0iRVQA1NvC2NWZjvAWt1K3GNK5qfLjKv5S6JtF4ByzngIopLIpT/wt76fULtYDLktaZkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:38:59.387350Z","bundle_sha256":"b4936f9b9acc9e4bf4648c19fa4044fa4b2cdb121439372bfb55aacdc3935bc6"}}