{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2ZD6GEPSTOVGMWS3JGDRDVMAKL","short_pith_number":"pith:2ZD6GEPS","canonical_record":{"source":{"id":"1108.1956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-08-09T15:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"f30676f0ae89b771023c4640a69d45b1f35b1cf3e6449b6d0a08f33536c910c6","abstract_canon_sha256":"56fd7f5b34a06ea5d53908ccac4e89ba46072475e4483311b3d4275fce980e91"},"schema_version":"1.0"},"canonical_sha256":"d647e311f29baa665a5b498711d58052c4defc1fbdc9ff74fe209235f63f3ef3","source":{"kind":"arxiv","id":"1108.1956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1956","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1956v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1956","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"2ZD6GEPSTOVG","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2ZD6GEPSTOVGMWS3","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2ZD6GEPS","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2ZD6GEPSTOVGMWS3JGDRDVMAKL","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-08-09T15:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"f30676f0ae89b771023c4640a69d45b1f35b1cf3e6449b6d0a08f33536c910c6","abstract_canon_sha256":"56fd7f5b34a06ea5d53908ccac4e89ba46072475e4483311b3d4275fce980e91"},"schema_version":"1.0"},"canonical_sha256":"d647e311f29baa665a5b498711d58052c4defc1fbdc9ff74fe209235f63f3ef3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.358023Z","signature_b64":"jGLR3W+7ryR5lqKO4t+vRXRElTpBNfETj3c3UYlh+hV5tDNK5XV3tB0oQZXMNJb43wPZk84vnEse4oR7T7VxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d647e311f29baa665a5b498711d58052c4defc1fbdc9ff74fe209235f63f3ef3","last_reissued_at":"2026-05-18T02:21:42.357579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.357579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1956","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:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0E6DQcnNWDiPnmeMmOGij9X4Xat76t5Xce7T1cicIowImj9uaRPOw8K+NgEgv9BQ/biUBoFlAQ0uObm74FzaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:51:30.412903Z"},"content_sha256":"fdbbc57e9356f7aeb01225ccb2321733c5d3c136540147ac0c2b876c9b0f1963","schema_version":"1.0","event_id":"sha256:fdbbc57e9356f7aeb01225ccb2321733c5d3c136540147ac0c2b876c9b0f1963"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2ZD6GEPSTOVGMWS3JGDRDVMAKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factorization-based Lossless Compression of Inverted Indices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"George Beskales, Marcus Fontoura, Maxim Gurevich, Sergei Vassilvitskii, Vanja Josifovski","submitted_at":"2011-08-09T15:25:17Z","abstract_excerpt":"Many large-scale Web applications that require ranked top-k retrieval such as Web search and online advertising are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non-zero elements indicate the strength of term-document association. In this work, we present an approach for lossless compression of inverted indices. Our approach maps terms in a document corpus to a new term space in order to reduce the number of non-zero elements in the term-document matrix, resulting in a more compact inverted index. We formulate the problem of selecting a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1956","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:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQGBuzieaRffZCK2OcnXVGsfePUpcleHNpgqiBlZtpb9S1Vsj8B5LsnrXJHcbgC2JXCMeVQ+h5Gnem6GpztnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:51:30.413254Z"},"content_sha256":"f8dbf9a12b1132a8642af1281bdf263debbfe98bbf0ae78d8308ae672e3d6a73","schema_version":"1.0","event_id":"sha256:f8dbf9a12b1132a8642af1281bdf263debbfe98bbf0ae78d8308ae672e3d6a73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZD6GEPSTOVGMWS3JGDRDVMAKL/bundle.json","state_url":"https://pith.science/pith/2ZD6GEPSTOVGMWS3JGDRDVMAKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZD6GEPSTOVGMWS3JGDRDVMAKL/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-11T10:51:30Z","links":{"resolver":"https://pith.science/pith/2ZD6GEPSTOVGMWS3JGDRDVMAKL","bundle":"https://pith.science/pith/2ZD6GEPSTOVGMWS3JGDRDVMAKL/bundle.json","state":"https://pith.science/pith/2ZD6GEPSTOVGMWS3JGDRDVMAKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZD6GEPSTOVGMWS3JGDRDVMAKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2ZD6GEPSTOVGMWS3JGDRDVMAKL","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":"56fd7f5b34a06ea5d53908ccac4e89ba46072475e4483311b3d4275fce980e91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-08-09T15:25:17Z","title_canon_sha256":"f30676f0ae89b771023c4640a69d45b1f35b1cf3e6449b6d0a08f33536c910c6"},"schema_version":"1.0","source":{"id":"1108.1956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1956","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1956v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1956","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"2ZD6GEPSTOVG","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2ZD6GEPSTOVGMWS3","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2ZD6GEPS","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:f8dbf9a12b1132a8642af1281bdf263debbfe98bbf0ae78d8308ae672e3d6a73","target":"graph","created_at":"2026-05-18T02:21:42Z","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":"Many large-scale Web applications that require ranked top-k retrieval such as Web search and online advertising are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non-zero elements indicate the strength of term-document association. In this work, we present an approach for lossless compression of inverted indices. Our approach maps terms in a document corpus to a new term space in order to reduce the number of non-zero elements in the term-document matrix, resulting in a more compact inverted index. We formulate the problem of selecting a ","authors_text":"George Beskales, Marcus Fontoura, Maxim Gurevich, Sergei Vassilvitskii, Vanja Josifovski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-08-09T15:25:17Z","title":"Factorization-based Lossless Compression of Inverted Indices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1956","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:fdbbc57e9356f7aeb01225ccb2321733c5d3c136540147ac0c2b876c9b0f1963","target":"record","created_at":"2026-05-18T02:21:42Z","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":"56fd7f5b34a06ea5d53908ccac4e89ba46072475e4483311b3d4275fce980e91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-08-09T15:25:17Z","title_canon_sha256":"f30676f0ae89b771023c4640a69d45b1f35b1cf3e6449b6d0a08f33536c910c6"},"schema_version":"1.0","source":{"id":"1108.1956","kind":"arxiv","version":1}},"canonical_sha256":"d647e311f29baa665a5b498711d58052c4defc1fbdc9ff74fe209235f63f3ef3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d647e311f29baa665a5b498711d58052c4defc1fbdc9ff74fe209235f63f3ef3","first_computed_at":"2026-05-18T02:21:42.357579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:42.357579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jGLR3W+7ryR5lqKO4t+vRXRElTpBNfETj3c3UYlh+hV5tDNK5XV3tB0oQZXMNJb43wPZk84vnEse4oR7T7VxAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:42.358023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdbbc57e9356f7aeb01225ccb2321733c5d3c136540147ac0c2b876c9b0f1963","sha256:f8dbf9a12b1132a8642af1281bdf263debbfe98bbf0ae78d8308ae672e3d6a73"],"state_sha256":"7587fe81edf7009f8655a8cdea2dbd683c27ad8a5e97c35fdd3f40f1fcac25f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQM8j9Xfns0TO/P+EWKG67ALvraL3Ds3Nj9wCK2LfIFA4H+LTe+7k6OFNrQl1yCVeNnCTpLwxDOQrbmzAn3RCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:51:30.415469Z","bundle_sha256":"7c1ffe20d777fd2dfe80da5e4d007d29a3b7272d2a07be21af2faf330f20c4c1"}}