{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ERS6YJL22AMVMOIO666V3TN4NL","short_pith_number":"pith:ERS6YJL2","canonical_record":{"source":{"id":"1006.0809","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-04T08:41:22Z","cross_cats_sorted":[],"title_canon_sha256":"b07e18e7f48a231ba538f1cd1fa360491b1ec5f63858da56636dd9eacd8e55bb","abstract_canon_sha256":"61dd3c6f04d7b98969d1a447e0ed12aff5a3f5251a28f50ae183540338046fee"},"schema_version":"1.0"},"canonical_sha256":"2465ec257ad01956390ef7bd5dcdbc6ad67f789e978b8810a8ca1f5e1e231617","source":{"kind":"arxiv","id":"1006.0809","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0809","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0809v2","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0809","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"ERS6YJL22AMV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"ERS6YJL22AMVMOIO","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"ERS6YJL2","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ERS6YJL22AMVMOIO666V3TN4NL","target":"record","payload":{"canonical_record":{"source":{"id":"1006.0809","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-04T08:41:22Z","cross_cats_sorted":[],"title_canon_sha256":"b07e18e7f48a231ba538f1cd1fa360491b1ec5f63858da56636dd9eacd8e55bb","abstract_canon_sha256":"61dd3c6f04d7b98969d1a447e0ed12aff5a3f5251a28f50ae183540338046fee"},"schema_version":"1.0"},"canonical_sha256":"2465ec257ad01956390ef7bd5dcdbc6ad67f789e978b8810a8ca1f5e1e231617","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:05.969700Z","signature_b64":"z41HfXoRd2wGKizirEIM9c3cWP2Mrg3pme4MnATgzoSbI+l/F4iE3UzXStLHT6tBdhcIEMqCpupbVnXu5c61Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2465ec257ad01956390ef7bd5dcdbc6ad67f789e978b8810a8ca1f5e1e231617","last_reissued_at":"2026-05-18T04:14:05.969067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:05.969067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.0809","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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fx51wC1jp767lIB9KkE1ce5gyvzRvPvKsUmSjsWuydFEOKML3Hh/YiTZMDpBerKVEzAAS44/lzl0R3pQNT/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:48:31.717296Z"},"content_sha256":"507fd74cb1cf10b7a2ee8b1ee051ab9d75bb643a3ca39bfbc9703582dcaa4ed7","schema_version":"1.0","event_id":"sha256:507fd74cb1cf10b7a2ee8b1ee051ab9d75bb643a3ca39bfbc9703582dcaa4ed7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ERS6YJL22AMVMOIO666V3TN4NL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight and simple Web graph compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Szymon Grabowski, Wojciech Bieniecki","submitted_at":"2010-06-04T08:41:22Z","abstract_excerpt":"Analysing Web graphs has applications in determining page ranks, fighting Web spam, detecting communities and mirror sites, and more. This study is however hampered by the necessity of storing a major part of huge graphs in the external memory, which prevents efficient random access to edge (hyperlink) lists. A number of algorithms involving compression techniques have thus been presented, to represent Web graphs succinctly but also providing random access. Those techniques are usually based on differential encodings of the adjacency lists, finding repeating nodes or node regions in the succes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0809","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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhCJDRDKanhIfeqTDe3nKJ2Orr8+3ZhPS5sv0N2x0zMXsx/C1seoRkqJfbU9do4U2vYDrHIXGRXl+HsLoc3xAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:48:31.717671Z"},"content_sha256":"47acce3f561ecd7fff20ce123f59eb07d8d019d655ac9a1c81013ace19359c2b","schema_version":"1.0","event_id":"sha256:47acce3f561ecd7fff20ce123f59eb07d8d019d655ac9a1c81013ace19359c2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERS6YJL22AMVMOIO666V3TN4NL/bundle.json","state_url":"https://pith.science/pith/ERS6YJL22AMVMOIO666V3TN4NL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERS6YJL22AMVMOIO666V3TN4NL/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-21T23:48:31Z","links":{"resolver":"https://pith.science/pith/ERS6YJL22AMVMOIO666V3TN4NL","bundle":"https://pith.science/pith/ERS6YJL22AMVMOIO666V3TN4NL/bundle.json","state":"https://pith.science/pith/ERS6YJL22AMVMOIO666V3TN4NL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERS6YJL22AMVMOIO666V3TN4NL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ERS6YJL22AMVMOIO666V3TN4NL","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":"61dd3c6f04d7b98969d1a447e0ed12aff5a3f5251a28f50ae183540338046fee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-04T08:41:22Z","title_canon_sha256":"b07e18e7f48a231ba538f1cd1fa360491b1ec5f63858da56636dd9eacd8e55bb"},"schema_version":"1.0","source":{"id":"1006.0809","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0809","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0809v2","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0809","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"ERS6YJL22AMV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"ERS6YJL22AMVMOIO","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"ERS6YJL2","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:47acce3f561ecd7fff20ce123f59eb07d8d019d655ac9a1c81013ace19359c2b","target":"graph","created_at":"2026-05-18T04:14:05Z","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":"Analysing Web graphs has applications in determining page ranks, fighting Web spam, detecting communities and mirror sites, and more. This study is however hampered by the necessity of storing a major part of huge graphs in the external memory, which prevents efficient random access to edge (hyperlink) lists. A number of algorithms involving compression techniques have thus been presented, to represent Web graphs succinctly but also providing random access. Those techniques are usually based on differential encodings of the adjacency lists, finding repeating nodes or node regions in the succes","authors_text":"Szymon Grabowski, Wojciech Bieniecki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-04T08:41:22Z","title":"Tight and simple Web graph compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0809","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:507fd74cb1cf10b7a2ee8b1ee051ab9d75bb643a3ca39bfbc9703582dcaa4ed7","target":"record","created_at":"2026-05-18T04:14:05Z","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":"61dd3c6f04d7b98969d1a447e0ed12aff5a3f5251a28f50ae183540338046fee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-04T08:41:22Z","title_canon_sha256":"b07e18e7f48a231ba538f1cd1fa360491b1ec5f63858da56636dd9eacd8e55bb"},"schema_version":"1.0","source":{"id":"1006.0809","kind":"arxiv","version":2}},"canonical_sha256":"2465ec257ad01956390ef7bd5dcdbc6ad67f789e978b8810a8ca1f5e1e231617","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2465ec257ad01956390ef7bd5dcdbc6ad67f789e978b8810a8ca1f5e1e231617","first_computed_at":"2026-05-18T04:14:05.969067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:05.969067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z41HfXoRd2wGKizirEIM9c3cWP2Mrg3pme4MnATgzoSbI+l/F4iE3UzXStLHT6tBdhcIEMqCpupbVnXu5c61Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:05.969700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.0809","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:507fd74cb1cf10b7a2ee8b1ee051ab9d75bb643a3ca39bfbc9703582dcaa4ed7","sha256:47acce3f561ecd7fff20ce123f59eb07d8d019d655ac9a1c81013ace19359c2b"],"state_sha256":"841796e8b7e95e6ae0629c4f287d8d15c93e1cd8dc12d31cf6eca05fc390f94a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrcMcnvLAdYkts28mIHiSP10/0D48/nsYaDdkf38Gg5fCFjq4f2d7hKN+JhmQfDistkO9nQQGqhrQu+C6qtjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:48:31.719691Z","bundle_sha256":"8655594f0ddf196f4c761dd8236b3643281e0f1cc597c5a1517e94ee6a448ee8"}}