{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YIAVGKW3MKTRPPT3OSOZK4BQVN","short_pith_number":"pith:YIAVGKW3","canonical_record":{"source":{"id":"1902.04785","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-02-13T08:45:51Z","cross_cats_sorted":[],"title_canon_sha256":"19bfe1ec4bcea4bf089af1341b706c8d0e9188fc328c3cdbff7ea438233ac1da","abstract_canon_sha256":"9ef53e770db6d58fe2f77276685c3c2f2ca6a3e4f0d1bf813128cb9fe9910e42"},"schema_version":"1.0"},"canonical_sha256":"c201532adb62a717be7b749d957030ab75c8fef350c55dddeb0637d1b934a9fd","source":{"kind":"arxiv","id":"1902.04785","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04785","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04785v1","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04785","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"YIAVGKW3MKTR","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YIAVGKW3MKTRPPT3","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YIAVGKW3","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YIAVGKW3MKTRPPT3OSOZK4BQVN","target":"record","payload":{"canonical_record":{"source":{"id":"1902.04785","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-02-13T08:45:51Z","cross_cats_sorted":[],"title_canon_sha256":"19bfe1ec4bcea4bf089af1341b706c8d0e9188fc328c3cdbff7ea438233ac1da","abstract_canon_sha256":"9ef53e770db6d58fe2f77276685c3c2f2ca6a3e4f0d1bf813128cb9fe9910e42"},"schema_version":"1.0"},"canonical_sha256":"c201532adb62a717be7b749d957030ab75c8fef350c55dddeb0637d1b934a9fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:05.952697Z","signature_b64":"ppsZsxY9DoUaucYK4kK+Uz1wGtKcWtcMEPcyPFcvbRfMA3ZwkZw9Km5yfWUyPlqjAWDSvi3sQpOJb0PoG+JSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c201532adb62a717be7b749d957030ab75c8fef350c55dddeb0637d1b934a9fd","last_reissued_at":"2026-05-17T23:54:05.952184Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:05.952184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.04785","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-05-17T23:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMtMpDdRbUIp08QeR4hEoVvKEBPnsb75yTQ9mEyOy9kmdXYOf7FZIwbnn/rtro5ZV4yrdP0gK0c2w9mdtooOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:24:49.225917Z"},"content_sha256":"fbd3a6a224a83dad30088162f6f69e97af71b04eaabb2705ac1b9af8f691fec7","schema_version":"1.0","event_id":"sha256:fbd3a6a224a83dad30088162f6f69e97af71b04eaabb2705ac1b9af8f691fec7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YIAVGKW3MKTRPPT3OSOZK4BQVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing Antidictionaries in Output-Sensitive Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alice H\\'eliou, Gabriele Fici, Golnaz Badkobeh, Lorraine A.K. Ayad, Solon P. Pissis","submitted_at":"2019-02-13T08:45:51Z","abstract_excerpt":"A word $x$ that is absent from a word $y$ is called minimal if all its proper factors occur in $y$. Given a collection of $k$ words $y_1,y_2,\\ldots,y_k$ over an alphabet $\\Sigma$, we are asked to compute the set $\\mathrm{M}^{\\ell}_{y_{1}\\#\\ldots\\#y_{k}}$ of minimal absent words of length at most $\\ell$ of word $y=y_1\\#y_2\\#\\ldots\\#y_k$, $\\#\\notin\\Sigma$. In data compression, this corresponds to computing the antidictionary of $k$ documents. In bioinformatics, it corresponds to computing words that are absent from a genome of $k$ chromosomes. This computation generally requires $\\Omega(n)$ spac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04785","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":""},"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-17T23:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1jYTawAIt7lGNNnvtlHfaZKsMlZ3n+yHYiH06YPGbfGegwPSSAdabdHFMuVI+QcHZPJZnYTiWEdJaNuMB87KCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:24:49.226333Z"},"content_sha256":"7fc4865df9b339b6ab868ea8da1f063ac07c236e89ad4e16483d87dd7372187d","schema_version":"1.0","event_id":"sha256:7fc4865df9b339b6ab868ea8da1f063ac07c236e89ad4e16483d87dd7372187d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/bundle.json","state_url":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/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-26T20:24:49Z","links":{"resolver":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN","bundle":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/bundle.json","state":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YIAVGKW3MKTRPPT3OSOZK4BQVN","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":"9ef53e770db6d58fe2f77276685c3c2f2ca6a3e4f0d1bf813128cb9fe9910e42","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-02-13T08:45:51Z","title_canon_sha256":"19bfe1ec4bcea4bf089af1341b706c8d0e9188fc328c3cdbff7ea438233ac1da"},"schema_version":"1.0","source":{"id":"1902.04785","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04785","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04785v1","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04785","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"YIAVGKW3MKTR","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YIAVGKW3MKTRPPT3","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YIAVGKW3","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:7fc4865df9b339b6ab868ea8da1f063ac07c236e89ad4e16483d87dd7372187d","target":"graph","created_at":"2026-05-17T23:54:05Z","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":"A word $x$ that is absent from a word $y$ is called minimal if all its proper factors occur in $y$. Given a collection of $k$ words $y_1,y_2,\\ldots,y_k$ over an alphabet $\\Sigma$, we are asked to compute the set $\\mathrm{M}^{\\ell}_{y_{1}\\#\\ldots\\#y_{k}}$ of minimal absent words of length at most $\\ell$ of word $y=y_1\\#y_2\\#\\ldots\\#y_k$, $\\#\\notin\\Sigma$. In data compression, this corresponds to computing the antidictionary of $k$ documents. In bioinformatics, it corresponds to computing words that are absent from a genome of $k$ chromosomes. This computation generally requires $\\Omega(n)$ spac","authors_text":"Alice H\\'eliou, Gabriele Fici, Golnaz Badkobeh, Lorraine A.K. Ayad, Solon P. Pissis","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-02-13T08:45:51Z","title":"Constructing Antidictionaries in Output-Sensitive Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04785","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:fbd3a6a224a83dad30088162f6f69e97af71b04eaabb2705ac1b9af8f691fec7","target":"record","created_at":"2026-05-17T23:54:05Z","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":"9ef53e770db6d58fe2f77276685c3c2f2ca6a3e4f0d1bf813128cb9fe9910e42","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-02-13T08:45:51Z","title_canon_sha256":"19bfe1ec4bcea4bf089af1341b706c8d0e9188fc328c3cdbff7ea438233ac1da"},"schema_version":"1.0","source":{"id":"1902.04785","kind":"arxiv","version":1}},"canonical_sha256":"c201532adb62a717be7b749d957030ab75c8fef350c55dddeb0637d1b934a9fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c201532adb62a717be7b749d957030ab75c8fef350c55dddeb0637d1b934a9fd","first_computed_at":"2026-05-17T23:54:05.952184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:05.952184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ppsZsxY9DoUaucYK4kK+Uz1wGtKcWtcMEPcyPFcvbRfMA3ZwkZw9Km5yfWUyPlqjAWDSvi3sQpOJb0PoG+JSDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:05.952697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04785","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbd3a6a224a83dad30088162f6f69e97af71b04eaabb2705ac1b9af8f691fec7","sha256:7fc4865df9b339b6ab868ea8da1f063ac07c236e89ad4e16483d87dd7372187d"],"state_sha256":"47c519ea8fef12caed1392e7e139ef2e9ffc460934b553ba218a3e56faf900c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JkPIHHbczF/e+hXz1aoN2dksRD2Ss3qzaACof59DO45cO65Bmjz9/qCChquVOpQ3sltCwYAz0KwQD8y9Q5a0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:24:49.229830Z","bundle_sha256":"28919aa7d04bd7f44446d4e94da0f896a3fab0b0de84ea926d85d089c52b22e2"}}