{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:PFYQQS4LGE2NMK5PBGTDEDUJOE","short_pith_number":"pith:PFYQQS4L","schema_version":"1.0","canonical_sha256":"7971084b8b3134d62baf09a6320e8971099b656bcb16fd3511a1b394c94d4ded","source":{"kind":"arxiv","id":"cs/0007009","version":1},"attestation_state":"computed","paper":{"title":"Incremental construction of minimal acyclic finite-state automata","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bruce Watson, Jan Daciuk, Richard Watson, Stoyan Mihov","submitted_at":"2000-07-06T14:15:26Z","abstract_excerpt":"In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly. We present a general algorithm as well as a specialization that relies upon the lexicographical ordering of the input strings."},"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":"cs/0007009","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CL","submitted_at":"2000-07-06T14:15:26Z","cross_cats_sorted":[],"title_canon_sha256":"e8df8fb34a7e175759001572ec3ba93874e88e868623ec8b4f0ad38368d33f9f","abstract_canon_sha256":"ae73a7490fd19696506fbaeda1aebf7687d4d213c3b024568c285050720262d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:03.330402Z","signature_b64":"oBBUTB+sUlp5d4THVTefwBJVL/849OrHlrNUDTNc3hVHR5cMhlVTZvkUxdWI+sEuDE9/yia6ZdXYC8i67AONBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7971084b8b3134d62baf09a6320e8971099b656bcb16fd3511a1b394c94d4ded","last_reissued_at":"2026-07-04T14:24:03.329993Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:03.329993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental construction of minimal acyclic finite-state automata","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bruce Watson, Jan Daciuk, Richard Watson, Stoyan Mihov","submitted_at":"2000-07-06T14:15:26Z","abstract_excerpt":"In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly. We present a general algorithm as well as a specialization that relies upon the lexicographical ordering of the input strings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0007009","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/cs/0007009/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0007009","created_at":"2026-07-04T14:24:03.330051+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0007009v1","created_at":"2026-07-04T14:24:03.330051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0007009","created_at":"2026-07-04T14:24:03.330051+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFYQQS4LGE2N","created_at":"2026-07-04T14:24:03.330051+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFYQQS4LGE2NMK5P","created_at":"2026-07-04T14:24:03.330051+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFYQQS4L","created_at":"2026-07-04T14:24:03.330051+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/PFYQQS4LGE2NMK5PBGTDEDUJOE","json":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE.json","graph_json":"https://pith.science/api/pith-number/PFYQQS4LGE2NMK5PBGTDEDUJOE/graph.json","events_json":"https://pith.science/api/pith-number/PFYQQS4LGE2NMK5PBGTDEDUJOE/events.json","paper":"https://pith.science/paper/PFYQQS4L"},"agent_actions":{"view_html":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE","download_json":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE.json","view_paper":"https://pith.science/paper/PFYQQS4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0007009&json=true","fetch_graph":"https://pith.science/api/pith-number/PFYQQS4LGE2NMK5PBGTDEDUJOE/graph.json","fetch_events":"https://pith.science/api/pith-number/PFYQQS4LGE2NMK5PBGTDEDUJOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/action/storage_attestation","attest_author":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/action/author_attestation","sign_citation":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/action/citation_signature","submit_replication":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/action/replication_record"}},"created_at":"2026-07-04T14:24:03.330051+00:00","updated_at":"2026-07-04T14:24:03.330051+00:00"}