{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MMUHTO5ULEWNL4AQ7VQERMAX6W","short_pith_number":"pith:MMUHTO5U","canonical_record":{"source":{"id":"1006.4607","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-23T18:43:33Z","cross_cats_sorted":[],"title_canon_sha256":"742eeab944ace74338f00e470be7a73712af3e2ec3c0a145aa82af97057d4b72","abstract_canon_sha256":"ce39eb89bff6550820fee74c8651d56ea0d40f13fe42ba320a73f28ed86761d3"},"schema_version":"1.0"},"canonical_sha256":"632879bbb4592cd5f010fd6048b017f58854c9ba98daa6887bd281afcaf3ba9c","source":{"kind":"arxiv","id":"1006.4607","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.4607","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1006.4607v2","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4607","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"MMUHTO5ULEWN","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MMUHTO5ULEWNL4AQ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MMUHTO5U","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MMUHTO5ULEWNL4AQ7VQERMAX6W","target":"record","payload":{"canonical_record":{"source":{"id":"1006.4607","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-23T18:43:33Z","cross_cats_sorted":[],"title_canon_sha256":"742eeab944ace74338f00e470be7a73712af3e2ec3c0a145aa82af97057d4b72","abstract_canon_sha256":"ce39eb89bff6550820fee74c8651d56ea0d40f13fe42ba320a73f28ed86761d3"},"schema_version":"1.0"},"canonical_sha256":"632879bbb4592cd5f010fd6048b017f58854c9ba98daa6887bd281afcaf3ba9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:49.671535Z","signature_b64":"b6ON/XfvAmm0izRMbgEiNo+Wr90QABsne7GPAr6p197q5HOYH+08NTb5uHKvn1zmaIt8iwdHWX0mzQCLJKFnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"632879bbb4592cd5f010fd6048b017f58854c9ba98daa6887bd281afcaf3ba9c","last_reissued_at":"2026-05-18T04:33:49.671062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:49.671062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.4607","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-18T04:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvvC9iXjr26l1XkZgZf8WYjYYqIMkx/15UU7sVscSR9q1huWpzKo/nMo1OsjNZ1Oj4JMVLoOqMODr/FTQSoHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:14:06.011715Z"},"content_sha256":"f844b9f66b128b563c14fd67ec804d72679b8a11bcfaa849174a01ca8e5ebb07","schema_version":"1.0","event_id":"sha256:f844b9f66b128b563c14fd67ec804d72679b8a11bcfaa849174a01ca8e5ebb07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MMUHTO5ULEWNL4AQ7VQERMAX6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantin Makarychev, Yury Makarychev","submitted_at":"2010-06-23T18:43:33Z","abstract_excerpt":"We study vertex cut and flow sparsifiers that were recently introduced by Moitra, and Leighton and Moitra. We improve and generalize their results. We give a new polynomial-time algorithm for constructing O(log k / log log k) cut and flow sparsifiers, matching the best existential upper bound on the quality of a sparsifier, and improving the previous algorithmic upper bound of O(log^2 k / log log k). We show that flow sparsifiers can be obtained from linear operators approximating minimum metric extensions. We introduce the notion of (linear) metric extension operators, prove that they exist, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4607","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-18T04:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kjMO3WEOy2mRuxNZazbkNkPDvfQr3NKjHTadk0Vc/JuR/SCpTRL7Xxigq/INZ06J2xPBoTUIuEAQOVH2iVUbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:14:06.012081Z"},"content_sha256":"61360940683c4425fb5fe95ddd31d1c4b23b10ffbc9b97cc564ca789bac8577d","schema_version":"1.0","event_id":"sha256:61360940683c4425fb5fe95ddd31d1c4b23b10ffbc9b97cc564ca789bac8577d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMUHTO5ULEWNL4AQ7VQERMAX6W/bundle.json","state_url":"https://pith.science/pith/MMUHTO5ULEWNL4AQ7VQERMAX6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMUHTO5ULEWNL4AQ7VQERMAX6W/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-02T16:14:06Z","links":{"resolver":"https://pith.science/pith/MMUHTO5ULEWNL4AQ7VQERMAX6W","bundle":"https://pith.science/pith/MMUHTO5ULEWNL4AQ7VQERMAX6W/bundle.json","state":"https://pith.science/pith/MMUHTO5ULEWNL4AQ7VQERMAX6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMUHTO5ULEWNL4AQ7VQERMAX6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MMUHTO5ULEWNL4AQ7VQERMAX6W","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":"ce39eb89bff6550820fee74c8651d56ea0d40f13fe42ba320a73f28ed86761d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-23T18:43:33Z","title_canon_sha256":"742eeab944ace74338f00e470be7a73712af3e2ec3c0a145aa82af97057d4b72"},"schema_version":"1.0","source":{"id":"1006.4607","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.4607","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1006.4607v2","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4607","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"MMUHTO5ULEWN","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MMUHTO5ULEWNL4AQ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MMUHTO5U","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:61360940683c4425fb5fe95ddd31d1c4b23b10ffbc9b97cc564ca789bac8577d","target":"graph","created_at":"2026-05-18T04:33:49Z","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":"We study vertex cut and flow sparsifiers that were recently introduced by Moitra, and Leighton and Moitra. We improve and generalize their results. We give a new polynomial-time algorithm for constructing O(log k / log log k) cut and flow sparsifiers, matching the best existential upper bound on the quality of a sparsifier, and improving the previous algorithmic upper bound of O(log^2 k / log log k). We show that flow sparsifiers can be obtained from linear operators approximating minimum metric extensions. We introduce the notion of (linear) metric extension operators, prove that they exist, ","authors_text":"Konstantin Makarychev, Yury Makarychev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-23T18:43:33Z","title":"Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4607","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:f844b9f66b128b563c14fd67ec804d72679b8a11bcfaa849174a01ca8e5ebb07","target":"record","created_at":"2026-05-18T04:33:49Z","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":"ce39eb89bff6550820fee74c8651d56ea0d40f13fe42ba320a73f28ed86761d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-23T18:43:33Z","title_canon_sha256":"742eeab944ace74338f00e470be7a73712af3e2ec3c0a145aa82af97057d4b72"},"schema_version":"1.0","source":{"id":"1006.4607","kind":"arxiv","version":2}},"canonical_sha256":"632879bbb4592cd5f010fd6048b017f58854c9ba98daa6887bd281afcaf3ba9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"632879bbb4592cd5f010fd6048b017f58854c9ba98daa6887bd281afcaf3ba9c","first_computed_at":"2026-05-18T04:33:49.671062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:49.671062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b6ON/XfvAmm0izRMbgEiNo+Wr90QABsne7GPAr6p197q5HOYH+08NTb5uHKvn1zmaIt8iwdHWX0mzQCLJKFnCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:49.671535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.4607","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f844b9f66b128b563c14fd67ec804d72679b8a11bcfaa849174a01ca8e5ebb07","sha256:61360940683c4425fb5fe95ddd31d1c4b23b10ffbc9b97cc564ca789bac8577d"],"state_sha256":"6c5c4612683a1c79f2d556e1ed49c86871f32d50b5b7683039d74d51fac0f72c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upvRM1VrxYIsU4Rz6P/mEqFwM+Qe+InNO687iprIvk8Dg2TdmcFEEZ6Ln053moyyJFK8H4KJH4SRRe8ufoyYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:14:06.015208Z","bundle_sha256":"ffe07c5c6b7298beb5edef3154f2bba6ddd53945e04fed88d28eede645430d89"}}