{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EQ5BKTO2PMHAHSMFFBMJFO4DNB","short_pith_number":"pith:EQ5BKTO2","canonical_record":{"source":{"id":"1406.3170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-12T09:47:09Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"3ce6b23fbc7c9a39c6652a564001ade1b77f7e4dd7dbb0f9b746556c88f5e1fc","abstract_canon_sha256":"3ab90cf208eaa0f2ff66f630343cb335a2344b8898896264efabb1db25917579"},"schema_version":"1.0"},"canonical_sha256":"243a154dda7b0e03c985285892bb8368671835b6d4e3e0a6d6e0891cf382c51f","source":{"kind":"arxiv","id":"1406.3170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3170","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3170v1","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3170","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"EQ5BKTO2PMHA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EQ5BKTO2PMHAHSMF","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EQ5BKTO2","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EQ5BKTO2PMHAHSMFFBMJFO4DNB","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-12T09:47:09Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"3ce6b23fbc7c9a39c6652a564001ade1b77f7e4dd7dbb0f9b746556c88f5e1fc","abstract_canon_sha256":"3ab90cf208eaa0f2ff66f630343cb335a2344b8898896264efabb1db25917579"},"schema_version":"1.0"},"canonical_sha256":"243a154dda7b0e03c985285892bb8368671835b6d4e3e0a6d6e0891cf382c51f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:52.885585Z","signature_b64":"mCC6GmfVk+IaQyhsklwE34t6hUWor+NvLpFxueMVXKWaMEM2WGKgkXmE+m2bZc6ruj6Ntc/Ik6QLZde+hoDEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"243a154dda7b0e03c985285892bb8368671835b6d4e3e0a6d6e0891cf382c51f","last_reissued_at":"2026-05-18T02:49:52.885006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:52.885006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3170","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-18T02:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FiGQKm8PUlHR/udgficZtfPYyswRZXNtTnXEz20rWyqlBY6H4Hw6nCpNz4CIsJpiPwozdp92rSFPo2WZvlFUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T04:56:57.873457Z"},"content_sha256":"728b24d4773b3ce133d3532a45d4581a8ae47171637ee1427ca5b3e820ef3e15","schema_version":"1.0","event_id":"sha256:728b24d4773b3ce133d3532a45d4581a8ae47171637ee1427ca5b3e820ef3e15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EQ5BKTO2PMHAHSMFFBMJFO4DNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact Indexes for Flexible Top-k Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Matthias Petri, Simon Gog","submitted_at":"2014-06-12T09:47:09Z","abstract_excerpt":"We engineer a self-index based retrieval system capable of rank-safe evaluation of top-k queries. The framework generalizes the GREEDY approach of Culpepper et al. (ESA 2010) to handle multi-term queries, including over phrases. We propose two techniques which significantly reduce the ranking time for a wide range of popular Information Retrieval (IR) relevance measures, such as TFxIDF and BM25. First, we reorder elements in the document array according to document weight. Second, we introduce the repetition array, which generalizes Sadakane's (JDA 2007) document frequency structure to documen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3170","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-18T02:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"28LLt6nEduYLm3hv+f2fUrc4WaL2XIny+0Eqofs2sgdBElevzyPExueRgCOCRuWot2SPX/ewu6nkeCkWUB3uBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T04:56:57.873799Z"},"content_sha256":"51574a7e942b13042c7e1a457c153d193d8d6dd8214ac558ec85362488e4e179","schema_version":"1.0","event_id":"sha256:51574a7e942b13042c7e1a457c153d193d8d6dd8214ac558ec85362488e4e179"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQ5BKTO2PMHAHSMFFBMJFO4DNB/bundle.json","state_url":"https://pith.science/pith/EQ5BKTO2PMHAHSMFFBMJFO4DNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQ5BKTO2PMHAHSMFFBMJFO4DNB/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-21T04:56:57Z","links":{"resolver":"https://pith.science/pith/EQ5BKTO2PMHAHSMFFBMJFO4DNB","bundle":"https://pith.science/pith/EQ5BKTO2PMHAHSMFFBMJFO4DNB/bundle.json","state":"https://pith.science/pith/EQ5BKTO2PMHAHSMFFBMJFO4DNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQ5BKTO2PMHAHSMFFBMJFO4DNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EQ5BKTO2PMHAHSMFFBMJFO4DNB","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":"3ab90cf208eaa0f2ff66f630343cb335a2344b8898896264efabb1db25917579","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-12T09:47:09Z","title_canon_sha256":"3ce6b23fbc7c9a39c6652a564001ade1b77f7e4dd7dbb0f9b746556c88f5e1fc"},"schema_version":"1.0","source":{"id":"1406.3170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3170","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3170v1","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3170","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"EQ5BKTO2PMHA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EQ5BKTO2PMHAHSMF","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EQ5BKTO2","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:51574a7e942b13042c7e1a457c153d193d8d6dd8214ac558ec85362488e4e179","target":"graph","created_at":"2026-05-18T02:49:52Z","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":"We engineer a self-index based retrieval system capable of rank-safe evaluation of top-k queries. The framework generalizes the GREEDY approach of Culpepper et al. (ESA 2010) to handle multi-term queries, including over phrases. We propose two techniques which significantly reduce the ranking time for a wide range of popular Information Retrieval (IR) relevance measures, such as TFxIDF and BM25. First, we reorder elements in the document array according to document weight. Second, we introduce the repetition array, which generalizes Sadakane's (JDA 2007) document frequency structure to documen","authors_text":"Matthias Petri, Simon Gog","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-12T09:47:09Z","title":"Compact Indexes for Flexible Top-k Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3170","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:728b24d4773b3ce133d3532a45d4581a8ae47171637ee1427ca5b3e820ef3e15","target":"record","created_at":"2026-05-18T02:49:52Z","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":"3ab90cf208eaa0f2ff66f630343cb335a2344b8898896264efabb1db25917579","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-12T09:47:09Z","title_canon_sha256":"3ce6b23fbc7c9a39c6652a564001ade1b77f7e4dd7dbb0f9b746556c88f5e1fc"},"schema_version":"1.0","source":{"id":"1406.3170","kind":"arxiv","version":1}},"canonical_sha256":"243a154dda7b0e03c985285892bb8368671835b6d4e3e0a6d6e0891cf382c51f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"243a154dda7b0e03c985285892bb8368671835b6d4e3e0a6d6e0891cf382c51f","first_computed_at":"2026-05-18T02:49:52.885006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:52.885006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mCC6GmfVk+IaQyhsklwE34t6hUWor+NvLpFxueMVXKWaMEM2WGKgkXmE+m2bZc6ruj6Ntc/Ik6QLZde+hoDEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:52.885585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:728b24d4773b3ce133d3532a45d4581a8ae47171637ee1427ca5b3e820ef3e15","sha256:51574a7e942b13042c7e1a457c153d193d8d6dd8214ac558ec85362488e4e179"],"state_sha256":"1def090dd23faad1b9739689b660579c9625b9b240211eaca5c8e24f290dc7fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rK8URJus8N/MfjdR3J0T093ETcg2xcTaZwQOpq3vaAMeKGmtMdm/haldxW2BffundjmwWaqwu9h5ucPF2ByfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T04:56:57.875746Z","bundle_sha256":"03cdee3175e0b72f1cb4c56745460046864d2f44b27b8e1c96030f0ea612c7c3"}}