{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YNS6NYOOLNUSUQEDCSNK2E3TCU","short_pith_number":"pith:YNS6NYOO","schema_version":"1.0","canonical_sha256":"c365e6e1ce5b692a4083149aad13731524b9886053de6f4d081ba7e7bc26ee83","source":{"kind":"arxiv","id":"1909.09002","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1909.09002","created_at":"2026-07-05T00:05:47.190844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.09002v1","created_at":"2026-07-05T00:05:47.190844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.09002","created_at":"2026-07-05T00:05:47.190844+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNS6NYOOLNUS","created_at":"2026-07-05T00:05:47.190844+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNS6NYOOLNUSUQED","created_at":"2026-07-05T00:05:47.190844+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNS6NYOO","created_at":"2026-07-05T00:05:47.190844+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU","json":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU.json","graph_json":"https://pith.science/api/pith-number/YNS6NYOOLNUSUQEDCSNK2E3TCU/graph.json","events_json":"https://pith.science/api/pith-number/YNS6NYOOLNUSUQEDCSNK2E3TCU/events.json","paper":"https://pith.science/paper/YNS6NYOO"},"agent_actions":{"view_html":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU","download_json":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU.json","view_paper":"https://pith.science/paper/YNS6NYOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.09002&json=true","fetch_graph":"https://pith.science/api/pith-number/YNS6NYOOLNUSUQEDCSNK2E3TCU/graph.json","fetch_events":"https://pith.science/api/pith-number/YNS6NYOOLNUSUQEDCSNK2E3TCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/action/storage_attestation","attest_author":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/action/author_attestation","sign_citation":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/action/citation_signature","submit_replication":"https://pith.science/pith/YNS6NYOOLNUSUQEDCSNK2E3TCU/action/replication_record"}},"created_at":"2026-07-05T00:05:47.190844+00:00","updated_at":"2026-07-05T00:05:47.190844+00:00"}