{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WOIKF7YNTCU7LOC5ZQARYMBWSD","short_pith_number":"pith:WOIKF7YN","schema_version":"1.0","canonical_sha256":"b390a2ff0d98a9f5b85dcc011c303690c248fa8dfb631306cd5736182a6afd01","source":{"kind":"arxiv","id":"1510.08748","version":2},"attestation_state":"computed","paper":{"title":"Subsequence Automata with Default Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Frederik Rye Skjoldjensen, Inge Li G{\\o}rtz, Philip Bille","submitted_at":"2015-10-29T15:47:24Z","abstract_excerpt":"Let $S$ be a string of length $n$ with characters from an alphabet of size $\\sigma$. The \\emph{subsequence automaton} of $S$ (often called the \\emph{directed acyclic subsequence graph}) is the minimal deterministic finite automaton accepting all subsequences of $S$. A straightforward construction shows that the size (number of states and transitions) of the subsequence automaton is $O(n\\sigma)$ and that this bound is asymptotically optimal.\n  In this paper, we consider subsequence automata with \\emph{default transitions}, that is, special transitions to be taken only if none of the regular tra"},"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":"1510.08748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-10-29T15:47:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c6c397896bc0852e784c085e726925d46cb6e4a6b9d4ad9fbcbdcbd04fe737b3","abstract_canon_sha256":"afa5169e640dcc9f9669438ae0bb5d147764d5de9a2266dfbf5c7c786f1e62ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:33.599339Z","signature_b64":"iFNS5Gd3O9DURFhx4npWmh5ymAXgcqb/WkQqMcUKxcLAjrQzp8asv3w0RNS1wHO+9l6mG4nNJF63lcvOrcUtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b390a2ff0d98a9f5b85dcc011c303690c248fa8dfb631306cd5736182a6afd01","last_reissued_at":"2026-05-18T01:22:33.598885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:33.598885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subsequence Automata with Default Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Frederik Rye Skjoldjensen, Inge Li G{\\o}rtz, Philip Bille","submitted_at":"2015-10-29T15:47:24Z","abstract_excerpt":"Let $S$ be a string of length $n$ with characters from an alphabet of size $\\sigma$. The \\emph{subsequence automaton} of $S$ (often called the \\emph{directed acyclic subsequence graph}) is the minimal deterministic finite automaton accepting all subsequences of $S$. A straightforward construction shows that the size (number of states and transitions) of the subsequence automaton is $O(n\\sigma)$ and that this bound is asymptotically optimal.\n  In this paper, we consider subsequence automata with \\emph{default transitions}, that is, special transitions to be taken only if none of the regular tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08748","kind":"arxiv","version":2},"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":"1510.08748","created_at":"2026-05-18T01:22:33.598953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08748v2","created_at":"2026-05-18T01:22:33.598953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08748","created_at":"2026-05-18T01:22:33.598953+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOIKF7YNTCU7","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOIKF7YNTCU7LOC5","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOIKF7YN","created_at":"2026-05-18T12:29:47.479230+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/WOIKF7YNTCU7LOC5ZQARYMBWSD","json":"https://pith.science/pith/WOIKF7YNTCU7LOC5ZQARYMBWSD.json","graph_json":"https://pith.science/api/pith-number/WOIKF7YNTCU7LOC5ZQARYMBWSD/graph.json","events_json":"https://pith.science/api/pith-number/WOIKF7YNTCU7LOC5ZQARYMBWSD/events.json","paper":"https://pith.science/paper/WOIKF7YN"},"agent_actions":{"view_html":"https://pith.science/pith/WOIKF7YNTCU7LOC5ZQARYMBWSD","download_json":"https://pith.science/pith/WOIKF7YNTCU7LOC5ZQARYMBWSD.json","view_paper":"https://pith.science/paper/WOIKF7YN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08748&json=true","fetch_graph":"https://pith.science/api/pith-number/WOIKF7YNTCU7LOC5ZQARYMBWSD/graph.json","fetch_events":"https://pith.science/api/pith-number/WOIKF7YNTCU7LOC5ZQARYMBWSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOIKF7YNTCU7LOC5ZQARYMBWSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOIKF7YNTCU7LOC5ZQARYMBWSD/action/storage_attestation","attest_author":"https://pith.science/pith/WOIKF7YNTCU7LOC5ZQARYMBWSD/action/author_attestation","sign_citation":"https://pith.science/pith/WOIKF7YNTCU7LOC5ZQARYMBWSD/action/citation_signature","submit_replication":"https://pith.science/pith/WOIKF7YNTCU7LOC5ZQARYMBWSD/action/replication_record"}},"created_at":"2026-05-18T01:22:33.598953+00:00","updated_at":"2026-05-18T01:22:33.598953+00:00"}