{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IEECSWPDV2M6XYNMPNRJCQHFON","short_pith_number":"pith:IEECSWPD","canonical_record":{"source":{"id":"1207.5425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-07-23T15:34:39Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"1ed957536352ee39dc6b92ab3d43fcbf0424f579c798f2f07ab41f3e84ccaad0","abstract_canon_sha256":"bcc97c7edea6c8389dc38abdcf75e12a358411562dfd35dd2fef85de30a719e3"},"schema_version":"1.0"},"canonical_sha256":"41082959e3ae99ebe1ac7b629140e57357cfb5ffd50a44bf402f27d998dcb108","source":{"kind":"arxiv","id":"1207.5425","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5425","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5425v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5425","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"IEECSWPDV2M6","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IEECSWPDV2M6XYNM","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IEECSWPD","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IEECSWPDV2M6XYNMPNRJCQHFON","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-07-23T15:34:39Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"1ed957536352ee39dc6b92ab3d43fcbf0424f579c798f2f07ab41f3e84ccaad0","abstract_canon_sha256":"bcc97c7edea6c8389dc38abdcf75e12a358411562dfd35dd2fef85de30a719e3"},"schema_version":"1.0"},"canonical_sha256":"41082959e3ae99ebe1ac7b629140e57357cfb5ffd50a44bf402f27d998dcb108","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.082915Z","signature_b64":"GRg7nkiBr491JVwnvBRvZQAn2tLfCZr2tA7XliqQxEDsranEPIqQ61buJALCDiQ2Df+/G366QCaufo4BLY2/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41082959e3ae99ebe1ac7b629140e57357cfb5ffd50a44bf402f27d998dcb108","last_reissued_at":"2026-05-18T02:21:08.082443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.082443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5425","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:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUP9FGbjLQNTT5Y5/SkbHrE4d9Vz+b8YMyCO7VVjS00nPdrZ16e0gEofShM7km1cA3guk8tF3zG2bU/nQoETBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:04:25.789016Z"},"content_sha256":"9185c378f65994021579092800052832949fe4592dfad98aabf878b8fb2bb4c4","schema_version":"1.0","event_id":"sha256:9185c378f65994021579092800052832949fe4592dfad98aabf878b8fb2bb4c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IEECSWPDV2M6XYNMPNRJCQHFON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranked Document Retrieval in (Almost) No Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Ana Cerdeira-Pena, Gonzalo Navarro, Nieves R. Brisaboa, Oscar Pedreira","submitted_at":"2012-07-23T15:34:39Z","abstract_excerpt":"Ranked document retrieval is a fundamental task in search engines. Such queries are solved with inverted indexes that require additional 45%-80% of the compressed text space, and take tens to hundreds of microseconds per query. In this paper we show how ranked document retrieval queries can be solved within tens of milliseconds using essentially no extra space over an in-memory compressed representation of the document collection. More precisely, we enhance wavelet trees on bytecodes (WTBCs), a data structure that rearranges the bytes of the compressed collection, so that they support ranked c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5425","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:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACYyc7HJZPJLNM9Nn+WNYS/5md5WNQbV0S2d1S/2DS0j9WNnSqr+Q8UgSE41KeQooUOtew8BUEv3hUOZtwu5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:04:25.789745Z"},"content_sha256":"adcc21bd125de87552d11ae2a27add5176d920b069b2ca4acdbeb30102b581ee","schema_version":"1.0","event_id":"sha256:adcc21bd125de87552d11ae2a27add5176d920b069b2ca4acdbeb30102b581ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEECSWPDV2M6XYNMPNRJCQHFON/bundle.json","state_url":"https://pith.science/pith/IEECSWPDV2M6XYNMPNRJCQHFON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEECSWPDV2M6XYNMPNRJCQHFON/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-12T00:04:25Z","links":{"resolver":"https://pith.science/pith/IEECSWPDV2M6XYNMPNRJCQHFON","bundle":"https://pith.science/pith/IEECSWPDV2M6XYNMPNRJCQHFON/bundle.json","state":"https://pith.science/pith/IEECSWPDV2M6XYNMPNRJCQHFON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEECSWPDV2M6XYNMPNRJCQHFON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IEECSWPDV2M6XYNMPNRJCQHFON","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":"bcc97c7edea6c8389dc38abdcf75e12a358411562dfd35dd2fef85de30a719e3","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-07-23T15:34:39Z","title_canon_sha256":"1ed957536352ee39dc6b92ab3d43fcbf0424f579c798f2f07ab41f3e84ccaad0"},"schema_version":"1.0","source":{"id":"1207.5425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5425","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5425v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5425","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"IEECSWPDV2M6","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IEECSWPDV2M6XYNM","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IEECSWPD","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:adcc21bd125de87552d11ae2a27add5176d920b069b2ca4acdbeb30102b581ee","target":"graph","created_at":"2026-05-18T02:21:08Z","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":"Ranked document retrieval is a fundamental task in search engines. Such queries are solved with inverted indexes that require additional 45%-80% of the compressed text space, and take tens to hundreds of microseconds per query. In this paper we show how ranked document retrieval queries can be solved within tens of milliseconds using essentially no extra space over an in-memory compressed representation of the document collection. More precisely, we enhance wavelet trees on bytecodes (WTBCs), a data structure that rearranges the bytes of the compressed collection, so that they support ranked c","authors_text":"Ana Cerdeira-Pena, Gonzalo Navarro, Nieves R. Brisaboa, Oscar Pedreira","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-07-23T15:34:39Z","title":"Ranked Document Retrieval in (Almost) No Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5425","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:9185c378f65994021579092800052832949fe4592dfad98aabf878b8fb2bb4c4","target":"record","created_at":"2026-05-18T02:21:08Z","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":"bcc97c7edea6c8389dc38abdcf75e12a358411562dfd35dd2fef85de30a719e3","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-07-23T15:34:39Z","title_canon_sha256":"1ed957536352ee39dc6b92ab3d43fcbf0424f579c798f2f07ab41f3e84ccaad0"},"schema_version":"1.0","source":{"id":"1207.5425","kind":"arxiv","version":1}},"canonical_sha256":"41082959e3ae99ebe1ac7b629140e57357cfb5ffd50a44bf402f27d998dcb108","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41082959e3ae99ebe1ac7b629140e57357cfb5ffd50a44bf402f27d998dcb108","first_computed_at":"2026-05-18T02:21:08.082443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:08.082443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GRg7nkiBr491JVwnvBRvZQAn2tLfCZr2tA7XliqQxEDsranEPIqQ61buJALCDiQ2Df+/G366QCaufo4BLY2/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:08.082915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9185c378f65994021579092800052832949fe4592dfad98aabf878b8fb2bb4c4","sha256:adcc21bd125de87552d11ae2a27add5176d920b069b2ca4acdbeb30102b581ee"],"state_sha256":"ce5cb212feaf426c117aaf732e71019317806d4f1ed634774c97e041b6bf087a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"31OjMUnGn2As1rp099pWSh6F/KWmE/UHb379L6dCyaBCqlK+QecJCf8ownt2Lv+2fJtU8mHEWoS5NUSfwL17Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:04:25.794247Z","bundle_sha256":"605b87fcbb6357f2f247da51d5e339aa1b72b07f455d490c0f8d892c33f96056"}}