{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:22GYERVTPIRZNGFAOOW2VTLWVT","short_pith_number":"pith:22GYERVT","schema_version":"1.0","canonical_sha256":"d68d8246b37a239698a073adaacd76acfa233b68924672c80dfb000031c4b5a3","source":{"kind":"arxiv","id":"1406.6341","version":2},"attestation_state":"computed","paper":{"title":"Linear-time Computation of Minimal Absent Words Using Suffix Array","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alice Heliou, Carl Barton, Laurent Mouchard, Solon P. Pissis","submitted_at":"2014-06-24T19:24:53Z","abstract_excerpt":"An absent word of a word y of length n is a word that does not occur in y. It is a minimal absent word if all its proper factors occur in y. Minimal absent words have been computed in genomes of organisms from all domains of life; their computation provides a fast alternative for measuring approximation in sequence comparison. There exists an O(n)-time and O(n)-space algorithm for computing all minimal absent words on a fixed-sized alphabet based on the construction of suffix automata (Crochemore et al., 1998). No implementation of this algorithm is publicly available. There also exists an O(n"},"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":"1406.6341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-24T19:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"20dbfb8ba5eb00aca70ae1c62bacbdd8d0b6b7838ba8a672d40fa8f158a5fb1a","abstract_canon_sha256":"03c9765c76266207e6720f7555e9785a903fedf0c23b86e3220b2576aa77d615"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:45.706530Z","signature_b64":"C8u5YK7s5rhlTvx1QHljAcx005eHy+SYjXxaf+Dd3Uk1jBQh+JEjx3RV1VUbqEphR5Ne+/GguSsXbO7cfDUlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d68d8246b37a239698a073adaacd76acfa233b68924672c80dfb000031c4b5a3","last_reissued_at":"2026-05-18T02:48:45.705894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:45.705894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-time Computation of Minimal Absent Words Using Suffix Array","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alice Heliou, Carl Barton, Laurent Mouchard, Solon P. Pissis","submitted_at":"2014-06-24T19:24:53Z","abstract_excerpt":"An absent word of a word y of length n is a word that does not occur in y. It is a minimal absent word if all its proper factors occur in y. Minimal absent words have been computed in genomes of organisms from all domains of life; their computation provides a fast alternative for measuring approximation in sequence comparison. There exists an O(n)-time and O(n)-space algorithm for computing all minimal absent words on a fixed-sized alphabet based on the construction of suffix automata (Crochemore et al., 1998). No implementation of this algorithm is publicly available. There also exists an O(n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6341","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":"1406.6341","created_at":"2026-05-18T02:48:45.705964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6341v2","created_at":"2026-05-18T02:48:45.705964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6341","created_at":"2026-05-18T02:48:45.705964+00:00"},{"alias_kind":"pith_short_12","alias_value":"22GYERVTPIRZ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"22GYERVTPIRZNGFA","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"22GYERVT","created_at":"2026-05-18T12:28:09.283467+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/22GYERVTPIRZNGFAOOW2VTLWVT","json":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT.json","graph_json":"https://pith.science/api/pith-number/22GYERVTPIRZNGFAOOW2VTLWVT/graph.json","events_json":"https://pith.science/api/pith-number/22GYERVTPIRZNGFAOOW2VTLWVT/events.json","paper":"https://pith.science/paper/22GYERVT"},"agent_actions":{"view_html":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT","download_json":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT.json","view_paper":"https://pith.science/paper/22GYERVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6341&json=true","fetch_graph":"https://pith.science/api/pith-number/22GYERVTPIRZNGFAOOW2VTLWVT/graph.json","fetch_events":"https://pith.science/api/pith-number/22GYERVTPIRZNGFAOOW2VTLWVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT/action/storage_attestation","attest_author":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT/action/author_attestation","sign_citation":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT/action/citation_signature","submit_replication":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT/action/replication_record"}},"created_at":"2026-05-18T02:48:45.705964+00:00","updated_at":"2026-05-18T02:48:45.705964+00:00"}