{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WVW4S2MLIBJFFOMHKBF6AQJDV5","short_pith_number":"pith:WVW4S2ML","canonical_record":{"source":{"id":"2607.18846","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-21T08:35:05Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"d285f3a637b25a182bb9a57e7377f5c8ae0d735475fb43ab0d63648a8635e92e","abstract_canon_sha256":"721adf4b92ecc4a5ea9766e21585522fee48cc59383ab275bfd145fb72b3e0d9"},"schema_version":"1.0"},"canonical_sha256":"b56dc9698b405252b987504be04123af620ed17451d91d96c4ac03203bebca14","source":{"kind":"arxiv","id":"2607.18846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.18846","created_at":"2026-07-22T01:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"2607.18846v1","created_at":"2026-07-22T01:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18846","created_at":"2026-07-22T01:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"WVW4S2MLIBJF","created_at":"2026-07-22T01:23:15Z"},{"alias_kind":"pith_short_16","alias_value":"WVW4S2MLIBJFFOMH","created_at":"2026-07-22T01:23:15Z"},{"alias_kind":"pith_short_8","alias_value":"WVW4S2ML","created_at":"2026-07-22T01:23:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WVW4S2MLIBJFFOMHKBF6AQJDV5","target":"record","payload":{"canonical_record":{"source":{"id":"2607.18846","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-21T08:35:05Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"d285f3a637b25a182bb9a57e7377f5c8ae0d735475fb43ab0d63648a8635e92e","abstract_canon_sha256":"721adf4b92ecc4a5ea9766e21585522fee48cc59383ab275bfd145fb72b3e0d9"},"schema_version":"1.0"},"canonical_sha256":"b56dc9698b405252b987504be04123af620ed17451d91d96c4ac03203bebca14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T01:23:15.650100Z","signature_b64":"7OQeefyX0SWHfGsKpRXnDLjdE6YETIt1Z3r3JCm+CGNovvaKIj4OtLiaSDwkVZFQC9+Mpg1dWxkQNyA5nss+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b56dc9698b405252b987504be04123af620ed17451d91d96c4ac03203bebca14","last_reissued_at":"2026-07-22T01:23:15.649151Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T01:23:15.649151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.18846","source_version":1,"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-22T01:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2lFzzcJ1zVXr/KO0Re95z2mWXCjh1LoLyHJm5XRB3PkuzKNnQycK6cpUhO/o3HO69stn+zHIOkEHPqcrTtt5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:19:50.510867Z"},"content_sha256":"ba5ef995d63b590c486d4c72e1945b3e1fedeca5ed3b2d97cd262b9938609120","schema_version":"1.0","event_id":"sha256:ba5ef995d63b590c486d4c72e1945b3e1fedeca5ed3b2d97cd262b9938609120"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WVW4S2MLIBJFFOMHKBF6AQJDV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Private Approximation of Graph Spectra and Cuts via Spectral Amplifiers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Chenglin Fan, Hangyu Xu, Jingcheng Liu, Pan Peng, Zongrui Zou","submitted_at":"2026-07-21T08:35:05Z","abstract_excerpt":"We study the problem of releasing a synthetic graph that approximates the sizes of all cuts of an input graph under edge-level differential privacy. If one insists on purely additive error, the optimal worst-case error is $\\widetilde\\Theta(n^{3/2})$. If one allows a small multiplicative slack, an information-theoretic exponential-time mechanism achieves nearly linear additive error, but the best known polynomial-time algorithms have substantially larger error. We give a polynomial-time $(\\varepsilon,\\delta)$-differentially private algorithm which, for every $n$-vertex unweighted graph $G$, out"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18846","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/2607.18846/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-22T01:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utKF5W8Hq1wLwS9PYHfPILF+yiUJAJACBgbZCrhXCqfuEfiZRKAY415t8JBO/ycE0uUvZ4uEoaLOq1FS+aAEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:19:50.511790Z"},"content_sha256":"64e497253e2268465b25c9d62ca9d9939211069e0651b72628dba4a0fa457531","schema_version":"1.0","event_id":"sha256:64e497253e2268465b25c9d62ca9d9939211069e0651b72628dba4a0fa457531"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVW4S2MLIBJFFOMHKBF6AQJDV5/bundle.json","state_url":"https://pith.science/pith/WVW4S2MLIBJFFOMHKBF6AQJDV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVW4S2MLIBJFFOMHKBF6AQJDV5/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-06T13:19:50Z","links":{"resolver":"https://pith.science/pith/WVW4S2MLIBJFFOMHKBF6AQJDV5","bundle":"https://pith.science/pith/WVW4S2MLIBJFFOMHKBF6AQJDV5/bundle.json","state":"https://pith.science/pith/WVW4S2MLIBJFFOMHKBF6AQJDV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVW4S2MLIBJFFOMHKBF6AQJDV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WVW4S2MLIBJFFOMHKBF6AQJDV5","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":"721adf4b92ecc4a5ea9766e21585522fee48cc59383ab275bfd145fb72b3e0d9","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-21T08:35:05Z","title_canon_sha256":"d285f3a637b25a182bb9a57e7377f5c8ae0d735475fb43ab0d63648a8635e92e"},"schema_version":"1.0","source":{"id":"2607.18846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.18846","created_at":"2026-07-22T01:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"2607.18846v1","created_at":"2026-07-22T01:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18846","created_at":"2026-07-22T01:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"WVW4S2MLIBJF","created_at":"2026-07-22T01:23:15Z"},{"alias_kind":"pith_short_16","alias_value":"WVW4S2MLIBJFFOMH","created_at":"2026-07-22T01:23:15Z"},{"alias_kind":"pith_short_8","alias_value":"WVW4S2ML","created_at":"2026-07-22T01:23:15Z"}],"graph_snapshots":[{"event_id":"sha256:64e497253e2268465b25c9d62ca9d9939211069e0651b72628dba4a0fa457531","target":"graph","created_at":"2026-07-22T01:23:15Z","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/2607.18846/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of releasing a synthetic graph that approximates the sizes of all cuts of an input graph under edge-level differential privacy. If one insists on purely additive error, the optimal worst-case error is $\\widetilde\\Theta(n^{3/2})$. If one allows a small multiplicative slack, an information-theoretic exponential-time mechanism achieves nearly linear additive error, but the best known polynomial-time algorithms have substantially larger error. We give a polynomial-time $(\\varepsilon,\\delta)$-differentially private algorithm which, for every $n$-vertex unweighted graph $G$, out","authors_text":"Chenglin Fan, Hangyu Xu, Jingcheng Liu, Pan Peng, Zongrui Zou","cross_cats":["cs.CR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-21T08:35:05Z","title":"Private Approximation of Graph Spectra and Cuts via Spectral Amplifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18846","kind":"arxiv","version":1},"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:ba5ef995d63b590c486d4c72e1945b3e1fedeca5ed3b2d97cd262b9938609120","target":"record","created_at":"2026-07-22T01:23:15Z","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":"721adf4b92ecc4a5ea9766e21585522fee48cc59383ab275bfd145fb72b3e0d9","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-21T08:35:05Z","title_canon_sha256":"d285f3a637b25a182bb9a57e7377f5c8ae0d735475fb43ab0d63648a8635e92e"},"schema_version":"1.0","source":{"id":"2607.18846","kind":"arxiv","version":1}},"canonical_sha256":"b56dc9698b405252b987504be04123af620ed17451d91d96c4ac03203bebca14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b56dc9698b405252b987504be04123af620ed17451d91d96c4ac03203bebca14","first_computed_at":"2026-07-22T01:23:15.649151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-22T01:23:15.649151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7OQeefyX0SWHfGsKpRXnDLjdE6YETIt1Z3r3JCm+CGNovvaKIj4OtLiaSDwkVZFQC9+Mpg1dWxkQNyA5nss+AA==","signature_status":"signed_v1","signed_at":"2026-07-22T01:23:15.650100Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.18846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba5ef995d63b590c486d4c72e1945b3e1fedeca5ed3b2d97cd262b9938609120","sha256:64e497253e2268465b25c9d62ca9d9939211069e0651b72628dba4a0fa457531"],"state_sha256":"b2c1f2f07a737c687a3264d7cfad3db48571f1ce0fe882b67f554ca843a07dee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwYUK5zLZ2+ZW7TnRtvwvnMfx9dP0uuh5PFfz/+fLzwDSVfmecXXZWJtkgjJ9Zr7h7dxyCHC9YlbDJX1xv8wCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T13:19:50.518119Z","bundle_sha256":"c84fb551845f7b19576d67846c2f56ba9757b3623d676eb3aef51e4dac09d12e"}}