{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:EICPPTS62E6Q376UIH7XE5FXB5","short_pith_number":"pith:EICPPTS6","canonical_record":{"source":{"id":"2111.02480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T19:15:54Z","cross_cats_sorted":[],"title_canon_sha256":"7f0a3e713f177db0d71dde13f42ee3fbdc867a30839e7e8e267f055d1bcf264b","abstract_canon_sha256":"c80805ba2bef7ec41599834a300e39b96335ccaf8e4867947f8557477ffc6936"},"schema_version":"1.0"},"canonical_sha256":"2204f7ce5ed13d0dffd441ff7274b70f64c66dd76cbead92e66c20a67abf1c1b","source":{"kind":"arxiv","id":"2111.02480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.02480","created_at":"2026-07-05T03:28:52Z"},{"alias_kind":"arxiv_version","alias_value":"2111.02480v1","created_at":"2026-07-05T03:28:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.02480","created_at":"2026-07-05T03:28:52Z"},{"alias_kind":"pith_short_12","alias_value":"EICPPTS62E6Q","created_at":"2026-07-05T03:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"EICPPTS62E6Q376U","created_at":"2026-07-05T03:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"EICPPTS6","created_at":"2026-07-05T03:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:EICPPTS62E6Q376UIH7XE5FXB5","target":"record","payload":{"canonical_record":{"source":{"id":"2111.02480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T19:15:54Z","cross_cats_sorted":[],"title_canon_sha256":"7f0a3e713f177db0d71dde13f42ee3fbdc867a30839e7e8e267f055d1bcf264b","abstract_canon_sha256":"c80805ba2bef7ec41599834a300e39b96335ccaf8e4867947f8557477ffc6936"},"schema_version":"1.0"},"canonical_sha256":"2204f7ce5ed13d0dffd441ff7274b70f64c66dd76cbead92e66c20a67abf1c1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:52.031178Z","signature_b64":"7hmgIMzPAPTQkF/fxhPXMoAB9rgoG7dLB069yRIxtIEPaAThDO89pCuDmVbNuOgc7DDxcXW1yVkMT14nopSdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2204f7ce5ed13d0dffd441ff7274b70f64c66dd76cbead92e66c20a67abf1c1b","last_reissued_at":"2026-07-05T03:28:52.030680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:52.030680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.02480","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-07-05T03:28:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QT4rSbUjZOR82KrTaLt4j0QC+J83/NP3RA2RE+HWVJ71XjTZrbZHP8z+qC7uHmzuC3oBajNivai3CqDLEdTOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:30:43.673153Z"},"content_sha256":"2b94e7fa62690fc6f5f2491aef88c6987e9835d7c336574d835c414f60ca770b","schema_version":"1.0","event_id":"sha256:2b94e7fa62690fc6f5f2491aef88c6987e9835d7c336574d835c414f60ca770b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:EICPPTS62E6Q376UIH7XE5FXB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-time Minimization of Wheeler DFAs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jarno Alanko, Nicola Cotumaccio, Nicola Prezza","submitted_at":"2021-11-03T19:15:54Z","abstract_excerpt":"Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is playing an important role in the emerging field of compressed data structures: as opposed to general automata, WDFAs can be stored in just $\\log\\sigma + O(1)$ bits per edge, $\\sigma$ being the alphabet's size, and support optimal-time pattern matching queries on the substring closure of the language they recognize. An important step to achieve further compression is minimization. When the input $\\mathcal A$ is a general deterministic finite-state automaton (DFA), the state-of-the-art is represented by the classic Hopcroft's"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.02480","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/2111.02480/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-07-05T03:28:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtTcchqAccOZELzAoE8Iflk9h/lDNvoWCs66cR0oBR1Zt940u9vQhkLlsPB8ffHv5RXluYZCzIjkzAmvTSLuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:30:43.673550Z"},"content_sha256":"c0a5a9f34040984b2a6f16dd29d6d9f144c3399063f432afa8087a83ca234354","schema_version":"1.0","event_id":"sha256:c0a5a9f34040984b2a6f16dd29d6d9f144c3399063f432afa8087a83ca234354"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5/bundle.json","state_url":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EICPPTS62E6Q376UIH7XE5FXB5/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-07-07T06:30:43Z","links":{"resolver":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5","bundle":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5/bundle.json","state":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EICPPTS62E6Q376UIH7XE5FXB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:EICPPTS62E6Q376UIH7XE5FXB5","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":"c80805ba2bef7ec41599834a300e39b96335ccaf8e4867947f8557477ffc6936","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T19:15:54Z","title_canon_sha256":"7f0a3e713f177db0d71dde13f42ee3fbdc867a30839e7e8e267f055d1bcf264b"},"schema_version":"1.0","source":{"id":"2111.02480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.02480","created_at":"2026-07-05T03:28:52Z"},{"alias_kind":"arxiv_version","alias_value":"2111.02480v1","created_at":"2026-07-05T03:28:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.02480","created_at":"2026-07-05T03:28:52Z"},{"alias_kind":"pith_short_12","alias_value":"EICPPTS62E6Q","created_at":"2026-07-05T03:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"EICPPTS62E6Q376U","created_at":"2026-07-05T03:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"EICPPTS6","created_at":"2026-07-05T03:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:c0a5a9f34040984b2a6f16dd29d6d9f144c3399063f432afa8087a83ca234354","target":"graph","created_at":"2026-07-05T03:28: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/2111.02480/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is playing an important role in the emerging field of compressed data structures: as opposed to general automata, WDFAs can be stored in just $\\log\\sigma + O(1)$ bits per edge, $\\sigma$ being the alphabet's size, and support optimal-time pattern matching queries on the substring closure of the language they recognize. An important step to achieve further compression is minimization. When the input $\\mathcal A$ is a general deterministic finite-state automaton (DFA), the state-of-the-art is represented by the classic Hopcroft's","authors_text":"Jarno Alanko, Nicola Cotumaccio, Nicola Prezza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T19:15:54Z","title":"Linear-time Minimization of Wheeler DFAs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.02480","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:2b94e7fa62690fc6f5f2491aef88c6987e9835d7c336574d835c414f60ca770b","target":"record","created_at":"2026-07-05T03:28: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":"c80805ba2bef7ec41599834a300e39b96335ccaf8e4867947f8557477ffc6936","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T19:15:54Z","title_canon_sha256":"7f0a3e713f177db0d71dde13f42ee3fbdc867a30839e7e8e267f055d1bcf264b"},"schema_version":"1.0","source":{"id":"2111.02480","kind":"arxiv","version":1}},"canonical_sha256":"2204f7ce5ed13d0dffd441ff7274b70f64c66dd76cbead92e66c20a67abf1c1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2204f7ce5ed13d0dffd441ff7274b70f64c66dd76cbead92e66c20a67abf1c1b","first_computed_at":"2026-07-05T03:28:52.030680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:28:52.030680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7hmgIMzPAPTQkF/fxhPXMoAB9rgoG7dLB069yRIxtIEPaAThDO89pCuDmVbNuOgc7DDxcXW1yVkMT14nopSdCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:28:52.031178Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.02480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b94e7fa62690fc6f5f2491aef88c6987e9835d7c336574d835c414f60ca770b","sha256:c0a5a9f34040984b2a6f16dd29d6d9f144c3399063f432afa8087a83ca234354"],"state_sha256":"a777158518067f0718f24ef0262d3824b0114478414ac64f8f3b267104bf4b83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXnlRiSlf0AmPHQFo+MatlG/H6C05dGJmwuHgdRNc8eD215TspU5Mfp1u6egjSRihpcgvTskGJZzKry/oGr1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:30:43.675594Z","bundle_sha256":"28c4337ccfff50579f5c186dd1e36fedd946619190e0f00b6685067eb0184c5f"}}