{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HJV6IN7CZZO2QGS5RFNVFYTTFW","short_pith_number":"pith:HJV6IN7C","schema_version":"1.0","canonical_sha256":"3a6be437e2ce5da81a5d895b52e2732d8908389d4e8028f6dab6a423b8a091f2","source":{"kind":"arxiv","id":"1104.3007","version":1},"attestation_state":"computed","paper":{"title":"Optimal Hyper-Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Andreas Maletti, Daniel Quernheim","submitted_at":"2011-04-15T10:29:14Z","abstract_excerpt":"Minimal deterministic finite automata (DFAs) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in time O(n log n), where n is the number of states of the input DFA, by [Gawrychowski and Je\\.z: Hyper-minimisation made efficient. Proc. MFCS, LNCS 5734, 2009] and [Holzer and Maletti: An n log n algorithm for hyper-minimizing a (minimized) deterministic automaton. Theor. Comput. Sci. 411, 2010]. Both algorithms return a DFA that is as small as possible, while only committing a finite number of errors. These algorith"},"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":"1104.3007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-15T10:29:14Z","cross_cats_sorted":[],"title_canon_sha256":"c936fab90c6bbe1962001755414632545ae4466105aec1f5d04049c1c80ac466","abstract_canon_sha256":"63a10c1d8de4e45b9ad62cd838c621d4e360a5e0bf8239a5e5b8ba501b51c860"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:28.228304Z","signature_b64":"kbaanhUnyp3kjNPyAjYyblav/7BHrWloLArsCKkBK16NSTQqpzugSClXlEutoFZQo8ETRPCSomQejjamOuc+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a6be437e2ce5da81a5d895b52e2732d8908389d4e8028f6dab6a423b8a091f2","last_reissued_at":"2026-05-18T02:02:28.227586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:28.227586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Hyper-Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Andreas Maletti, Daniel Quernheim","submitted_at":"2011-04-15T10:29:14Z","abstract_excerpt":"Minimal deterministic finite automata (DFAs) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in time O(n log n), where n is the number of states of the input DFA, by [Gawrychowski and Je\\.z: Hyper-minimisation made efficient. Proc. MFCS, LNCS 5734, 2009] and [Holzer and Maletti: An n log n algorithm for hyper-minimizing a (minimized) deterministic automaton. Theor. Comput. Sci. 411, 2010]. Both algorithms return a DFA that is as small as possible, while only committing a finite number of errors. These algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3007","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":"1104.3007","created_at":"2026-05-18T02:02:28.227711+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3007v1","created_at":"2026-05-18T02:02:28.227711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3007","created_at":"2026-05-18T02:02:28.227711+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJV6IN7CZZO2","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJV6IN7CZZO2QGS5","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJV6IN7C","created_at":"2026-05-18T12:26:30.835961+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/HJV6IN7CZZO2QGS5RFNVFYTTFW","json":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW.json","graph_json":"https://pith.science/api/pith-number/HJV6IN7CZZO2QGS5RFNVFYTTFW/graph.json","events_json":"https://pith.science/api/pith-number/HJV6IN7CZZO2QGS5RFNVFYTTFW/events.json","paper":"https://pith.science/paper/HJV6IN7C"},"agent_actions":{"view_html":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW","download_json":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW.json","view_paper":"https://pith.science/paper/HJV6IN7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3007&json=true","fetch_graph":"https://pith.science/api/pith-number/HJV6IN7CZZO2QGS5RFNVFYTTFW/graph.json","fetch_events":"https://pith.science/api/pith-number/HJV6IN7CZZO2QGS5RFNVFYTTFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/action/storage_attestation","attest_author":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/action/author_attestation","sign_citation":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/action/citation_signature","submit_replication":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/action/replication_record"}},"created_at":"2026-05-18T02:02:28.227711+00:00","updated_at":"2026-05-18T02:02:28.227711+00:00"}