{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YEVQEM3IOHPB265UK4RMDGO36L","short_pith_number":"pith:YEVQEM3I","schema_version":"1.0","canonical_sha256":"c12b02336871de1d7bb45722c199dbf2c565684ee3a288128d37e526d23bb8e1","source":{"kind":"arxiv","id":"1103.5736","version":1},"attestation_state":"computed","paper":{"title":"Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"cs.DC","authors_text":"Daniel Kunkle, Gene Cooperman, Stephen Linton, Vlad Slavici","submitted_at":"2011-03-29T19:33:54Z","abstract_excerpt":"Finite state automata (FSA) are ubiquitous in computer science. Two of the most important algorithms for FSA processing are the conversion of a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA), and then the production of the unique minimal DFA for the original NFA. We exhibit a parallel disk-based algorithm that uses a cluster of 29 commodity computers to produce an intermediate DFA with almost two billion states and then continues by producing the corresponding unique minimal DFA with less than 800,000 states. The largest previous such computation in the lite"},"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":"1103.5736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-29T19:33:54Z","cross_cats_sorted":["math.CO","math.GR"],"title_canon_sha256":"8393e99e385ea71e29595cb8eea9e5d5155430efa2a0d30cf74fc0e45350dcb2","abstract_canon_sha256":"3e916499df992e43dbbae57e61eccaa981a3577c25c8f681d42e224fa47910ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:29.009446Z","signature_b64":"hw/M6xCdNe8TArNqOWv/ltHm2UtpAHgIGGbs8RFljOgXj9RmYK5HmfEd1oB7TBiqcQZMuTwhPkC/AnY6rwfTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c12b02336871de1d7bb45722c199dbf2c565684ee3a288128d37e526d23bb8e1","last_reissued_at":"2026-05-18T04:25:29.008917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:29.008917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"cs.DC","authors_text":"Daniel Kunkle, Gene Cooperman, Stephen Linton, Vlad Slavici","submitted_at":"2011-03-29T19:33:54Z","abstract_excerpt":"Finite state automata (FSA) are ubiquitous in computer science. Two of the most important algorithms for FSA processing are the conversion of a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA), and then the production of the unique minimal DFA for the original NFA. We exhibit a parallel disk-based algorithm that uses a cluster of 29 commodity computers to produce an intermediate DFA with almost two billion states and then continues by producing the corresponding unique minimal DFA with less than 800,000 states. The largest previous such computation in the lite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5736","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":"1103.5736","created_at":"2026-05-18T04:25:29.009013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5736v1","created_at":"2026-05-18T04:25:29.009013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5736","created_at":"2026-05-18T04:25:29.009013+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEVQEM3IOHPB","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEVQEM3IOHPB265U","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEVQEM3I","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.10319","citing_title":"Deconstructing Subset Construction -- Reducing While Determinizing","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YEVQEM3IOHPB265UK4RMDGO36L","json":"https://pith.science/pith/YEVQEM3IOHPB265UK4RMDGO36L.json","graph_json":"https://pith.science/api/pith-number/YEVQEM3IOHPB265UK4RMDGO36L/graph.json","events_json":"https://pith.science/api/pith-number/YEVQEM3IOHPB265UK4RMDGO36L/events.json","paper":"https://pith.science/paper/YEVQEM3I"},"agent_actions":{"view_html":"https://pith.science/pith/YEVQEM3IOHPB265UK4RMDGO36L","download_json":"https://pith.science/pith/YEVQEM3IOHPB265UK4RMDGO36L.json","view_paper":"https://pith.science/paper/YEVQEM3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5736&json=true","fetch_graph":"https://pith.science/api/pith-number/YEVQEM3IOHPB265UK4RMDGO36L/graph.json","fetch_events":"https://pith.science/api/pith-number/YEVQEM3IOHPB265UK4RMDGO36L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEVQEM3IOHPB265UK4RMDGO36L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEVQEM3IOHPB265UK4RMDGO36L/action/storage_attestation","attest_author":"https://pith.science/pith/YEVQEM3IOHPB265UK4RMDGO36L/action/author_attestation","sign_citation":"https://pith.science/pith/YEVQEM3IOHPB265UK4RMDGO36L/action/citation_signature","submit_replication":"https://pith.science/pith/YEVQEM3IOHPB265UK4RMDGO36L/action/replication_record"}},"created_at":"2026-05-18T04:25:29.009013+00:00","updated_at":"2026-05-18T04:25:29.009013+00:00"}