{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7BQYETGVGV453RRX2UGNRRCOLL","short_pith_number":"pith:7BQYETGV","schema_version":"1.0","canonical_sha256":"f861824cd53579ddc637d50cd8c44e5af41e6ea5faba970417ba195519f0fc44","source":{"kind":"arxiv","id":"2407.06911","version":5},"attestation_state":"computed","paper":{"title":"Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Chenglin Fan, Michael Dinitz, Rishi Chandra, Zongrui Zou","submitted_at":"2024-07-09T14:46:33Z","abstract_excerpt":"In this paper, we address the challenge of differential privacy in the context of graph cuts, specifically focusing on the multiway cut and the minimum $k$-cut. We introduce edge-differentially private algorithms that achieve nearly optimal performance for these problems. Motivated by multiway cut, we propose the shifting mechanism, a general framework for private combinatorial optimization problems. This framework allows us to develop an efficient private algorithm with a multiplicative approximation ratio that matches the state-of-the-art non-private algorithm, improving over previous privat"},"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":"2407.06911","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-07-09T14:46:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d76f703b1d57a2537868f0c90e4552fbc1a5709ec2e45203260b2fa4b4146500","abstract_canon_sha256":"139fcb9cd7a5969b8faf9c5029219322e769148c18c8a3696e544f75f1160cc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:43:31.285194Z","signature_b64":"iJqOMTiMLUYeqUz3PIO++9GDU3AQejvjy3XTLBQlY/Ov4CV42Lwxsb5Pg/k3/k0BA2g+3Iw3g1zH0eRJkbzsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f861824cd53579ddc637d50cd8c44e5af41e6ea5faba970417ba195519f0fc44","last_reissued_at":"2026-07-05T09:43:31.284475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:43:31.284475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Chenglin Fan, Michael Dinitz, Rishi Chandra, Zongrui Zou","submitted_at":"2024-07-09T14:46:33Z","abstract_excerpt":"In this paper, we address the challenge of differential privacy in the context of graph cuts, specifically focusing on the multiway cut and the minimum $k$-cut. We introduce edge-differentially private algorithms that achieve nearly optimal performance for these problems. Motivated by multiway cut, we propose the shifting mechanism, a general framework for private combinatorial optimization problems. This framework allows us to develop an efficient private algorithm with a multiplicative approximation ratio that matches the state-of-the-art non-private algorithm, improving over previous privat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.06911","kind":"arxiv","version":5},"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/2407.06911/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":"2407.06911","created_at":"2026-07-05T09:43:31.284630+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.06911v5","created_at":"2026-07-05T09:43:31.284630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.06911","created_at":"2026-07-05T09:43:31.284630+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BQYETGVGV45","created_at":"2026-07-05T09:43:31.284630+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BQYETGVGV453RRX","created_at":"2026-07-05T09:43:31.284630+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BQYETGV","created_at":"2026-07-05T09:43:31.284630+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21601","citing_title":"Near-Optimal Generalized Private Testing","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL","json":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL.json","graph_json":"https://pith.science/api/pith-number/7BQYETGVGV453RRX2UGNRRCOLL/graph.json","events_json":"https://pith.science/api/pith-number/7BQYETGVGV453RRX2UGNRRCOLL/events.json","paper":"https://pith.science/paper/7BQYETGV"},"agent_actions":{"view_html":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL","download_json":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL.json","view_paper":"https://pith.science/paper/7BQYETGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.06911&json=true","fetch_graph":"https://pith.science/api/pith-number/7BQYETGVGV453RRX2UGNRRCOLL/graph.json","fetch_events":"https://pith.science/api/pith-number/7BQYETGVGV453RRX2UGNRRCOLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL/action/storage_attestation","attest_author":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL/action/author_attestation","sign_citation":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL/action/citation_signature","submit_replication":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL/action/replication_record"}},"created_at":"2026-07-05T09:43:31.284630+00:00","updated_at":"2026-07-05T09:43:31.284630+00:00"}