{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VNBIQSWIB56M6LVAW5RW64Y6LH","short_pith_number":"pith:VNBIQSWI","schema_version":"1.0","canonical_sha256":"ab42884ac80f7ccf2ea0b7636f731e59f795c070e1e85ecbdea975f582216243","source":{"kind":"arxiv","id":"1504.07019","version":2},"attestation_state":"computed","paper":{"title":"Metric Decompositions of Path-Separable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lior Kamma, Robert Krauthgamer","submitted_at":"2015-04-27T10:48:12Z","abstract_excerpt":"A prominent tool in many problems involving metric spaces is a notion of randomized low-diameter decomposition. Loosely speaking, $\\beta$-decomposition refers to a probability distribution over partitions of the metric into sets of low diameter, such that nearby points (parameterized by $\\beta>0$) are likely to be \"clustered\" together. Applying this notion to the shortest-path metric in edge-weighted graphs, it is known that $n$-vertex graphs admit an $O(\\ln n)$-padded decomposition (Bartal, 1996), and that excluded-minor graphs admit $O(1)$-padded decomposition (Klein, Plotkin and Rao 1993, F"},"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":"1504.07019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-27T10:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"0caf82716537c50181d53248b9331f4460db471b76aba698af6c483743c46785","abstract_canon_sha256":"a0b3e02ba909a0a97dfb53d1c1374074e7b698c8256c1c2bc8dc6620faceb4b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:44.467058Z","signature_b64":"+JqTbox8AG08qM1vsBpP+LcOrOF5qEIy7ibIsE/nWg3EHuDfe7aRYQnCGTbz5dWZubmDo8ch3b0al8mbg6EeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab42884ac80f7ccf2ea0b7636f731e59f795c070e1e85ecbdea975f582216243","last_reissued_at":"2026-05-18T01:03:44.466698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:44.466698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Decompositions of Path-Separable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lior Kamma, Robert Krauthgamer","submitted_at":"2015-04-27T10:48:12Z","abstract_excerpt":"A prominent tool in many problems involving metric spaces is a notion of randomized low-diameter decomposition. Loosely speaking, $\\beta$-decomposition refers to a probability distribution over partitions of the metric into sets of low diameter, such that nearby points (parameterized by $\\beta>0$) are likely to be \"clustered\" together. Applying this notion to the shortest-path metric in edge-weighted graphs, it is known that $n$-vertex graphs admit an $O(\\ln n)$-padded decomposition (Bartal, 1996), and that excluded-minor graphs admit $O(1)$-padded decomposition (Klein, Plotkin and Rao 1993, F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07019","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.07019","created_at":"2026-05-18T01:03:44.466755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07019v2","created_at":"2026-05-18T01:03:44.466755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07019","created_at":"2026-05-18T01:03:44.466755+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNBIQSWIB56M","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNBIQSWIB56M6LVA","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNBIQSWI","created_at":"2026-05-18T12:29:47.479230+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/VNBIQSWIB56M6LVAW5RW64Y6LH","json":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH.json","graph_json":"https://pith.science/api/pith-number/VNBIQSWIB56M6LVAW5RW64Y6LH/graph.json","events_json":"https://pith.science/api/pith-number/VNBIQSWIB56M6LVAW5RW64Y6LH/events.json","paper":"https://pith.science/paper/VNBIQSWI"},"agent_actions":{"view_html":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH","download_json":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH.json","view_paper":"https://pith.science/paper/VNBIQSWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07019&json=true","fetch_graph":"https://pith.science/api/pith-number/VNBIQSWIB56M6LVAW5RW64Y6LH/graph.json","fetch_events":"https://pith.science/api/pith-number/VNBIQSWIB56M6LVAW5RW64Y6LH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/action/storage_attestation","attest_author":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/action/author_attestation","sign_citation":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/action/citation_signature","submit_replication":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/action/replication_record"}},"created_at":"2026-05-18T01:03:44.466755+00:00","updated_at":"2026-05-18T01:03:44.466755+00:00"}