{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Y5IIPTPPGOWLFY5E72HVLLPEHT","short_pith_number":"pith:Y5IIPTPP","canonical_record":{"source":{"id":"1207.2632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T13:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"5b7d8794a12c295d00a68e1add9c09b09ef90f90b07ea4946925965b03e4e3f5","abstract_canon_sha256":"72b9982d893ae492871a52e332fff0e18492e6d3d61c5f162c0597f1a5d7c2ce"},"schema_version":"1.0"},"canonical_sha256":"c75087cdef33acb2e3a4fe8f55ade43cfa1f22d37eabdeac01f351fdcb5c0094","source":{"kind":"arxiv","id":"1207.2632","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2632","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2632v2","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2632","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"Y5IIPTPPGOWL","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y5IIPTPPGOWLFY5E","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y5IIPTPP","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Y5IIPTPPGOWLFY5E72HVLLPEHT","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T13:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"5b7d8794a12c295d00a68e1add9c09b09ef90f90b07ea4946925965b03e4e3f5","abstract_canon_sha256":"72b9982d893ae492871a52e332fff0e18492e6d3d61c5f162c0597f1a5d7c2ce"},"schema_version":"1.0"},"canonical_sha256":"c75087cdef33acb2e3a4fe8f55ade43cfa1f22d37eabdeac01f351fdcb5c0094","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:36.071594Z","signature_b64":"bQfXBBQivniBbKLGPgp8cA+8ZZecbclb2OBLg3iutvxr/CeA65LJECv14N2Cj6fm/j7sYjMJOyzjo1N9DJmrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c75087cdef33acb2e3a4fe8f55ade43cfa1f22d37eabdeac01f351fdcb5c0094","last_reissued_at":"2026-05-18T03:40:36.070718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:36.070718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2632","source_version":2,"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:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TJOdoTw088e9Tb94sgZAb6Ec5G1ZGvnMt8DhP+LfasBM0IYFXePhbpFPECF8eNAlQJR01V3gaILf40611BwGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:46:00.644330Z"},"content_sha256":"464e79b2451f7d8453061d9884c9fbcddd683a538502aa75ef98ea1fa7412fec","schema_version":"1.0","event_id":"sha256:464e79b2451f7d8453061d9884c9fbcddd683a538502aa75ef98ea1fa7412fec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Y5IIPTPPGOWLFY5E72HVLLPEHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimal Top-K String Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cheng Sheng, Jeffrey Scott Vitter, Rahul Shah, Sharma V. Thankachan","submitted_at":"2012-07-11T13:30:06Z","abstract_excerpt":"Let ${\\cal{D}}$ = $\\{d_1, d_2, d_3, ..., d_D\\}$ be a given set of $D$ (string) documents of total length $n$. The top-$k$ document retrieval problem is to index $\\cal{D}$ such that when a pattern $P$ of length $p$, and a parameter $k$ come as a query, the index returns the $k$ most relevant documents to the pattern $P$. Hon et. al. \\cite{HSV09} gave the first linear space framework to solve this problem in $O(p + k\\log k)$ time. This was improved by Navarro and Nekrich \\cite{NN12} to $O(p + k)$. These results are powerful enough to support arbitrary relevance functions like frequency, proximit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2632","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"},"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:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSW7EuBxuOM2l12a7x9zoTVB1AUpEJfhDqz8X3lLTQj4l6WrD0EEO9pwCSNlajQYkOn5NOGloX9s279bK5qCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:46:00.644756Z"},"content_sha256":"7650d1f49556e8fcf6a139b131b71d0e8cd64459b62a8671f895d1d45f5873bc","schema_version":"1.0","event_id":"sha256:7650d1f49556e8fcf6a139b131b71d0e8cd64459b62a8671f895d1d45f5873bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5IIPTPPGOWLFY5E72HVLLPEHT/bundle.json","state_url":"https://pith.science/pith/Y5IIPTPPGOWLFY5E72HVLLPEHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5IIPTPPGOWLFY5E72HVLLPEHT/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-05T20:46:00Z","links":{"resolver":"https://pith.science/pith/Y5IIPTPPGOWLFY5E72HVLLPEHT","bundle":"https://pith.science/pith/Y5IIPTPPGOWLFY5E72HVLLPEHT/bundle.json","state":"https://pith.science/pith/Y5IIPTPPGOWLFY5E72HVLLPEHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5IIPTPPGOWLFY5E72HVLLPEHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Y5IIPTPPGOWLFY5E72HVLLPEHT","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":"72b9982d893ae492871a52e332fff0e18492e6d3d61c5f162c0597f1a5d7c2ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T13:30:06Z","title_canon_sha256":"5b7d8794a12c295d00a68e1add9c09b09ef90f90b07ea4946925965b03e4e3f5"},"schema_version":"1.0","source":{"id":"1207.2632","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2632","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2632v2","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2632","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"Y5IIPTPPGOWL","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y5IIPTPPGOWLFY5E","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y5IIPTPP","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:7650d1f49556e8fcf6a139b131b71d0e8cd64459b62a8671f895d1d45f5873bc","target":"graph","created_at":"2026-05-18T03:40:36Z","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":"Let ${\\cal{D}}$ = $\\{d_1, d_2, d_3, ..., d_D\\}$ be a given set of $D$ (string) documents of total length $n$. The top-$k$ document retrieval problem is to index $\\cal{D}$ such that when a pattern $P$ of length $p$, and a parameter $k$ come as a query, the index returns the $k$ most relevant documents to the pattern $P$. Hon et. al. \\cite{HSV09} gave the first linear space framework to solve this problem in $O(p + k\\log k)$ time. This was improved by Navarro and Nekrich \\cite{NN12} to $O(p + k)$. These results are powerful enough to support arbitrary relevance functions like frequency, proximit","authors_text":"Cheng Sheng, Jeffrey Scott Vitter, Rahul Shah, Sharma V. Thankachan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T13:30:06Z","title":"On Optimal Top-K String Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2632","kind":"arxiv","version":2},"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:464e79b2451f7d8453061d9884c9fbcddd683a538502aa75ef98ea1fa7412fec","target":"record","created_at":"2026-05-18T03:40:36Z","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":"72b9982d893ae492871a52e332fff0e18492e6d3d61c5f162c0597f1a5d7c2ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T13:30:06Z","title_canon_sha256":"5b7d8794a12c295d00a68e1add9c09b09ef90f90b07ea4946925965b03e4e3f5"},"schema_version":"1.0","source":{"id":"1207.2632","kind":"arxiv","version":2}},"canonical_sha256":"c75087cdef33acb2e3a4fe8f55ade43cfa1f22d37eabdeac01f351fdcb5c0094","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c75087cdef33acb2e3a4fe8f55ade43cfa1f22d37eabdeac01f351fdcb5c0094","first_computed_at":"2026-05-18T03:40:36.070718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:36.070718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bQfXBBQivniBbKLGPgp8cA+8ZZecbclb2OBLg3iutvxr/CeA65LJECv14N2Cj6fm/j7sYjMJOyzjo1N9DJmrCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:36.071594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2632","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:464e79b2451f7d8453061d9884c9fbcddd683a538502aa75ef98ea1fa7412fec","sha256:7650d1f49556e8fcf6a139b131b71d0e8cd64459b62a8671f895d1d45f5873bc"],"state_sha256":"4b7956587ac55133ab3fd002f2af0d15c762e4a87160facd0c9b14a47fed03a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+9TMvNQZ7oHwwXneJEIWVE5MCXH3AfRhKynYAD5CPpRcBPi5yMmFA/mU1JckZUXJgSUDPES/HMfp2m1DazxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:46:00.647855Z","bundle_sha256":"1a8b5269a383a6e0776eb840a5e9bb9611efe6d7f1f18bb31719fddd2c178cb5"}}