{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MWR6HGVEMZSXNZRVCBP2ONPX2N","short_pith_number":"pith:MWR6HGVE","schema_version":"1.0","canonical_sha256":"65a3e39aa4666576e635105fa735f7d341da6052e22ffe5caa391e191ed5c6f3","source":{"kind":"arxiv","id":"1607.06660","version":1},"attestation_state":"computed","paper":{"title":"Fast Longest Common Extensions in Small Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alberto Policriti, Nicola Prezza","submitted_at":"2016-07-22T12:54:30Z","abstract_excerpt":"In this paper we address the longest common extension (LCE) problem: to compute the length $\\ell$ of the longest common prefix between any two suffixes of $T\\in \\Sigma^n$ with $ \\Sigma = \\{0, \\ldots \\sigma-1\\} $. We present two fast and space-efficient solutions based on (Karp-Rabin) \\textit{fingerprinting} and \\textit{sampling}. Our first data structure exploits properties of Mersenne prime numbers when used as moduli of the Karp-Rabin hash function and takes $n\\lceil \\log_2\\sigma\\rceil$ bits of space. Our second structure works with any prime modulus and takes $n\\lceil \\log_2\\sigma\\rceil + 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":"1607.06660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-22T12:54:30Z","cross_cats_sorted":[],"title_canon_sha256":"2fefcea47af2fbc64b2efd21341db20f7d72534bb56ee4a3d7a47b7d498654d3","abstract_canon_sha256":"5e619f22d5582a6cb017a19738d85ff27cdb4077c438c9afd77240bbe144bc69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:39.343408Z","signature_b64":"XZZ56ibchkXPlvqCAiH12n/5i5C+J3FQFBUqruJ+gbvIlXv24u3RssvSX6Nh45+fZdrh3up2gc4cOmuhAjYyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65a3e39aa4666576e635105fa735f7d341da6052e22ffe5caa391e191ed5c6f3","last_reissued_at":"2026-05-18T01:10:39.342806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:39.342806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Longest Common Extensions in Small Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alberto Policriti, Nicola Prezza","submitted_at":"2016-07-22T12:54:30Z","abstract_excerpt":"In this paper we address the longest common extension (LCE) problem: to compute the length $\\ell$ of the longest common prefix between any two suffixes of $T\\in \\Sigma^n$ with $ \\Sigma = \\{0, \\ldots \\sigma-1\\} $. We present two fast and space-efficient solutions based on (Karp-Rabin) \\textit{fingerprinting} and \\textit{sampling}. Our first data structure exploits properties of Mersenne prime numbers when used as moduli of the Karp-Rabin hash function and takes $n\\lceil \\log_2\\sigma\\rceil$ bits of space. Our second structure works with any prime modulus and takes $n\\lceil \\log_2\\sigma\\rceil + n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06660","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":"1607.06660","created_at":"2026-05-18T01:10:39.342895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06660v1","created_at":"2026-05-18T01:10:39.342895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06660","created_at":"2026-05-18T01:10:39.342895+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWR6HGVEMZSX","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWR6HGVEMZSXNZRV","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWR6HGVE","created_at":"2026-05-18T12:30:32.724797+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/MWR6HGVEMZSXNZRVCBP2ONPX2N","json":"https://pith.science/pith/MWR6HGVEMZSXNZRVCBP2ONPX2N.json","graph_json":"https://pith.science/api/pith-number/MWR6HGVEMZSXNZRVCBP2ONPX2N/graph.json","events_json":"https://pith.science/api/pith-number/MWR6HGVEMZSXNZRVCBP2ONPX2N/events.json","paper":"https://pith.science/paper/MWR6HGVE"},"agent_actions":{"view_html":"https://pith.science/pith/MWR6HGVEMZSXNZRVCBP2ONPX2N","download_json":"https://pith.science/pith/MWR6HGVEMZSXNZRVCBP2ONPX2N.json","view_paper":"https://pith.science/paper/MWR6HGVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06660&json=true","fetch_graph":"https://pith.science/api/pith-number/MWR6HGVEMZSXNZRVCBP2ONPX2N/graph.json","fetch_events":"https://pith.science/api/pith-number/MWR6HGVEMZSXNZRVCBP2ONPX2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWR6HGVEMZSXNZRVCBP2ONPX2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWR6HGVEMZSXNZRVCBP2ONPX2N/action/storage_attestation","attest_author":"https://pith.science/pith/MWR6HGVEMZSXNZRVCBP2ONPX2N/action/author_attestation","sign_citation":"https://pith.science/pith/MWR6HGVEMZSXNZRVCBP2ONPX2N/action/citation_signature","submit_replication":"https://pith.science/pith/MWR6HGVEMZSXNZRVCBP2ONPX2N/action/replication_record"}},"created_at":"2026-05-18T01:10:39.342895+00:00","updated_at":"2026-05-18T01:10:39.342895+00:00"}