{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YIAVGKW3MKTRPPT3OSOZK4BQVN","short_pith_number":"pith:YIAVGKW3","schema_version":"1.0","canonical_sha256":"c201532adb62a717be7b749d957030ab75c8fef350c55dddeb0637d1b934a9fd","source":{"kind":"arxiv","id":"1902.04785","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.04785","created_at":"2026-05-17T23:54:05.952255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04785v1","created_at":"2026-05-17T23:54:05.952255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04785","created_at":"2026-05-17T23:54:05.952255+00:00"},{"alias_kind":"pith_short_12","alias_value":"YIAVGKW3MKTR","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YIAVGKW3MKTRPPT3","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YIAVGKW3","created_at":"2026-05-18T12:33:33.725879+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/YIAVGKW3MKTRPPT3OSOZK4BQVN","json":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN.json","graph_json":"https://pith.science/api/pith-number/YIAVGKW3MKTRPPT3OSOZK4BQVN/graph.json","events_json":"https://pith.science/api/pith-number/YIAVGKW3MKTRPPT3OSOZK4BQVN/events.json","paper":"https://pith.science/paper/YIAVGKW3"},"agent_actions":{"view_html":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN","download_json":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN.json","view_paper":"https://pith.science/paper/YIAVGKW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04785&json=true","fetch_graph":"https://pith.science/api/pith-number/YIAVGKW3MKTRPPT3OSOZK4BQVN/graph.json","fetch_events":"https://pith.science/api/pith-number/YIAVGKW3MKTRPPT3OSOZK4BQVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/action/storage_attestation","attest_author":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/action/author_attestation","sign_citation":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/action/citation_signature","submit_replication":"https://pith.science/pith/YIAVGKW3MKTRPPT3OSOZK4BQVN/action/replication_record"}},"created_at":"2026-05-17T23:54:05.952255+00:00","updated_at":"2026-05-17T23:54:05.952255+00:00"}