{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YNS6NYOOLNUSUQEDCSNK2E3TCU","short_pith_number":"pith:YNS6NYOO","canonical_record":{"source":{"id":"1909.09002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-09-19T13:59:50Z","cross_cats_sorted":[],"title_canon_sha256":"105a677dfe315c22c963e6179d5c709d780d890a440b42c841e4d57dbb6d93ef","abstract_canon_sha256":"77bc22d8b8dabc8b9157b6d3ca432bfc776805e69d5e3c8b3ac589c5ced1584b"},"schema_version":"1.0"},"canonical_sha256":"c365e6e1ce5b692a4083149aad13731524b9886053de6f4d081ba7e7bc26ee83","source":{"kind":"arxiv","id":"1909.09002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.09002","created_at":"2026-07-05T00:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1909.09002v1","created_at":"2026-07-05T00:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.09002","created_at":"2026-07-05T00:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"YNS6NYOOLNUS","created_at":"2026-07-05T00:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"YNS6NYOOLNUSUQED","created_at":"2026-07-05T00:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"YNS6NYOO","created_at":"2026-07-05T00:05:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YNS6NYOOLNUSUQEDCSNK2E3TCU","target":"record","payload":{"canonical_record":{"source":{"id":"1909.09002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-09-19T13:59:50Z","cross_cats_sorted":[],"title_canon_sha256":"105a677dfe315c22c963e6179d5c709d780d890a440b42c841e4d57dbb6d93ef","abstract_canon_sha256":"77bc22d8b8dabc8b9157b6d3ca432bfc776805e69d5e3c8b3ac589c5ced1584b"},"schema_version":"1.0"},"canonical_sha256":"c365e6e1ce5b692a4083149aad13731524b9886053de6f4d081ba7e7bc26ee83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:05:47.191117Z","signature_b64":"J93VsjAzJoI64W5Mo3QNFenfFd2fXt6vpGzcJGMurrYz7V3s1BeU/gxuf/yZNrCbZqKuEG4XfI7npLgNOHTiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c365e6e1ce5b692a4083149aad13731524b9886053de6f4d081ba7e7bc26ee83","last_reissued_at":"2026-07-05T00:05:47.190791Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:05:47.190791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.09002","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-07-05T00:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2TecP4WJLG7QDBTMmr/VEZ/5tAnaeI1a+0WSqsh1ezEgoVywil8342tdd9v3GTzu5+x3/egbeGHPLsQG7BEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:32:46.123578Z"},"content_sha256":"775ab7813321bb54b5d35c0f9aa37ba8f3ce911dbda85baeb8e9ffaee8a72400","schema_version":"1.0","event_id":"sha256:775ab7813321bb54b5d35c0f9aa37ba8f3ce911dbda85baeb8e9ffaee8a72400"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YNS6NYOOLNUSUQEDCSNK2E3TCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Diameter Graph Decompositions by Approximate Distance Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Ruben Becker, Yuval Emek","submitted_at":"2019-09-19T13:59:50Z","abstract_excerpt":"In many models for large-scale computation, decomposition of the problem is key to efficient algorithms. For distance-related graph problems, it is often crucial that such a decomposition results in clusters of small diameter, while the probability that an edge is cut by the decomposition scales linearly with the length of the edge. There is a large body of literature on low diameter graph decomposition with small edge cutting probabilities, with all existing techniques heavily building on single source shortest paths (SSSP) computations. Unfortunately, in many theoretical models for large-sca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.09002","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.09002/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5kfO0mTvjXXFfAeaM5m69s09ddshJ1k7KUGB4e/CxVH42MxvcWoKWW6QGk5wlcOSkbzw4ns/rk6K5xdjffmvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:32:46.124216Z"},"content_sha256":"787ea368807000d85401b4180019535d467b991d5efbb853b5b7e6374193cbf5","schema_version":"1.0","event_id":"sha256:787ea368807000d85401b4180019535d467b991d5efbb853b5b7e6374193cbf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/bundle.json","state_url":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/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-07T05:32:46Z","links":{"resolver":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU","bundle":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/bundle.json","state":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YNS6NYOOLNUSUQEDCSNK2E3TCU","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":"77bc22d8b8dabc8b9157b6d3ca432bfc776805e69d5e3c8b3ac589c5ced1584b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-09-19T13:59:50Z","title_canon_sha256":"105a677dfe315c22c963e6179d5c709d780d890a440b42c841e4d57dbb6d93ef"},"schema_version":"1.0","source":{"id":"1909.09002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.09002","created_at":"2026-07-05T00:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1909.09002v1","created_at":"2026-07-05T00:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.09002","created_at":"2026-07-05T00:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"YNS6NYOOLNUS","created_at":"2026-07-05T00:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"YNS6NYOOLNUSUQED","created_at":"2026-07-05T00:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"YNS6NYOO","created_at":"2026-07-05T00:05:47Z"}],"graph_snapshots":[{"event_id":"sha256:787ea368807000d85401b4180019535d467b991d5efbb853b5b7e6374193cbf5","target":"graph","created_at":"2026-07-05T00:05:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.09002/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In many models for large-scale computation, decomposition of the problem is key to efficient algorithms. For distance-related graph problems, it is often crucial that such a decomposition results in clusters of small diameter, while the probability that an edge is cut by the decomposition scales linearly with the length of the edge. There is a large body of literature on low diameter graph decomposition with small edge cutting probabilities, with all existing techniques heavily building on single source shortest paths (SSSP) computations. Unfortunately, in many theoretical models for large-sca","authors_text":"Christoph Lenzen, Ruben Becker, Yuval Emek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-09-19T13:59:50Z","title":"Low Diameter Graph Decompositions by Approximate Distance Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.09002","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:775ab7813321bb54b5d35c0f9aa37ba8f3ce911dbda85baeb8e9ffaee8a72400","target":"record","created_at":"2026-07-05T00:05:47Z","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":"77bc22d8b8dabc8b9157b6d3ca432bfc776805e69d5e3c8b3ac589c5ced1584b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-09-19T13:59:50Z","title_canon_sha256":"105a677dfe315c22c963e6179d5c709d780d890a440b42c841e4d57dbb6d93ef"},"schema_version":"1.0","source":{"id":"1909.09002","kind":"arxiv","version":1}},"canonical_sha256":"c365e6e1ce5b692a4083149aad13731524b9886053de6f4d081ba7e7bc26ee83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c365e6e1ce5b692a4083149aad13731524b9886053de6f4d081ba7e7bc26ee83","first_computed_at":"2026-07-05T00:05:47.190791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:05:47.190791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J93VsjAzJoI64W5Mo3QNFenfFd2fXt6vpGzcJGMurrYz7V3s1BeU/gxuf/yZNrCbZqKuEG4XfI7npLgNOHTiDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:05:47.191117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.09002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:775ab7813321bb54b5d35c0f9aa37ba8f3ce911dbda85baeb8e9ffaee8a72400","sha256:787ea368807000d85401b4180019535d467b991d5efbb853b5b7e6374193cbf5"],"state_sha256":"0ddd2d913488554dc97f9bbe6f2c273740cadc4eb850ae16fdb849e366b2a2b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6L82xC9dENrKtRKZQvyRZaySaQ1pyjtvi1QmMEgfdldvztN4mFz5Mn5JTAb9pktfKyS+WMkJ2FSm4c1KuRNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:32:46.127750Z","bundle_sha256":"d279ab884b1d78f405f3e1424e2f403c4c1518e2722ee0fb79e062bc2c152158"}}