{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7BQYETGVGV453RRX2UGNRRCOLL","short_pith_number":"pith:7BQYETGV","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"},"canonical_sha256":"f861824cd53579ddc637d50cd8c44e5af41e6ea5faba970417ba195519f0fc44","source":{"kind":"arxiv","id":"2407.06911","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.06911","created_at":"2026-07-05T09:43:31Z"},{"alias_kind":"arxiv_version","alias_value":"2407.06911v5","created_at":"2026-07-05T09:43:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.06911","created_at":"2026-07-05T09:43:31Z"},{"alias_kind":"pith_short_12","alias_value":"7BQYETGVGV45","created_at":"2026-07-05T09:43:31Z"},{"alias_kind":"pith_short_16","alias_value":"7BQYETGVGV453RRX","created_at":"2026-07-05T09:43:31Z"},{"alias_kind":"pith_short_8","alias_value":"7BQYETGV","created_at":"2026-07-05T09:43:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7BQYETGVGV453RRX2UGNRRCOLL","target":"record","payload":{"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"},"canonical_sha256":"f861824cd53579ddc637d50cd8c44e5af41e6ea5faba970417ba195519f0fc44","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"},"source_kind":"arxiv","source_id":"2407.06911","source_version":5,"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-07-05T09:43:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Yf6JE0vQTbVpsdJSCQZB+GHR4tAcru2CZp1znvl9xZq09eeW9nhGzLovMujEDpZQMgaFUfGEzhuIbhYQGBhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:32:25.337240Z"},"content_sha256":"583ab13369d654d04a2126a24cfcf789b07360e9ef1baefb15d89fcdf10057f1","schema_version":"1.0","event_id":"sha256:583ab13369d654d04a2126a24cfcf789b07360e9ef1baefb15d89fcdf10057f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7BQYETGVGV453RRX2UGNRRCOLL","target":"graph","payload":{"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"},"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-07-05T09:43:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhDqRWCzWu3y3JYxri3EfvWY7yJQOybkDgfnSZcdixi7o/B8VtMHi7pvpsoxigav1IdbsUjxWquCP6rcujFwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:32:25.337750Z"},"content_sha256":"d667ed19380ec3dbf6b6a1acda9ead6fd219316fe8ce558a2a1bc5a0ba65d68c","schema_version":"1.0","event_id":"sha256:d667ed19380ec3dbf6b6a1acda9ead6fd219316fe8ce558a2a1bc5a0ba65d68c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL/bundle.json","state_url":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BQYETGVGV453RRX2UGNRRCOLL/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-08-09T04:32:25Z","links":{"resolver":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL","bundle":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL/bundle.json","state":"https://pith.science/pith/7BQYETGVGV453RRX2UGNRRCOLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BQYETGVGV453RRX2UGNRRCOLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7BQYETGVGV453RRX2UGNRRCOLL","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":"139fcb9cd7a5969b8faf9c5029219322e769148c18c8a3696e544f75f1160cc5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-07-09T14:46:33Z","title_canon_sha256":"d76f703b1d57a2537868f0c90e4552fbc1a5709ec2e45203260b2fa4b4146500"},"schema_version":"1.0","source":{"id":"2407.06911","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.06911","created_at":"2026-07-05T09:43:31Z"},{"alias_kind":"arxiv_version","alias_value":"2407.06911v5","created_at":"2026-07-05T09:43:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.06911","created_at":"2026-07-05T09:43:31Z"},{"alias_kind":"pith_short_12","alias_value":"7BQYETGVGV45","created_at":"2026-07-05T09:43:31Z"},{"alias_kind":"pith_short_16","alias_value":"7BQYETGVGV453RRX","created_at":"2026-07-05T09:43:31Z"},{"alias_kind":"pith_short_8","alias_value":"7BQYETGV","created_at":"2026-07-05T09:43:31Z"}],"graph_snapshots":[{"event_id":"sha256:d667ed19380ec3dbf6b6a1acda9ead6fd219316fe8ce558a2a1bc5a0ba65d68c","target":"graph","created_at":"2026-07-05T09:43:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.06911/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chenglin Fan, Michael Dinitz, Rishi Chandra, Zongrui Zou","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-07-09T14:46:33Z","title":"Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.06911","kind":"arxiv","version":5},"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:583ab13369d654d04a2126a24cfcf789b07360e9ef1baefb15d89fcdf10057f1","target":"record","created_at":"2026-07-05T09:43:31Z","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":"139fcb9cd7a5969b8faf9c5029219322e769148c18c8a3696e544f75f1160cc5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-07-09T14:46:33Z","title_canon_sha256":"d76f703b1d57a2537868f0c90e4552fbc1a5709ec2e45203260b2fa4b4146500"},"schema_version":"1.0","source":{"id":"2407.06911","kind":"arxiv","version":5}},"canonical_sha256":"f861824cd53579ddc637d50cd8c44e5af41e6ea5faba970417ba195519f0fc44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f861824cd53579ddc637d50cd8c44e5af41e6ea5faba970417ba195519f0fc44","first_computed_at":"2026-07-05T09:43:31.284475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:43:31.284475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iJqOMTiMLUYeqUz3PIO++9GDU3AQejvjy3XTLBQlY/Ov4CV42Lwxsb5Pg/k3/k0BA2g+3Iw3g1zH0eRJkbzsAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:43:31.285194Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.06911","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:583ab13369d654d04a2126a24cfcf789b07360e9ef1baefb15d89fcdf10057f1","sha256:d667ed19380ec3dbf6b6a1acda9ead6fd219316fe8ce558a2a1bc5a0ba65d68c"],"state_sha256":"a3822383ba184e1a707ea775fc8111dcbaf4f298abd77b34a38d385ee5c5134e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ss/GuBFz/GFSeJsGT0wIbqwyojkXk3rltNyyLeQzonyYmasA35GCTSX5G/ifxNHQyhQcfG6PkZURIOjCu6izDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T04:32:25.342310Z","bundle_sha256":"00f1fcb3e86c110ef900a6cdb7d27a63dd07be0f21c11951798ab72f0a630917"}}