{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UWPNZJ7ZTP5GGX5CJTCOLUBSQ5","short_pith_number":"pith:UWPNZJ7Z","schema_version":"1.0","canonical_sha256":"a59edca7f99bfa635fa24cc4e5d032877e89d01fd5b8477c071bbe79a6c80453","source":{"kind":"arxiv","id":"1202.3208","version":1},"attestation_state":"computed","paper":{"title":"Linear-Space Substring Range Counting over Polylogarithmic Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pawe{\\l} Gawrychowski, Travis Gagie","submitted_at":"2012-02-15T05:29:25Z","abstract_excerpt":"Bille and G{\\o}rtz (2011) recently introduced the problem of substring range counting, for which we are asked to store compactly a string $S$ of $n$ characters with integer labels in ([0, u]), such that later, given an interval ([a, b]) and a pattern $P$ of length $m$, we can quickly count the occurrences of $P$ whose first characters' labels are in ([a, b]). They showed how to store $S$ in $\\Oh{n \\log n / \\log \\log n}$ space and answer queries in $\\Oh{m + \\log \\log u}$ time. We show that, if $S$ is over an alphabet of size (\\polylog (n)), then we can achieve optimal linear space. Moreover, if"},"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":"1202.3208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-15T05:29:25Z","cross_cats_sorted":[],"title_canon_sha256":"e07c5cc3e84e7c07ff22d5cfb57770bf213dfc874c3e2934a3efe62c3998417b","abstract_canon_sha256":"7d6f5652b3597a71a3219e3ecefc97d079a4a6d66c62b3e0b4b84fc5afd047f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:14.392806Z","signature_b64":"5z9LDoLQaKZT30gCz+tilTu0cAAaIV7CY6sQYohKfQejevCJKf6RaOHyenQIMAl9Rkpr8rS+/1PTZnz66DDIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a59edca7f99bfa635fa24cc4e5d032877e89d01fd5b8477c071bbe79a6c80453","last_reissued_at":"2026-05-18T04:02:14.392054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:14.392054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Space Substring Range Counting over Polylogarithmic Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pawe{\\l} Gawrychowski, Travis Gagie","submitted_at":"2012-02-15T05:29:25Z","abstract_excerpt":"Bille and G{\\o}rtz (2011) recently introduced the problem of substring range counting, for which we are asked to store compactly a string $S$ of $n$ characters with integer labels in ([0, u]), such that later, given an interval ([a, b]) and a pattern $P$ of length $m$, we can quickly count the occurrences of $P$ whose first characters' labels are in ([a, b]). They showed how to store $S$ in $\\Oh{n \\log n / \\log \\log n}$ space and answer queries in $\\Oh{m + \\log \\log u}$ time. We show that, if $S$ is over an alphabet of size (\\polylog (n)), then we can achieve optimal linear space. Moreover, if"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3208","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":"1202.3208","created_at":"2026-05-18T04:02:14.392192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3208v1","created_at":"2026-05-18T04:02:14.392192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3208","created_at":"2026-05-18T04:02:14.392192+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWPNZJ7ZTP5G","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWPNZJ7ZTP5GGX5C","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWPNZJ7Z","created_at":"2026-05-18T12:27:25.539911+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/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5","json":"https://pith.science/pith/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5.json","graph_json":"https://pith.science/api/pith-number/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5/graph.json","events_json":"https://pith.science/api/pith-number/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5/events.json","paper":"https://pith.science/paper/UWPNZJ7Z"},"agent_actions":{"view_html":"https://pith.science/pith/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5","download_json":"https://pith.science/pith/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5.json","view_paper":"https://pith.science/paper/UWPNZJ7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3208&json=true","fetch_graph":"https://pith.science/api/pith-number/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5/action/storage_attestation","attest_author":"https://pith.science/pith/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5/action/author_attestation","sign_citation":"https://pith.science/pith/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5/action/citation_signature","submit_replication":"https://pith.science/pith/UWPNZJ7ZTP5GGX5CJTCOLUBSQ5/action/replication_record"}},"created_at":"2026-05-18T04:02:14.392192+00:00","updated_at":"2026-05-18T04:02:14.392192+00:00"}