{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IEM45GMCUYL6AQMNWT3WLIMLE6","short_pith_number":"pith:IEM45GMC","schema_version":"1.0","canonical_sha256":"4119ce9982a617e0418db4f765a18b27a40c96243d652e614661162eafb467e7","source":{"kind":"arxiv","id":"1305.2777","version":2},"attestation_state":"computed","paper":{"title":"Fingerprints in Compressed Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Sach, Hjalte Wedel Vildh{\\o}j, Inge Li G{\\o}rtz, Patrick Hagge Cording, Philip Bille, S{\\o}ren Vind","submitted_at":"2013-05-13T13:50:11Z","abstract_excerpt":"The Karp-Rabin fingerprint of a string is a type of hash value that due to its strong properties has been used in many string algorithms. In this paper we show how to construct a data structure for a string $S$ of size $N$ compressed by a context-free grammar of size $n$ that answers fingerprint queries. That is, given indices $i$ and $j$, the answer to a query is the fingerprint of the substring $S[i,j]$. We present the first O(n) space data structures that answer fingerprint queries without decompressing any characters. For Straight Line Programs (SLP) we get $O(\\log N)$ query time, and for "},"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":"1305.2777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-13T13:50:11Z","cross_cats_sorted":[],"title_canon_sha256":"9a6ef9afa50bdfc5c12ff33eadbe8e0da4c5b1a13b864ce232767e50ff5cbb6f","abstract_canon_sha256":"fab33c90c9b99b2e698c614de4e0597200bb81981ada2f3c2b5204363bb2f188"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:34.379620Z","signature_b64":"GDRAfJjvijEjHClZdQrh3f5YqyTUYAitpfkGPPoV9z/HZsgjw8jo/Z9ce8J4gbV27KZf8MqNiMNvQZY4xE7mAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4119ce9982a617e0418db4f765a18b27a40c96243d652e614661162eafb467e7","last_reissued_at":"2026-05-18T03:25:34.378773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:34.378773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fingerprints in Compressed Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Sach, Hjalte Wedel Vildh{\\o}j, Inge Li G{\\o}rtz, Patrick Hagge Cording, Philip Bille, S{\\o}ren Vind","submitted_at":"2013-05-13T13:50:11Z","abstract_excerpt":"The Karp-Rabin fingerprint of a string is a type of hash value that due to its strong properties has been used in many string algorithms. In this paper we show how to construct a data structure for a string $S$ of size $N$ compressed by a context-free grammar of size $n$ that answers fingerprint queries. That is, given indices $i$ and $j$, the answer to a query is the fingerprint of the substring $S[i,j]$. We present the first O(n) space data structures that answer fingerprint queries without decompressing any characters. For Straight Line Programs (SLP) we get $O(\\log N)$ query time, and for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2777","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.2777","created_at":"2026-05-18T03:25:34.378910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2777v2","created_at":"2026-05-18T03:25:34.378910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2777","created_at":"2026-05-18T03:25:34.378910+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEM45GMCUYL6","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEM45GMCUYL6AQMN","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEM45GMC","created_at":"2026-05-18T12:27:46.883200+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/IEM45GMCUYL6AQMNWT3WLIMLE6","json":"https://pith.science/pith/IEM45GMCUYL6AQMNWT3WLIMLE6.json","graph_json":"https://pith.science/api/pith-number/IEM45GMCUYL6AQMNWT3WLIMLE6/graph.json","events_json":"https://pith.science/api/pith-number/IEM45GMCUYL6AQMNWT3WLIMLE6/events.json","paper":"https://pith.science/paper/IEM45GMC"},"agent_actions":{"view_html":"https://pith.science/pith/IEM45GMCUYL6AQMNWT3WLIMLE6","download_json":"https://pith.science/pith/IEM45GMCUYL6AQMNWT3WLIMLE6.json","view_paper":"https://pith.science/paper/IEM45GMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2777&json=true","fetch_graph":"https://pith.science/api/pith-number/IEM45GMCUYL6AQMNWT3WLIMLE6/graph.json","fetch_events":"https://pith.science/api/pith-number/IEM45GMCUYL6AQMNWT3WLIMLE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEM45GMCUYL6AQMNWT3WLIMLE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEM45GMCUYL6AQMNWT3WLIMLE6/action/storage_attestation","attest_author":"https://pith.science/pith/IEM45GMCUYL6AQMNWT3WLIMLE6/action/author_attestation","sign_citation":"https://pith.science/pith/IEM45GMCUYL6AQMNWT3WLIMLE6/action/citation_signature","submit_replication":"https://pith.science/pith/IEM45GMCUYL6AQMNWT3WLIMLE6/action/replication_record"}},"created_at":"2026-05-18T03:25:34.378910+00:00","updated_at":"2026-05-18T03:25:34.378910+00:00"}