{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3M37NYLOWREOEZV34PZPQ6S4HF","short_pith_number":"pith:3M37NYLO","canonical_record":{"source":{"id":"1602.08820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-29T04:38:50Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"26567974c45a218023fc41b96d148f0d5b9aea8fc219bc79f73754a4919c7765","abstract_canon_sha256":"e4530b8d9435a088e6ecd86cfc469185390a81cf48701b0f16c3db2475a6d8ca"},"schema_version":"1.0"},"canonical_sha256":"db37f6e16eb448e266bbe3f2f87a5c39406326d6d06af47ebc119b3c59bc8485","source":{"kind":"arxiv","id":"1602.08820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08820","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08820v1","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08820","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"pith_short_12","alias_value":"3M37NYLOWREO","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3M37NYLOWREOEZV3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3M37NYLO","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3M37NYLOWREOEZV34PZPQ6S4HF","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-29T04:38:50Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"26567974c45a218023fc41b96d148f0d5b9aea8fc219bc79f73754a4919c7765","abstract_canon_sha256":"e4530b8d9435a088e6ecd86cfc469185390a81cf48701b0f16c3db2475a6d8ca"},"schema_version":"1.0"},"canonical_sha256":"db37f6e16eb448e266bbe3f2f87a5c39406326d6d06af47ebc119b3c59bc8485","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:14.483270Z","signature_b64":"5H0EBWGd4V868jmCb2Cb1yfDfGq9cvX+PaLVOTKRdlIxsmqUEYBhl0VlFUOCGXA8UwROVhpSSv1HAFd2kp++AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db37f6e16eb448e266bbe3f2f87a5c39406326d6d06af47ebc119b3c59bc8485","last_reissued_at":"2026-05-18T00:36:14.482620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:14.482620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08820","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-18T00:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhte3HOC3zxTKfmU5rN9AYp65aJDrYXCw6fCpBmBIm0mtMyQMCWMJPPUt3A+YF9rK0mxkDovAzD6mo9SuvfKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:38:04.367934Z"},"content_sha256":"5c10cfdea46a403e2b1785b864d3109c16625a5a5950418e71f1079f88c4ca04","schema_version":"1.0","event_id":"sha256:5c10cfdea46a403e2b1785b864d3109c16625a5a5950418e71f1079f88c4ca04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3M37NYLOWREOEZV34PZPQ6S4HF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressing Graphs and Indexes with Recursive Graph Bisection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Alon Shalita, Brian Karrer, Giuseppe Ottaviano, Igor Kabiljo, Laxman Dhulipala, Sergey Pupyrev","submitted_at":"2016-02-29T04:38:50Z","abstract_excerpt":"Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes.\n  We extend the recent theoretical model of Chierichetti et al. (KDD 2009) for graph compression, and show how it can be employed for compression-friendly reordering of social networks and web graphs and for assigning document identifiers in inverted indexes. We design and implement a novel theoretically sound reordering algorithm that is based on recursive "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08820","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-18T00:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/RLwq6QNGbAc4bfsI9SuiS3S+yMKRo+fbMklvG/Spb97+zAWFiLGMfJIglzd9wlgOjQbOmUoPCpOy4s0xlgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:38:04.368282Z"},"content_sha256":"757043efd42267090f18c476413440893d5e17a22fef8362fa5acb6d94389051","schema_version":"1.0","event_id":"sha256:757043efd42267090f18c476413440893d5e17a22fef8362fa5acb6d94389051"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3M37NYLOWREOEZV34PZPQ6S4HF/bundle.json","state_url":"https://pith.science/pith/3M37NYLOWREOEZV34PZPQ6S4HF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3M37NYLOWREOEZV34PZPQ6S4HF/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-04T05:38:04Z","links":{"resolver":"https://pith.science/pith/3M37NYLOWREOEZV34PZPQ6S4HF","bundle":"https://pith.science/pith/3M37NYLOWREOEZV34PZPQ6S4HF/bundle.json","state":"https://pith.science/pith/3M37NYLOWREOEZV34PZPQ6S4HF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3M37NYLOWREOEZV34PZPQ6S4HF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3M37NYLOWREOEZV34PZPQ6S4HF","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":"e4530b8d9435a088e6ecd86cfc469185390a81cf48701b0f16c3db2475a6d8ca","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-29T04:38:50Z","title_canon_sha256":"26567974c45a218023fc41b96d148f0d5b9aea8fc219bc79f73754a4919c7765"},"schema_version":"1.0","source":{"id":"1602.08820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08820","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08820v1","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08820","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"pith_short_12","alias_value":"3M37NYLOWREO","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3M37NYLOWREOEZV3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3M37NYLO","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:757043efd42267090f18c476413440893d5e17a22fef8362fa5acb6d94389051","target":"graph","created_at":"2026-05-18T00:36:14Z","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":"Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes.\n  We extend the recent theoretical model of Chierichetti et al. (KDD 2009) for graph compression, and show how it can be employed for compression-friendly reordering of social networks and web graphs and for assigning document identifiers in inverted indexes. We design and implement a novel theoretically sound reordering algorithm that is based on recursive ","authors_text":"Alon Shalita, Brian Karrer, Giuseppe Ottaviano, Igor Kabiljo, Laxman Dhulipala, Sergey Pupyrev","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-29T04:38:50Z","title":"Compressing Graphs and Indexes with Recursive Graph Bisection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08820","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:5c10cfdea46a403e2b1785b864d3109c16625a5a5950418e71f1079f88c4ca04","target":"record","created_at":"2026-05-18T00:36:14Z","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":"e4530b8d9435a088e6ecd86cfc469185390a81cf48701b0f16c3db2475a6d8ca","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-29T04:38:50Z","title_canon_sha256":"26567974c45a218023fc41b96d148f0d5b9aea8fc219bc79f73754a4919c7765"},"schema_version":"1.0","source":{"id":"1602.08820","kind":"arxiv","version":1}},"canonical_sha256":"db37f6e16eb448e266bbe3f2f87a5c39406326d6d06af47ebc119b3c59bc8485","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db37f6e16eb448e266bbe3f2f87a5c39406326d6d06af47ebc119b3c59bc8485","first_computed_at":"2026-05-18T00:36:14.482620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:14.482620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5H0EBWGd4V868jmCb2Cb1yfDfGq9cvX+PaLVOTKRdlIxsmqUEYBhl0VlFUOCGXA8UwROVhpSSv1HAFd2kp++AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:14.483270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c10cfdea46a403e2b1785b864d3109c16625a5a5950418e71f1079f88c4ca04","sha256:757043efd42267090f18c476413440893d5e17a22fef8362fa5acb6d94389051"],"state_sha256":"b6aab798aaeb27c8e67975ac0940d221301c0a81e2e434a62812d56a27aadb89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyRdRZSdfOu959zcoqwPTKZv3vlER+eXF3P/e/QqDuMmi9qT353bkuxmC+AUZmBO6NCSqSCUEI4lHUadyZinAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:38:04.370267Z","bundle_sha256":"210e723788043611fbd44ecfd1d3f249ab34448a006862f1b54cb23ee9c58d59"}}