{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UQ3AR4VYSMZSUJUMDSOMVM6DJY","short_pith_number":"pith:UQ3AR4VY","canonical_record":{"source":{"id":"1106.2587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-14T00:53:40Z","cross_cats_sorted":["cs.DB","cs.IR"],"title_canon_sha256":"58973ae6b57c29668d36c9b5c02910e00360cb0b6fda28fc343e4b38432679fc","abstract_canon_sha256":"7001800f2260afcc6a37e6bd8966d2f61fefb37082667eb348aa6253076e66a0"},"schema_version":"1.0"},"canonical_sha256":"a43608f2b893332a268c1c9ccab3c34e17f0b7a3b73b99a56feeb6f021a9bde6","source":{"kind":"arxiv","id":"1106.2587","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2587","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2587v2","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2587","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"UQ3AR4VYSMZS","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UQ3AR4VYSMZSUJUM","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UQ3AR4VY","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UQ3AR4VYSMZSUJUMDSOMVM6DJY","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-14T00:53:40Z","cross_cats_sorted":["cs.DB","cs.IR"],"title_canon_sha256":"58973ae6b57c29668d36c9b5c02910e00360cb0b6fda28fc343e4b38432679fc","abstract_canon_sha256":"7001800f2260afcc6a37e6bd8966d2f61fefb37082667eb348aa6253076e66a0"},"schema_version":"1.0"},"canonical_sha256":"a43608f2b893332a268c1c9ccab3c34e17f0b7a3b73b99a56feeb6f021a9bde6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:43.955473Z","signature_b64":"bnxNYSjLfj5YOVVoiqn9cW4v/Z2ddxvWROpiU7JD3Dt2E0aGGNQ+p61GLY5KLsQHsCEJGhMKfMTOmdyCVfxvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a43608f2b893332a268c1c9ccab3c34e17f0b7a3b73b99a56feeb6f021a9bde6","last_reissued_at":"2026-05-18T02:21:43.955048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:43.955048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2587","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-18T02:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HsA8NGQ9RUIU4kuc9CiDMd4I0aOvDPEpUP94dTKikRBeCFtEXkizHT+f3FJBbEo8XStRgairiE5wsq/h/584Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T04:59:40.593592Z"},"content_sha256":"289ba69e4d1da37ef2173a24f5654fa6412dc4e20ba5d6fa10dbd5a2f216a387","schema_version":"1.0","event_id":"sha256:289ba69e4d1da37ef2173a24f5654fa6412dc4e20ba5d6fa10dbd5a2f216a387"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UQ3AR4VYSMZSUJUMDSOMVM6DJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relative Lempel-Ziv Factorization for Efficient Storage and Retrieval of Web Collections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IR"],"primary_cat":"cs.DS","authors_text":"Christopher Hoobin, Justin Zobel, Simon J. Puglisi","submitted_at":"2011-06-14T00:53:40Z","abstract_excerpt":"Compression techniques that support fast random access are a core component of any information system. Current state-of-the-art methods group documents into fixed-sized blocks and compress each block with a general-purpose adaptive algorithm such as GZIP. Random access to a specific document then requires decompression of a block. The choice of block size is critical: it trades between compression effectiveness and document retrieval times. In this paper we present a scalable compression method for large document collections that allows fast random access. We build a representative sample of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2587","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-18T02:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnYIuwPx0liGOnHuW2mfP8sra81viD628YXMOPgIcr97a4qM3loBxFSJGwS4U2bV/j0Y2AoIwYOx+bXBeKRFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T04:59:40.593957Z"},"content_sha256":"e051424c3dd7db4e250cf8f530acfe18bc3e9bc2bbee5b2d9315249fa5e120d2","schema_version":"1.0","event_id":"sha256:e051424c3dd7db4e250cf8f530acfe18bc3e9bc2bbee5b2d9315249fa5e120d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQ3AR4VYSMZSUJUMDSOMVM6DJY/bundle.json","state_url":"https://pith.science/pith/UQ3AR4VYSMZSUJUMDSOMVM6DJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQ3AR4VYSMZSUJUMDSOMVM6DJY/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-07-08T04:59:40Z","links":{"resolver":"https://pith.science/pith/UQ3AR4VYSMZSUJUMDSOMVM6DJY","bundle":"https://pith.science/pith/UQ3AR4VYSMZSUJUMDSOMVM6DJY/bundle.json","state":"https://pith.science/pith/UQ3AR4VYSMZSUJUMDSOMVM6DJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQ3AR4VYSMZSUJUMDSOMVM6DJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UQ3AR4VYSMZSUJUMDSOMVM6DJY","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":"7001800f2260afcc6a37e6bd8966d2f61fefb37082667eb348aa6253076e66a0","cross_cats_sorted":["cs.DB","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-14T00:53:40Z","title_canon_sha256":"58973ae6b57c29668d36c9b5c02910e00360cb0b6fda28fc343e4b38432679fc"},"schema_version":"1.0","source":{"id":"1106.2587","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2587","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2587v2","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2587","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"UQ3AR4VYSMZS","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UQ3AR4VYSMZSUJUM","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UQ3AR4VY","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:e051424c3dd7db4e250cf8f530acfe18bc3e9bc2bbee5b2d9315249fa5e120d2","target":"graph","created_at":"2026-05-18T02:21:43Z","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":"Compression techniques that support fast random access are a core component of any information system. Current state-of-the-art methods group documents into fixed-sized blocks and compress each block with a general-purpose adaptive algorithm such as GZIP. Random access to a specific document then requires decompression of a block. The choice of block size is critical: it trades between compression effectiveness and document retrieval times. In this paper we present a scalable compression method for large document collections that allows fast random access. We build a representative sample of t","authors_text":"Christopher Hoobin, Justin Zobel, Simon J. Puglisi","cross_cats":["cs.DB","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-14T00:53:40Z","title":"Relative Lempel-Ziv Factorization for Efficient Storage and Retrieval of Web Collections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2587","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:289ba69e4d1da37ef2173a24f5654fa6412dc4e20ba5d6fa10dbd5a2f216a387","target":"record","created_at":"2026-05-18T02:21:43Z","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":"7001800f2260afcc6a37e6bd8966d2f61fefb37082667eb348aa6253076e66a0","cross_cats_sorted":["cs.DB","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-14T00:53:40Z","title_canon_sha256":"58973ae6b57c29668d36c9b5c02910e00360cb0b6fda28fc343e4b38432679fc"},"schema_version":"1.0","source":{"id":"1106.2587","kind":"arxiv","version":2}},"canonical_sha256":"a43608f2b893332a268c1c9ccab3c34e17f0b7a3b73b99a56feeb6f021a9bde6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a43608f2b893332a268c1c9ccab3c34e17f0b7a3b73b99a56feeb6f021a9bde6","first_computed_at":"2026-05-18T02:21:43.955048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:43.955048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bnxNYSjLfj5YOVVoiqn9cW4v/Z2ddxvWROpiU7JD3Dt2E0aGGNQ+p61GLY5KLsQHsCEJGhMKfMTOmdyCVfxvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:43.955473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2587","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:289ba69e4d1da37ef2173a24f5654fa6412dc4e20ba5d6fa10dbd5a2f216a387","sha256:e051424c3dd7db4e250cf8f530acfe18bc3e9bc2bbee5b2d9315249fa5e120d2"],"state_sha256":"4830b097285ed94ae68846a4825c8cf507300e8df1196fca9e326690feaa0e05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SoyMYhLL9pOmZ+3XfFX/p++kYrAGV2UXEdUXwNd+rrxMDRwqavJoyYcJrFg1Fii+12Bns0ANiG1YyjVHC8WfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T04:59:40.595846Z","bundle_sha256":"386f8e7f03609a9b8615a77dc34bf40f2db0a1d7a3eb8a5c53e20f994997a5ea"}}