{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:22GYERVTPIRZNGFAOOW2VTLWVT","short_pith_number":"pith:22GYERVT","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"},"canonical_sha256":"d68d8246b37a239698a073adaacd76acfa233b68924672c80dfb000031c4b5a3","source":{"kind":"arxiv","id":"1406.6341","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6341","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6341v2","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6341","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"22GYERVTPIRZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"22GYERVTPIRZNGFA","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"22GYERVT","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:22GYERVTPIRZNGFAOOW2VTLWVT","target":"record","payload":{"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"},"canonical_sha256":"d68d8246b37a239698a073adaacd76acfa233b68924672c80dfb000031c4b5a3","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"},"source_kind":"arxiv","source_id":"1406.6341","source_version":2,"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-05-18T02:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AnLLBlwMkJtO/qk27+42agwO2czqX2v8/doJ9WIyk94LqXe5PGd0J0J0uhbzii9uj/ipTk/JtgiPJ6NSRtFhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:20:50.968175Z"},"content_sha256":"36607afac569d58594798df0e7bc2e3ba42845dfc5674cceea91cb3559f39850","schema_version":"1.0","event_id":"sha256:36607afac569d58594798df0e7bc2e3ba42845dfc5674cceea91cb3559f39850"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:22GYERVTPIRZNGFAOOW2VTLWVT","target":"graph","payload":{"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"},"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-05-18T02:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Z4V68RtcZRs14dG3nJr8kqCR4NqxROyhm4OCy4CVomXGRzdse1RISrnEdkEnyvQ1yxFdG6PkxVfvG/1XgQmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:20:50.968800Z"},"content_sha256":"08b3494bc619c3ef10235f7237495ea4f7626cb93ecb10c2425f06411cae1ade","schema_version":"1.0","event_id":"sha256:08b3494bc619c3ef10235f7237495ea4f7626cb93ecb10c2425f06411cae1ade"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT/bundle.json","state_url":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22GYERVTPIRZNGFAOOW2VTLWVT/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-05-26T15:20:50Z","links":{"resolver":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT","bundle":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT/bundle.json","state":"https://pith.science/pith/22GYERVTPIRZNGFAOOW2VTLWVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22GYERVTPIRZNGFAOOW2VTLWVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:22GYERVTPIRZNGFAOOW2VTLWVT","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":"03c9765c76266207e6720f7555e9785a903fedf0c23b86e3220b2576aa77d615","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-24T19:24:53Z","title_canon_sha256":"20dbfb8ba5eb00aca70ae1c62bacbdd8d0b6b7838ba8a672d40fa8f158a5fb1a"},"schema_version":"1.0","source":{"id":"1406.6341","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6341","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6341v2","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6341","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"22GYERVTPIRZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"22GYERVTPIRZNGFA","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"22GYERVT","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:08b3494bc619c3ef10235f7237495ea4f7626cb93ecb10c2425f06411cae1ade","target":"graph","created_at":"2026-05-18T02:48:45Z","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"},"paper":{"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","authors_text":"Alice Heliou, Carl Barton, Laurent Mouchard, Solon P. Pissis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-24T19:24:53Z","title":"Linear-time Computation of Minimal Absent Words Using Suffix Array"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6341","kind":"arxiv","version":2},"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:36607afac569d58594798df0e7bc2e3ba42845dfc5674cceea91cb3559f39850","target":"record","created_at":"2026-05-18T02:48:45Z","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":"03c9765c76266207e6720f7555e9785a903fedf0c23b86e3220b2576aa77d615","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-24T19:24:53Z","title_canon_sha256":"20dbfb8ba5eb00aca70ae1c62bacbdd8d0b6b7838ba8a672d40fa8f158a5fb1a"},"schema_version":"1.0","source":{"id":"1406.6341","kind":"arxiv","version":2}},"canonical_sha256":"d68d8246b37a239698a073adaacd76acfa233b68924672c80dfb000031c4b5a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d68d8246b37a239698a073adaacd76acfa233b68924672c80dfb000031c4b5a3","first_computed_at":"2026-05-18T02:48:45.705894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:45.705894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C8u5YK7s5rhlTvx1QHljAcx005eHy+SYjXxaf+Dd3Uk1jBQh+JEjx3RV1VUbqEphR5Ne+/GguSsXbO7cfDUlCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:45.706530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6341","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36607afac569d58594798df0e7bc2e3ba42845dfc5674cceea91cb3559f39850","sha256:08b3494bc619c3ef10235f7237495ea4f7626cb93ecb10c2425f06411cae1ade"],"state_sha256":"cd2edd02c361d7caf3b82d72e581f0f80170fa42f662c484c2b3b2b5c95744df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ariyteAZJfqv1uQKDNkhaUy2R+SJPEYC7L/aupFepMLGEkAWjH4zwOrNqVQtEnOmiU27BT7cCoUHj8hS2T0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:20:50.972012Z","bundle_sha256":"46652482a25c92354d5cdb1d31ad26eac0478e784213299892fbff66dc4e8dc6"}}