{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3MNIS3K2XU4QGVZD6JZNGSZ2JV","short_pith_number":"pith:3MNIS3K2","schema_version":"1.0","canonical_sha256":"db1a896d5abd39035723f272d34b3a4d5b6192954e7df88b3a23b0dae77945a9","source":{"kind":"arxiv","id":"1406.1090","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for Complementing Parity Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Sven Schewe, Thomas Varghese","submitted_at":"2014-06-04T16:10:57Z","abstract_excerpt":"We follow a connection between tight determinisation and complementation and establish a complementation procedure from parity automata to nondeterministic B\\\"uchi automata and prove it to be tight up to an $O(n)$ factor, where $n$ is the size of the nondeterministic parity automaton. This factor does not depend on the number of priorities."},"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":"1406.1090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-04T16:10:57Z","cross_cats_sorted":[],"title_canon_sha256":"d4cfb07da183bb2ff72008f49340a4af6884ddc830ed9dfc7781b0bb60009599","abstract_canon_sha256":"7ff3ee5dcc4081bc9eb07d8073b15b376df96f280bbd7d9912f6f4ea7a6900e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:02.122703Z","signature_b64":"WocGLnPJn0Nh+AK05DO64kqoWytrv01xbnY4tUk0vk0MRO2FlV3tVuMqvnzKEF5L0kys4oe4d5qW6FeWjlGJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db1a896d5abd39035723f272d34b3a4d5b6192954e7df88b3a23b0dae77945a9","last_reissued_at":"2026-05-18T02:43:02.122034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:02.122034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Complementing Parity Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Sven Schewe, Thomas Varghese","submitted_at":"2014-06-04T16:10:57Z","abstract_excerpt":"We follow a connection between tight determinisation and complementation and establish a complementation procedure from parity automata to nondeterministic B\\\"uchi automata and prove it to be tight up to an $O(n)$ factor, where $n$ is the size of the nondeterministic parity automaton. This factor does not depend on the number of priorities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1090","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":"1406.1090","created_at":"2026-05-18T02:43:02.122130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1090v1","created_at":"2026-05-18T02:43:02.122130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1090","created_at":"2026-05-18T02:43:02.122130+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MNIS3K2XU4Q","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MNIS3K2XU4QGVZD","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MNIS3K2","created_at":"2026-05-18T12:28:11.866339+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/3MNIS3K2XU4QGVZD6JZNGSZ2JV","json":"https://pith.science/pith/3MNIS3K2XU4QGVZD6JZNGSZ2JV.json","graph_json":"https://pith.science/api/pith-number/3MNIS3K2XU4QGVZD6JZNGSZ2JV/graph.json","events_json":"https://pith.science/api/pith-number/3MNIS3K2XU4QGVZD6JZNGSZ2JV/events.json","paper":"https://pith.science/paper/3MNIS3K2"},"agent_actions":{"view_html":"https://pith.science/pith/3MNIS3K2XU4QGVZD6JZNGSZ2JV","download_json":"https://pith.science/pith/3MNIS3K2XU4QGVZD6JZNGSZ2JV.json","view_paper":"https://pith.science/paper/3MNIS3K2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1090&json=true","fetch_graph":"https://pith.science/api/pith-number/3MNIS3K2XU4QGVZD6JZNGSZ2JV/graph.json","fetch_events":"https://pith.science/api/pith-number/3MNIS3K2XU4QGVZD6JZNGSZ2JV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MNIS3K2XU4QGVZD6JZNGSZ2JV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MNIS3K2XU4QGVZD6JZNGSZ2JV/action/storage_attestation","attest_author":"https://pith.science/pith/3MNIS3K2XU4QGVZD6JZNGSZ2JV/action/author_attestation","sign_citation":"https://pith.science/pith/3MNIS3K2XU4QGVZD6JZNGSZ2JV/action/citation_signature","submit_replication":"https://pith.science/pith/3MNIS3K2XU4QGVZD6JZNGSZ2JV/action/replication_record"}},"created_at":"2026-05-18T02:43:02.122130+00:00","updated_at":"2026-05-18T02:43:02.122130+00:00"}