{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:PFYQQS4LGE2NMK5PBGTDEDUJOE","short_pith_number":"pith:PFYQQS4L","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"},"canonical_sha256":"7971084b8b3134d62baf09a6320e8971099b656bcb16fd3511a1b394c94d4ded","source":{"kind":"arxiv","id":"cs/0007009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0007009","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0007009v1","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0007009","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_12","alias_value":"PFYQQS4LGE2N","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_16","alias_value":"PFYQQS4LGE2NMK5P","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_8","alias_value":"PFYQQS4L","created_at":"2026-07-04T14:24:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:PFYQQS4LGE2NMK5PBGTDEDUJOE","target":"record","payload":{"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"},"canonical_sha256":"7971084b8b3134d62baf09a6320e8971099b656bcb16fd3511a1b394c94d4ded","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"},"source_kind":"arxiv","source_id":"cs/0007009","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-04T14:24:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YYEMww3xZ6ilY206FiHRk9CzXbaWkcBSurM4hIhn5ycc+4e9Wf5Q6QF67S/4yejWOgD7dNuiZmCXeXwr8AXVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:13:04.766418Z"},"content_sha256":"e187abffc03a7055af63e8691a4de3de54ad315aa8de6db3ef9ae9a79cd50589","schema_version":"1.0","event_id":"sha256:e187abffc03a7055af63e8691a4de3de54ad315aa8de6db3ef9ae9a79cd50589"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:PFYQQS4LGE2NMK5PBGTDEDUJOE","target":"graph","payload":{"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"},"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-04T14:24:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IidRyT3f3OVIm+0P/+GGJGT6WYVmtUQRBBMyP5v6Hc1gCT+2qM9yf8qlanoRK0rM5p0Q7oOf6/K+D4jjZs61BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:13:04.766916Z"},"content_sha256":"aac28e7569e554accbe3e5a6fc699b957602817067a3c0673feec09a79982266","schema_version":"1.0","event_id":"sha256:aac28e7569e554accbe3e5a6fc699b957602817067a3c0673feec09a79982266"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/bundle.json","state_url":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/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-08-16T20:13:04Z","links":{"resolver":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE","bundle":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/bundle.json","state":"https://pith.science/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PFYQQS4LGE2NMK5PBGTDEDUJOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:PFYQQS4LGE2NMK5PBGTDEDUJOE","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":"ae73a7490fd19696506fbaeda1aebf7687d4d213c3b024568c285050720262d9","cross_cats_sorted":[],"license":"","primary_cat":"cs.CL","submitted_at":"2000-07-06T14:15:26Z","title_canon_sha256":"e8df8fb34a7e175759001572ec3ba93874e88e868623ec8b4f0ad38368d33f9f"},"schema_version":"1.0","source":{"id":"cs/0007009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0007009","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0007009v1","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0007009","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_12","alias_value":"PFYQQS4LGE2N","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_16","alias_value":"PFYQQS4LGE2NMK5P","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_8","alias_value":"PFYQQS4L","created_at":"2026-07-04T14:24:03Z"}],"graph_snapshots":[{"event_id":"sha256:aac28e7569e554accbe3e5a6fc699b957602817067a3c0673feec09a79982266","target":"graph","created_at":"2026-07-04T14:24:03Z","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/cs/0007009/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Bruce Watson, Jan Daciuk, Richard Watson, Stoyan Mihov","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CL","submitted_at":"2000-07-06T14:15:26Z","title":"Incremental construction of minimal acyclic finite-state automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0007009","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:e187abffc03a7055af63e8691a4de3de54ad315aa8de6db3ef9ae9a79cd50589","target":"record","created_at":"2026-07-04T14:24:03Z","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":"ae73a7490fd19696506fbaeda1aebf7687d4d213c3b024568c285050720262d9","cross_cats_sorted":[],"license":"","primary_cat":"cs.CL","submitted_at":"2000-07-06T14:15:26Z","title_canon_sha256":"e8df8fb34a7e175759001572ec3ba93874e88e868623ec8b4f0ad38368d33f9f"},"schema_version":"1.0","source":{"id":"cs/0007009","kind":"arxiv","version":1}},"canonical_sha256":"7971084b8b3134d62baf09a6320e8971099b656bcb16fd3511a1b394c94d4ded","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7971084b8b3134d62baf09a6320e8971099b656bcb16fd3511a1b394c94d4ded","first_computed_at":"2026-07-04T14:24:03.329993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:03.329993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oBBUTB+sUlp5d4THVTefwBJVL/849OrHlrNUDTNc3hVHR5cMhlVTZvkUxdWI+sEuDE9/yia6ZdXYC8i67AONBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:03.330402Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0007009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e187abffc03a7055af63e8691a4de3de54ad315aa8de6db3ef9ae9a79cd50589","sha256:aac28e7569e554accbe3e5a6fc699b957602817067a3c0673feec09a79982266"],"state_sha256":"abeb568801ffa8eb6cfc396f5286604fc72448eea28ac77caff2fa970ac2d05f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMPsaaBwcIaNczZOxLeeT4bI96owMwqdkP0wWOOgkAfBGHcWnqnn1Ae6V13OnGheAok4JLGF8+wwN5cf/vl6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:13:04.772035Z","bundle_sha256":"d494f9b02e2c5874e4e1a0435e6cc2e976705e1bf0d38c862197a523b569367f"}}