{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:V6EVKT5RYGEG5A2OCILUK5AFKW","short_pith_number":"pith:V6EVKT5R","schema_version":"1.0","canonical_sha256":"af89554fb1c1886e834e1217457405559eca7aa2ab3ca8c2c82270566e78780b","source":{"kind":"arxiv","id":"1107.3731","version":2},"attestation_state":"computed","paper":{"title":"Iterative Constructions and Private Data Release","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Anupam Gupta, Jonathan Ullman","submitted_at":"2011-07-19T14:54:46Z","abstract_excerpt":"In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of existing algorithms) in both the interactive and non-interactive settings.\n  Our algorithms in the interactive setting are achieved by revisiting the problem of releasing differentially private, approximate answers to a large number of queries on a database. We show that several algorithms for this problem fall into the same basic framework, and are based on the existence of objects which we call iterative database constru"},"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":"1107.3731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-19T14:54:46Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"40a8c79c0bf2ed486f409cd535349d847400ce743d5833f3372fcf0d3cf79f0d","abstract_canon_sha256":"236043c6d7771eec824942b405deeac5f1acb86980b33c85579ac40d4855b431"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:02.199785Z","signature_b64":"OqsuPKYUCFO00Kj+PotUxztze4gs8IuWfLVaBQcoiaEbmilB18vO2k+LMGeoKb0d2GrbWjx5r72CY1idCvBBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af89554fb1c1886e834e1217457405559eca7aa2ab3ca8c2c82270566e78780b","last_reissued_at":"2026-05-18T04:17:02.199122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:02.199122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Constructions and Private Data Release","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Anupam Gupta, Jonathan Ullman","submitted_at":"2011-07-19T14:54:46Z","abstract_excerpt":"In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of existing algorithms) in both the interactive and non-interactive settings.\n  Our algorithms in the interactive setting are achieved by revisiting the problem of releasing differentially private, approximate answers to a large number of queries on a database. We show that several algorithms for this problem fall into the same basic framework, and are based on the existence of objects which we call iterative database constru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3731","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.3731","created_at":"2026-05-18T04:17:02.199227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3731v2","created_at":"2026-05-18T04:17:02.199227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3731","created_at":"2026-05-18T04:17:02.199227+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6EVKT5RYGEG","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6EVKT5RYGEG5A2O","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6EVKT5R","created_at":"2026-05-18T12:26:42.757692+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/V6EVKT5RYGEG5A2OCILUK5AFKW","json":"https://pith.science/pith/V6EVKT5RYGEG5A2OCILUK5AFKW.json","graph_json":"https://pith.science/api/pith-number/V6EVKT5RYGEG5A2OCILUK5AFKW/graph.json","events_json":"https://pith.science/api/pith-number/V6EVKT5RYGEG5A2OCILUK5AFKW/events.json","paper":"https://pith.science/paper/V6EVKT5R"},"agent_actions":{"view_html":"https://pith.science/pith/V6EVKT5RYGEG5A2OCILUK5AFKW","download_json":"https://pith.science/pith/V6EVKT5RYGEG5A2OCILUK5AFKW.json","view_paper":"https://pith.science/paper/V6EVKT5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3731&json=true","fetch_graph":"https://pith.science/api/pith-number/V6EVKT5RYGEG5A2OCILUK5AFKW/graph.json","fetch_events":"https://pith.science/api/pith-number/V6EVKT5RYGEG5A2OCILUK5AFKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6EVKT5RYGEG5A2OCILUK5AFKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6EVKT5RYGEG5A2OCILUK5AFKW/action/storage_attestation","attest_author":"https://pith.science/pith/V6EVKT5RYGEG5A2OCILUK5AFKW/action/author_attestation","sign_citation":"https://pith.science/pith/V6EVKT5RYGEG5A2OCILUK5AFKW/action/citation_signature","submit_replication":"https://pith.science/pith/V6EVKT5RYGEG5A2OCILUK5AFKW/action/replication_record"}},"created_at":"2026-05-18T04:17:02.199227+00:00","updated_at":"2026-05-18T04:17:02.199227+00:00"}