{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6M2AENGGVRFZSL3SAF6ZDCR4V3","short_pith_number":"pith:6M2AENGG","schema_version":"1.0","canonical_sha256":"f3340234c6ac4b992f72017d918a3caefbb6d666fa8185cbf54189208217eacd","source":{"kind":"arxiv","id":"2306.05684","version":2},"attestation_state":"computed","paper":{"title":"Space-time Trade-offs for the LCP Array of Wheeler DFAs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Nicola Cotumaccio, Nicola Prezza, Travis Gagie","submitted_at":"2023-06-09T05:53:49Z","abstract_excerpt":"Recently, Conte et al. generalized the longest-common prefix (LCP) array from strings to Wheeler DFAs, and they showed that it can be used to efficiently determine matching statistics on a Wheeler DFA [DCC 2023]. However, storing the LCP array requires $ O(n \\log n) $ bits, $ n $ being the number of states, while the compact representation of Wheeler DFAs often requires much less space. In particular, the BOSS representation of a de Bruijn graph only requires a linear number of bits, if the size of alphabet is constant.\n  In this paper, we propose a sampling technique that allows to access an "},"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":"2306.05684","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-06-09T05:53:49Z","cross_cats_sorted":[],"title_canon_sha256":"38fd10e9c90788d0bbef7059248813c88d61c63e607698dfb53e09e6a3b22d0c","abstract_canon_sha256":"45369fe5190c06348bdccd09f25b45a1019092a78e0cab61f8fda29285fcd0b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:56:13.000546Z","signature_b64":"j8gVqwp571BhPLfWQfVf0eOQ1NKRvTWgEfn88kfqiAh2Tgzar4EGX1+hbmt1xmqCIiAdQHmSN86D4HnhdU/eDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3340234c6ac4b992f72017d918a3caefbb6d666fa8185cbf54189208217eacd","last_reissued_at":"2026-07-05T08:56:13.000124Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:56:13.000124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-time Trade-offs for the LCP Array of Wheeler DFAs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Nicola Cotumaccio, Nicola Prezza, Travis Gagie","submitted_at":"2023-06-09T05:53:49Z","abstract_excerpt":"Recently, Conte et al. generalized the longest-common prefix (LCP) array from strings to Wheeler DFAs, and they showed that it can be used to efficiently determine matching statistics on a Wheeler DFA [DCC 2023]. However, storing the LCP array requires $ O(n \\log n) $ bits, $ n $ being the number of states, while the compact representation of Wheeler DFAs often requires much less space. In particular, the BOSS representation of a de Bruijn graph only requires a linear number of bits, if the size of alphabet is constant.\n  In this paper, we propose a sampling technique that allows to access an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.05684","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.05684/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.05684","created_at":"2026-07-05T08:56:13.000178+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.05684v2","created_at":"2026-07-05T08:56:13.000178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.05684","created_at":"2026-07-05T08:56:13.000178+00:00"},{"alias_kind":"pith_short_12","alias_value":"6M2AENGGVRFZ","created_at":"2026-07-05T08:56:13.000178+00:00"},{"alias_kind":"pith_short_16","alias_value":"6M2AENGGVRFZSL3S","created_at":"2026-07-05T08:56:13.000178+00:00"},{"alias_kind":"pith_short_8","alias_value":"6M2AENGG","created_at":"2026-07-05T08:56:13.000178+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/6M2AENGGVRFZSL3SAF6ZDCR4V3","json":"https://pith.science/pith/6M2AENGGVRFZSL3SAF6ZDCR4V3.json","graph_json":"https://pith.science/api/pith-number/6M2AENGGVRFZSL3SAF6ZDCR4V3/graph.json","events_json":"https://pith.science/api/pith-number/6M2AENGGVRFZSL3SAF6ZDCR4V3/events.json","paper":"https://pith.science/paper/6M2AENGG"},"agent_actions":{"view_html":"https://pith.science/pith/6M2AENGGVRFZSL3SAF6ZDCR4V3","download_json":"https://pith.science/pith/6M2AENGGVRFZSL3SAF6ZDCR4V3.json","view_paper":"https://pith.science/paper/6M2AENGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.05684&json=true","fetch_graph":"https://pith.science/api/pith-number/6M2AENGGVRFZSL3SAF6ZDCR4V3/graph.json","fetch_events":"https://pith.science/api/pith-number/6M2AENGGVRFZSL3SAF6ZDCR4V3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6M2AENGGVRFZSL3SAF6ZDCR4V3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6M2AENGGVRFZSL3SAF6ZDCR4V3/action/storage_attestation","attest_author":"https://pith.science/pith/6M2AENGGVRFZSL3SAF6ZDCR4V3/action/author_attestation","sign_citation":"https://pith.science/pith/6M2AENGGVRFZSL3SAF6ZDCR4V3/action/citation_signature","submit_replication":"https://pith.science/pith/6M2AENGGVRFZSL3SAF6ZDCR4V3/action/replication_record"}},"created_at":"2026-07-05T08:56:13.000178+00:00","updated_at":"2026-07-05T08:56:13.000178+00:00"}