{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QF3FFTOFWXCIGJIF3HCKRQY3EK","short_pith_number":"pith:QF3FFTOF","schema_version":"1.0","canonical_sha256":"817652cdc5b5c4832505d9c4a8c31b22a6ce5a91f56803ed452f376abe179b57","source":{"kind":"arxiv","id":"2209.08845","version":1},"attestation_state":"computed","paper":{"title":"A Simple Framework for Finding Balanced Sparse Cuts via APSP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Li Chen, Maximilian Probst Gutenberg, Rasmus Kyng, Sushant Sachdeva","submitted_at":"2022-09-19T08:47:00Z","abstract_excerpt":"We present a very simple and intuitive algorithm to find balanced sparse cuts in a graph via shortest-paths. Our algorithm combines a new multiplicative-weights framework for solving unit-weight multi-commodity flows with standard ball growing arguments. Using Dijkstra's algorithm for computing the shortest paths afresh every time gives a very simple algorithm that runs in time $\\widetilde{O}(m^2/\\phi)$ and finds an $\\widetilde{O}(\\phi)$-sparse balanced cut, when the given graph has a $\\phi$-sparse balanced cut. Combining our algorithm with known deterministic data-structures for answering app"},"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":"2209.08845","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-09-19T08:47:00Z","cross_cats_sorted":[],"title_canon_sha256":"eadeefaf9b4ed4beb07c7d7b0e720c98ed2cf6b496eb0a24522d13d61b4b5b2d","abstract_canon_sha256":"2ca52f314045d9e5875595da368c079348b881912d70de405752c76376441e2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:46.832424Z","signature_b64":"5moV/H3S4kOPHdbRV/7kljpIC56YtDbAfRRTvuQ6mOzVVSEArnf7/p8Au1HPEiniJuL+EDqSvwfS6vLiH9OICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"817652cdc5b5c4832505d9c4a8c31b22a6ce5a91f56803ed452f376abe179b57","last_reissued_at":"2026-07-05T04:58:46.832034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:46.832034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Framework for Finding Balanced Sparse Cuts via APSP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Li Chen, Maximilian Probst Gutenberg, Rasmus Kyng, Sushant Sachdeva","submitted_at":"2022-09-19T08:47:00Z","abstract_excerpt":"We present a very simple and intuitive algorithm to find balanced sparse cuts in a graph via shortest-paths. Our algorithm combines a new multiplicative-weights framework for solving unit-weight multi-commodity flows with standard ball growing arguments. Using Dijkstra's algorithm for computing the shortest paths afresh every time gives a very simple algorithm that runs in time $\\widetilde{O}(m^2/\\phi)$ and finds an $\\widetilde{O}(\\phi)$-sparse balanced cut, when the given graph has a $\\phi$-sparse balanced cut. Combining our algorithm with known deterministic data-structures for answering app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08845","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/2209.08845/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":"2209.08845","created_at":"2026-07-05T04:58:46.832090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.08845v1","created_at":"2026-07-05T04:58:46.832090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08845","created_at":"2026-07-05T04:58:46.832090+00:00"},{"alias_kind":"pith_short_12","alias_value":"QF3FFTOFWXCI","created_at":"2026-07-05T04:58:46.832090+00:00"},{"alias_kind":"pith_short_16","alias_value":"QF3FFTOFWXCIGJIF","created_at":"2026-07-05T04:58:46.832090+00:00"},{"alias_kind":"pith_short_8","alias_value":"QF3FFTOF","created_at":"2026-07-05T04:58:46.832090+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/QF3FFTOFWXCIGJIF3HCKRQY3EK","json":"https://pith.science/pith/QF3FFTOFWXCIGJIF3HCKRQY3EK.json","graph_json":"https://pith.science/api/pith-number/QF3FFTOFWXCIGJIF3HCKRQY3EK/graph.json","events_json":"https://pith.science/api/pith-number/QF3FFTOFWXCIGJIF3HCKRQY3EK/events.json","paper":"https://pith.science/paper/QF3FFTOF"},"agent_actions":{"view_html":"https://pith.science/pith/QF3FFTOFWXCIGJIF3HCKRQY3EK","download_json":"https://pith.science/pith/QF3FFTOFWXCIGJIF3HCKRQY3EK.json","view_paper":"https://pith.science/paper/QF3FFTOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.08845&json=true","fetch_graph":"https://pith.science/api/pith-number/QF3FFTOFWXCIGJIF3HCKRQY3EK/graph.json","fetch_events":"https://pith.science/api/pith-number/QF3FFTOFWXCIGJIF3HCKRQY3EK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QF3FFTOFWXCIGJIF3HCKRQY3EK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QF3FFTOFWXCIGJIF3HCKRQY3EK/action/storage_attestation","attest_author":"https://pith.science/pith/QF3FFTOFWXCIGJIF3HCKRQY3EK/action/author_attestation","sign_citation":"https://pith.science/pith/QF3FFTOFWXCIGJIF3HCKRQY3EK/action/citation_signature","submit_replication":"https://pith.science/pith/QF3FFTOFWXCIGJIF3HCKRQY3EK/action/replication_record"}},"created_at":"2026-07-05T04:58:46.832090+00:00","updated_at":"2026-07-05T04:58:46.832090+00:00"}