{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HJV6IN7CZZO2QGS5RFNVFYTTFW","short_pith_number":"pith:HJV6IN7C","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"},"canonical_sha256":"3a6be437e2ce5da81a5d895b52e2732d8908389d4e8028f6dab6a423b8a091f2","source":{"kind":"arxiv","id":"1104.3007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3007","created_at":"2026-05-18T02:02:28Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3007v1","created_at":"2026-05-18T02:02:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3007","created_at":"2026-05-18T02:02:28Z"},{"alias_kind":"pith_short_12","alias_value":"HJV6IN7CZZO2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HJV6IN7CZZO2QGS5","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HJV6IN7C","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HJV6IN7CZZO2QGS5RFNVFYTTFW","target":"record","payload":{"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"},"canonical_sha256":"3a6be437e2ce5da81a5d895b52e2732d8908389d4e8028f6dab6a423b8a091f2","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"},"source_kind":"arxiv","source_id":"1104.3007","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-18T02:02:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GbXsYLuc4vMe3Gp4RnjYuOthVK9JMu+sei2l9Ebj1F4W+Jwu/uRfBsjEF0I4b1xmUBuYQeZ5trsnTaqrYV+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:31:15.966785Z"},"content_sha256":"909808dec7d9c5bfe84a3cb78721ff7bdf8c41f3505cced030202974f3f1a744","schema_version":"1.0","event_id":"sha256:909808dec7d9c5bfe84a3cb78721ff7bdf8c41f3505cced030202974f3f1a744"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HJV6IN7CZZO2QGS5RFNVFYTTFW","target":"graph","payload":{"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"},"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-18T02:02:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9/BpgyxK/z6DrHp5vRgd+G/07AbkhyXoHQkrMPoyOxWs2jB3p/6MBzNQFWVxbwLtHyk6Xcm69jQBXr+EjuqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:31:15.967506Z"},"content_sha256":"b1a0c2f9b1f4f3adfccf870e61c5d10b00a6c9976c7bff84dca0aeb962c1fb20","schema_version":"1.0","event_id":"sha256:b1a0c2f9b1f4f3adfccf870e61c5d10b00a6c9976c7bff84dca0aeb962c1fb20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/bundle.json","state_url":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/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-11T19:31:15Z","links":{"resolver":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW","bundle":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/bundle.json","state":"https://pith.science/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJV6IN7CZZO2QGS5RFNVFYTTFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HJV6IN7CZZO2QGS5RFNVFYTTFW","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":"63a10c1d8de4e45b9ad62cd838c621d4e360a5e0bf8239a5e5b8ba501b51c860","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-15T10:29:14Z","title_canon_sha256":"c936fab90c6bbe1962001755414632545ae4466105aec1f5d04049c1c80ac466"},"schema_version":"1.0","source":{"id":"1104.3007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3007","created_at":"2026-05-18T02:02:28Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3007v1","created_at":"2026-05-18T02:02:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3007","created_at":"2026-05-18T02:02:28Z"},{"alias_kind":"pith_short_12","alias_value":"HJV6IN7CZZO2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HJV6IN7CZZO2QGS5","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HJV6IN7C","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:b1a0c2f9b1f4f3adfccf870e61c5d10b00a6c9976c7bff84dca0aeb962c1fb20","target":"graph","created_at":"2026-05-18T02:02:28Z","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":"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","authors_text":"Andreas Maletti, Daniel Quernheim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-15T10:29:14Z","title":"Optimal Hyper-Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3007","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:909808dec7d9c5bfe84a3cb78721ff7bdf8c41f3505cced030202974f3f1a744","target":"record","created_at":"2026-05-18T02:02:28Z","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":"63a10c1d8de4e45b9ad62cd838c621d4e360a5e0bf8239a5e5b8ba501b51c860","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-15T10:29:14Z","title_canon_sha256":"c936fab90c6bbe1962001755414632545ae4466105aec1f5d04049c1c80ac466"},"schema_version":"1.0","source":{"id":"1104.3007","kind":"arxiv","version":1}},"canonical_sha256":"3a6be437e2ce5da81a5d895b52e2732d8908389d4e8028f6dab6a423b8a091f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a6be437e2ce5da81a5d895b52e2732d8908389d4e8028f6dab6a423b8a091f2","first_computed_at":"2026-05-18T02:02:28.227586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:28.227586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kbaanhUnyp3kjNPyAjYyblav/7BHrWloLArsCKkBK16NSTQqpzugSClXlEutoFZQo8ETRPCSomQejjamOuc+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:28.228304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:909808dec7d9c5bfe84a3cb78721ff7bdf8c41f3505cced030202974f3f1a744","sha256:b1a0c2f9b1f4f3adfccf870e61c5d10b00a6c9976c7bff84dca0aeb962c1fb20"],"state_sha256":"593f80ffb97406f7ef61264b060ad6cc7e26a45f768d378505a25f7d5b73d458"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6UjV6iV8b0lbQ65I7uonRHFRspcneNzbNeEF7WfLJo0fofjA8T4oNKfLXX1oQR3RqnQfU7Pn86rtQXgTNEJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:31:15.971693Z","bundle_sha256":"7c4293f2f9f473136262b8f82e581574b807ab1511277502cd839818c3a06a24"}}