{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:IJSJMELMCXISDUFGDGHDFCNOMG","short_pith_number":"pith:IJSJMELM","canonical_record":{"source":{"id":"1008.1975","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-11T19:35:38Z","cross_cats_sorted":[],"title_canon_sha256":"8bc045e98f8deb13caa6cf7633a762096ad2dbdb28022edb1df9e1ba16cc8e2d","abstract_canon_sha256":"4794f7bb096714b4830153e54142d07dbcecc26cb358ba3ea93554a7dbfada86"},"schema_version":"1.0"},"canonical_sha256":"426496116c15d121d0a6198e3289ae61a360f51986961742cb40e74a83f8c3fc","source":{"kind":"arxiv","id":"1008.1975","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1975","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1975v4","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1975","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"IJSJMELMCXIS","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IJSJMELMCXISDUFG","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IJSJMELM","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:IJSJMELMCXISDUFGDGHDFCNOMG","target":"record","payload":{"canonical_record":{"source":{"id":"1008.1975","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-11T19:35:38Z","cross_cats_sorted":[],"title_canon_sha256":"8bc045e98f8deb13caa6cf7633a762096ad2dbdb28022edb1df9e1ba16cc8e2d","abstract_canon_sha256":"4794f7bb096714b4830153e54142d07dbcecc26cb358ba3ea93554a7dbfada86"},"schema_version":"1.0"},"canonical_sha256":"426496116c15d121d0a6198e3289ae61a360f51986961742cb40e74a83f8c3fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:51.108809Z","signature_b64":"c7DWzcOuYfl4yOM17koRPwhs6VFluyaiC2uXw+T+OyecQ4H2Eorkyy8RaOeKz1yK4LGUZx2z8Hv6tAmVUYbMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"426496116c15d121d0a6198e3289ae61a360f51986961742cb40e74a83f8c3fc","last_reissued_at":"2026-05-18T04:36:51.108277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:51.108277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.1975","source_version":4,"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:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYEmc1CTgPRfaiwVHXBQ/nMVIOr7vHp2WuuaGABi84nWXh3VqvgmKh4KNLghE7zajsnCvkkPGrOFsVo9sx67CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:40:10.400280Z"},"content_sha256":"4ca0d3e7f4de2e0d84ea154c20f7fff34a70766cd3256ffc7e602081216821b5","schema_version":"1.0","event_id":"sha256:4ca0d3e7f4de2e0d84ea154c20f7fff34a70766cd3256ffc7e602081216821b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:IJSJMELMCXISDUFGDGHDFCNOMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Madry","submitted_at":"2010-08-11T19:35:38Z","abstract_excerpt":"We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees, allows approximating it almost as quickly on general graphs while only losing a poly-logarithmic factor in the approximation guarantee.\n  To illustrate the applicability of our paradigm, we focus our attention on the undirected sparsest cut problem with general demands and the balanced separator problem. By a simple use of our framework, we obtain poly-logarit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1975","kind":"arxiv","version":4},"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:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RqHyC33ouczaw5jRUGbVWnmNQqf5Ns+aiRJGCIh0wb5X/80tCQtTJOb5U20QUhoVc29Zq7b7C+pwgeQ/dvkKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:40:10.400978Z"},"content_sha256":"6316ec83128a4b93ac083858e395f5fe309e6770e3b49d5b3d91d5fd9fe5149f","schema_version":"1.0","event_id":"sha256:6316ec83128a4b93ac083858e395f5fe309e6770e3b49d5b3d91d5fd9fe5149f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJSJMELMCXISDUFGDGHDFCNOMG/bundle.json","state_url":"https://pith.science/pith/IJSJMELMCXISDUFGDGHDFCNOMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJSJMELMCXISDUFGDGHDFCNOMG/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-05-26T17:40:10Z","links":{"resolver":"https://pith.science/pith/IJSJMELMCXISDUFGDGHDFCNOMG","bundle":"https://pith.science/pith/IJSJMELMCXISDUFGDGHDFCNOMG/bundle.json","state":"https://pith.science/pith/IJSJMELMCXISDUFGDGHDFCNOMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJSJMELMCXISDUFGDGHDFCNOMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:IJSJMELMCXISDUFGDGHDFCNOMG","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":"4794f7bb096714b4830153e54142d07dbcecc26cb358ba3ea93554a7dbfada86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-11T19:35:38Z","title_canon_sha256":"8bc045e98f8deb13caa6cf7633a762096ad2dbdb28022edb1df9e1ba16cc8e2d"},"schema_version":"1.0","source":{"id":"1008.1975","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1975","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1975v4","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1975","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"IJSJMELMCXIS","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IJSJMELMCXISDUFG","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IJSJMELM","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:6316ec83128a4b93ac083858e395f5fe309e6770e3b49d5b3d91d5fd9fe5149f","target":"graph","created_at":"2026-05-18T04:36:51Z","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 present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees, allows approximating it almost as quickly on general graphs while only losing a poly-logarithmic factor in the approximation guarantee.\n  To illustrate the applicability of our paradigm, we focus our attention on the undirected sparsest cut problem with general demands and the balanced separator problem. By a simple use of our framework, we obtain poly-logarit","authors_text":"Aleksander Madry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-11T19:35:38Z","title":"Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1975","kind":"arxiv","version":4},"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:4ca0d3e7f4de2e0d84ea154c20f7fff34a70766cd3256ffc7e602081216821b5","target":"record","created_at":"2026-05-18T04:36:51Z","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":"4794f7bb096714b4830153e54142d07dbcecc26cb358ba3ea93554a7dbfada86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-11T19:35:38Z","title_canon_sha256":"8bc045e98f8deb13caa6cf7633a762096ad2dbdb28022edb1df9e1ba16cc8e2d"},"schema_version":"1.0","source":{"id":"1008.1975","kind":"arxiv","version":4}},"canonical_sha256":"426496116c15d121d0a6198e3289ae61a360f51986961742cb40e74a83f8c3fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"426496116c15d121d0a6198e3289ae61a360f51986961742cb40e74a83f8c3fc","first_computed_at":"2026-05-18T04:36:51.108277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:51.108277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c7DWzcOuYfl4yOM17koRPwhs6VFluyaiC2uXw+T+OyecQ4H2Eorkyy8RaOeKz1yK4LGUZx2z8Hv6tAmVUYbMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:51.108809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1975","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ca0d3e7f4de2e0d84ea154c20f7fff34a70766cd3256ffc7e602081216821b5","sha256:6316ec83128a4b93ac083858e395f5fe309e6770e3b49d5b3d91d5fd9fe5149f"],"state_sha256":"3792db100c0f17b106d6da217354c4b1ba0327429470e3bcd5c1f9beb50c0c75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jcIKDmL0tRlwacRnyVklFRDgtvrQBlgQGuv1fv44iVORfehLSnEnJ80Spdlhu+mXYUvfwdGUEOENuKkSulmDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:40:10.404429Z","bundle_sha256":"8ee70d3dc961d18d2bd5a48d3f82aeaafaac9e072ea213a01a90cb06e1cfb5b9"}}