{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GF76SKPYBG4OIUNARZHBRSVPM2","short_pith_number":"pith:GF76SKPY","canonical_record":{"source":{"id":"1211.5353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-22T18:58:27Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"3d175048018114b24f1392c91c88161a99487395af337a329dfa4d9cf228a56d","abstract_canon_sha256":"259314d3c8e5732f4e4003512752bb3433cde3d4d0da152bf6f5bccd9b285557"},"schema_version":"1.0"},"canonical_sha256":"317fe929f809b8e451a08e4e18caaf66a8eb170ab0e809d26cb66bfb42b75d08","source":{"kind":"arxiv","id":"1211.5353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5353","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5353v1","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5353","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"GF76SKPYBG4O","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GF76SKPYBG4OIUNA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GF76SKPY","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GF76SKPYBG4OIUNARZHBRSVPM2","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-22T18:58:27Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"3d175048018114b24f1392c91c88161a99487395af337a329dfa4d9cf228a56d","abstract_canon_sha256":"259314d3c8e5732f4e4003512752bb3433cde3d4d0da152bf6f5bccd9b285557"},"schema_version":"1.0"},"canonical_sha256":"317fe929f809b8e451a08e4e18caaf66a8eb170ab0e809d26cb66bfb42b75d08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:04.599498Z","signature_b64":"JT33K7ntMwa5xrVwzajdrw7dlkfmvNijnDWdW7odnoCuq+7JNn69IXCRSV/wdlZn/Syj3AQWyrVQTozhQ+zcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"317fe929f809b8e451a08e4e18caaf66a8eb170ab0e809d26cb66bfb42b75d08","last_reissued_at":"2026-05-18T03:40:04.598729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:04.598729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5353","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuzYq3zwY+wcR6t8CKjYfIU2bbYyxMdB375kpuXhpjj0zCqajCD2920+/OIhC/3zb+h5PXYKZ3bvY9F/3uzsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:03:36.180965Z"},"content_sha256":"6535c7132bdd073a8ff9e08e6cbb1cc9df53829676e8bd0feed3012efaf0d4d4","schema_version":"1.0","event_id":"sha256:6535c7132bdd073a8ff9e08e6cbb1cc9df53829676e8bd0feed3012efaf0d4d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GF76SKPYBG4OIUNARZHBRSVPM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Compact Top-k Document Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Roberto Konow","submitted_at":"2012-11-22T18:58:27Z","abstract_excerpt":"An optimal index solving top-k document retrieval [Navarro and Nekrich, SODA12] takes O(m + k) time for a pattern of length m, but its space is at least 80n bytes for a collection of n symbols. We reduce it to 1.5n to 3n bytes, with O(m+(k+log log n) log log n) time, on typical texts. The index is up to 25 times faster than the best previous compressed solutions, and requires at most 5% more space in practice (and in some cases as little as one half). Apart from replacing classical by compressed data structures, our main idea is to replace suffix tree sampling by frequency thresholding to achi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5353","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGHWN2BH1AidmUmw08+9L5TwDJcfc4hjxLsUK6ixGgYtRHZk60+R9rmwVPGFQ8Li7PUDuL0Ld94/wUOHBDD4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:03:36.181308Z"},"content_sha256":"7bb6b861339445b1431f14f82d85f3d3cbb5e2b7a3066c2b0093e42841d9aa36","schema_version":"1.0","event_id":"sha256:7bb6b861339445b1431f14f82d85f3d3cbb5e2b7a3066c2b0093e42841d9aa36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GF76SKPYBG4OIUNARZHBRSVPM2/bundle.json","state_url":"https://pith.science/pith/GF76SKPYBG4OIUNARZHBRSVPM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GF76SKPYBG4OIUNARZHBRSVPM2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T10:03:36Z","links":{"resolver":"https://pith.science/pith/GF76SKPYBG4OIUNARZHBRSVPM2","bundle":"https://pith.science/pith/GF76SKPYBG4OIUNARZHBRSVPM2/bundle.json","state":"https://pith.science/pith/GF76SKPYBG4OIUNARZHBRSVPM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GF76SKPYBG4OIUNARZHBRSVPM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GF76SKPYBG4OIUNARZHBRSVPM2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"259314d3c8e5732f4e4003512752bb3433cde3d4d0da152bf6f5bccd9b285557","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-22T18:58:27Z","title_canon_sha256":"3d175048018114b24f1392c91c88161a99487395af337a329dfa4d9cf228a56d"},"schema_version":"1.0","source":{"id":"1211.5353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5353","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5353v1","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5353","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"GF76SKPYBG4O","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GF76SKPYBG4OIUNA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GF76SKPY","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:7bb6b861339445b1431f14f82d85f3d3cbb5e2b7a3066c2b0093e42841d9aa36","target":"graph","created_at":"2026-05-18T03:40:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An optimal index solving top-k document retrieval [Navarro and Nekrich, SODA12] takes O(m + k) time for a pattern of length m, but its space is at least 80n bytes for a collection of n symbols. We reduce it to 1.5n to 3n bytes, with O(m+(k+log log n) log log n) time, on typical texts. The index is up to 25 times faster than the best previous compressed solutions, and requires at most 5% more space in practice (and in some cases as little as one half). Apart from replacing classical by compressed data structures, our main idea is to replace suffix tree sampling by frequency thresholding to achi","authors_text":"Gonzalo Navarro, Roberto Konow","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-22T18:58:27Z","title":"Faster Compact Top-k Document Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5353","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6535c7132bdd073a8ff9e08e6cbb1cc9df53829676e8bd0feed3012efaf0d4d4","target":"record","created_at":"2026-05-18T03:40:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"259314d3c8e5732f4e4003512752bb3433cde3d4d0da152bf6f5bccd9b285557","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-22T18:58:27Z","title_canon_sha256":"3d175048018114b24f1392c91c88161a99487395af337a329dfa4d9cf228a56d"},"schema_version":"1.0","source":{"id":"1211.5353","kind":"arxiv","version":1}},"canonical_sha256":"317fe929f809b8e451a08e4e18caaf66a8eb170ab0e809d26cb66bfb42b75d08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"317fe929f809b8e451a08e4e18caaf66a8eb170ab0e809d26cb66bfb42b75d08","first_computed_at":"2026-05-18T03:40:04.598729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:04.598729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JT33K7ntMwa5xrVwzajdrw7dlkfmvNijnDWdW7odnoCuq+7JNn69IXCRSV/wdlZn/Syj3AQWyrVQTozhQ+zcBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:04.599498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6535c7132bdd073a8ff9e08e6cbb1cc9df53829676e8bd0feed3012efaf0d4d4","sha256:7bb6b861339445b1431f14f82d85f3d3cbb5e2b7a3066c2b0093e42841d9aa36"],"state_sha256":"db682b82df647c808c6db9f3342fd8a663a048c2aac9e52c07b20ae48c123be0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AKnvQnDhpbdVn6nxRII1OJEgZsCAyvhFVzSYTi3lFgYr3yVsft7S7qf8y6VfwMICfZkxkAFPYmEsoDoBR3HAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:03:36.183264Z","bundle_sha256":"911106b3aff53033d077f0233dbf8a631fe8f775310354d1b082285ba5961bce"}}