{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VNBIQSWIB56M6LVAW5RW64Y6LH","short_pith_number":"pith:VNBIQSWI","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"},"canonical_sha256":"ab42884ac80f7ccf2ea0b7636f731e59f795c070e1e85ecbdea975f582216243","source":{"kind":"arxiv","id":"1504.07019","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07019","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07019v2","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07019","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"VNBIQSWIB56M","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VNBIQSWIB56M6LVA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VNBIQSWI","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VNBIQSWIB56M6LVAW5RW64Y6LH","target":"record","payload":{"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"},"canonical_sha256":"ab42884ac80f7ccf2ea0b7636f731e59f795c070e1e85ecbdea975f582216243","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"},"source_kind":"arxiv","source_id":"1504.07019","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-18T01:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66dtAfygVimoZE2mKOTL9iGrvawvH2trx/RfQnmdNUm1k/tqwIgEmlVPKgfW5SrHwunv9zkafNtytWXW4zmcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:42:44.353200Z"},"content_sha256":"0c3cea5082bb8dd089b2d4894efbba24f2b30458f4aaa38b10cb4f98c0279252","schema_version":"1.0","event_id":"sha256:0c3cea5082bb8dd089b2d4894efbba24f2b30458f4aaa38b10cb4f98c0279252"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VNBIQSWIB56M6LVAW5RW64Y6LH","target":"graph","payload":{"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"},"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-18T01:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HlpagvWj7H980EPex3piDikZWm1/Bc44QcEiULwtuARW2XL4cFxZprfP5CRgdiFOoz40oRbZVoESeCbSX+WBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:42:44.353564Z"},"content_sha256":"12d4d343621fea61d62d913bd28fbc7b4b60ff5407d1f5d0a7f1bc91fb36ba39","schema_version":"1.0","event_id":"sha256:12d4d343621fea61d62d913bd28fbc7b4b60ff5407d1f5d0a7f1bc91fb36ba39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/bundle.json","state_url":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/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-11T09:42:44Z","links":{"resolver":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH","bundle":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/bundle.json","state":"https://pith.science/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNBIQSWIB56M6LVAW5RW64Y6LH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VNBIQSWIB56M6LVAW5RW64Y6LH","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":"a0b3e02ba909a0a97dfb53d1c1374074e7b698c8256c1c2bc8dc6620faceb4b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-27T10:48:12Z","title_canon_sha256":"0caf82716537c50181d53248b9331f4460db471b76aba698af6c483743c46785"},"schema_version":"1.0","source":{"id":"1504.07019","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07019","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07019v2","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07019","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"VNBIQSWIB56M","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VNBIQSWIB56M6LVA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VNBIQSWI","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:12d4d343621fea61d62d913bd28fbc7b4b60ff5407d1f5d0a7f1bc91fb36ba39","target":"graph","created_at":"2026-05-18T01:03:44Z","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":"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","authors_text":"Lior Kamma, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-27T10:48:12Z","title":"Metric Decompositions of Path-Separable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07019","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:0c3cea5082bb8dd089b2d4894efbba24f2b30458f4aaa38b10cb4f98c0279252","target":"record","created_at":"2026-05-18T01:03:44Z","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":"a0b3e02ba909a0a97dfb53d1c1374074e7b698c8256c1c2bc8dc6620faceb4b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-27T10:48:12Z","title_canon_sha256":"0caf82716537c50181d53248b9331f4460db471b76aba698af6c483743c46785"},"schema_version":"1.0","source":{"id":"1504.07019","kind":"arxiv","version":2}},"canonical_sha256":"ab42884ac80f7ccf2ea0b7636f731e59f795c070e1e85ecbdea975f582216243","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab42884ac80f7ccf2ea0b7636f731e59f795c070e1e85ecbdea975f582216243","first_computed_at":"2026-05-18T01:03:44.466698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:44.466698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+JqTbox8AG08qM1vsBpP+LcOrOF5qEIy7ibIsE/nWg3EHuDfe7aRYQnCGTbz5dWZubmDo8ch3b0al8mbg6EeBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:44.467058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07019","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c3cea5082bb8dd089b2d4894efbba24f2b30458f4aaa38b10cb4f98c0279252","sha256:12d4d343621fea61d62d913bd28fbc7b4b60ff5407d1f5d0a7f1bc91fb36ba39"],"state_sha256":"7ce3438ad6f52b63a42ada300e03ca02eed07fa7cfbabf8111110870e066b595"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4umQwGRuui8Lae3S/HvL1gkCjdojlzszkx31rCsBsPf/GCh/0I3JPLVdShE3bwxIuK7gtM52nUcdbb6VEOABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:42:44.355478Z","bundle_sha256":"84cde29d14a2af2a9c9d426d8b5af7e1ed33b51737aa2166ad9ab7d7dedb22a4"}}