{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XPHJXGGH6GAD547ZFWQJT3DKUD","short_pith_number":"pith:XPHJXGGH","schema_version":"1.0","canonical_sha256":"bbce9b98c7f1803ef3f92da099ec6aa0d8cb35fa932b15ebe3477a7b85792525","source":{"kind":"arxiv","id":"2201.12677","version":2},"attestation_state":"computed","paper":{"title":"AIM: An Adaptive and Iterative Mechanism for Differentially Private Synthetic Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Brett Mullins, Daniel Sheldon, Gerome Miklau, Ryan McKenna","submitted_at":"2022-01-29T23:02:24Z","abstract_excerpt":"We propose AIM, a new algorithm for differentially private synthetic data generation. AIM is a workload-adaptive algorithm within the paradigm of algorithms that first selects a set of queries, then privately measures those queries, and finally generates synthetic data from the noisy measurements. It uses a set of innovative features to iteratively select the most useful measurements, reflecting both their relevance to the workload and their value in approximating the input data. We also provide analytic expressions to bound per-query error with high probability which can be used to construct "},"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":"2201.12677","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-01-29T23:02:24Z","cross_cats_sorted":[],"title_canon_sha256":"a74fafcb8e7894edc816303698101788601a752593313adc9216f91ba4da660a","abstract_canon_sha256":"26cf4020dc5cd299ea7b023f3ecc78676ac5a2717d065c1164ab3b09f94afd85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:01.591359Z","signature_b64":"h8SOJklxn2Gtpp1EX5ckPK1++5opKW7LHqRaHPdjwm2MG88GvvD2ux99i224r427Nu1H3Jcu3VYSYzJcKAUqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbce9b98c7f1803ef3f92da099ec6aa0d8cb35fa932b15ebe3477a7b85792525","last_reissued_at":"2026-07-05T08:31:01.590869Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:01.590869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AIM: An Adaptive and Iterative Mechanism for Differentially Private Synthetic Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Brett Mullins, Daniel Sheldon, Gerome Miklau, Ryan McKenna","submitted_at":"2022-01-29T23:02:24Z","abstract_excerpt":"We propose AIM, a new algorithm for differentially private synthetic data generation. AIM is a workload-adaptive algorithm within the paradigm of algorithms that first selects a set of queries, then privately measures those queries, and finally generates synthetic data from the noisy measurements. It uses a set of innovative features to iteratively select the most useful measurements, reflecting both their relevance to the workload and their value in approximating the input data. We also provide analytic expressions to bound per-query error with high probability which can be used to construct "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12677","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.12677/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":"2201.12677","created_at":"2026-07-05T08:31:01.590927+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12677v2","created_at":"2026-07-05T08:31:01.590927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12677","created_at":"2026-07-05T08:31:01.590927+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPHJXGGH6GAD","created_at":"2026-07-05T08:31:01.590927+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPHJXGGH6GAD547Z","created_at":"2026-07-05T08:31:01.590927+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPHJXGGH","created_at":"2026-07-05T08:31:01.590927+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08372","citing_title":"SoK: Reconstruction Attacks on Synthetic Tabular Data (Insights from Winning the NIST CRC)","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08259","citing_title":"Differentially Private Synthetic Data via APIs 4: Tabular Data","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.24295","citing_title":"Private Adaptive Covariance Estimation via Gaussian Graphical Models","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2305.08175","citing_title":"ResidualPlanner+: a scalable matrix mechanism for marginals and beyond","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2507.02971","citing_title":"Aim High, Stay Private: Differentially Private Synthetic Data Enables Public Release of Behavioral Health Information with High Utility","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14495","citing_title":"Decoupling Identity from Utility: Privacy-by-Design Frameworks for Financial Ecosystems","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15660","citing_title":"DPDSyn: Improving Differentially Private Dataset Synthesis for Model Training by Downstream Task Guidance","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XPHJXGGH6GAD547ZFWQJT3DKUD","json":"https://pith.science/pith/XPHJXGGH6GAD547ZFWQJT3DKUD.json","graph_json":"https://pith.science/api/pith-number/XPHJXGGH6GAD547ZFWQJT3DKUD/graph.json","events_json":"https://pith.science/api/pith-number/XPHJXGGH6GAD547ZFWQJT3DKUD/events.json","paper":"https://pith.science/paper/XPHJXGGH"},"agent_actions":{"view_html":"https://pith.science/pith/XPHJXGGH6GAD547ZFWQJT3DKUD","download_json":"https://pith.science/pith/XPHJXGGH6GAD547ZFWQJT3DKUD.json","view_paper":"https://pith.science/paper/XPHJXGGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12677&json=true","fetch_graph":"https://pith.science/api/pith-number/XPHJXGGH6GAD547ZFWQJT3DKUD/graph.json","fetch_events":"https://pith.science/api/pith-number/XPHJXGGH6GAD547ZFWQJT3DKUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPHJXGGH6GAD547ZFWQJT3DKUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPHJXGGH6GAD547ZFWQJT3DKUD/action/storage_attestation","attest_author":"https://pith.science/pith/XPHJXGGH6GAD547ZFWQJT3DKUD/action/author_attestation","sign_citation":"https://pith.science/pith/XPHJXGGH6GAD547ZFWQJT3DKUD/action/citation_signature","submit_replication":"https://pith.science/pith/XPHJXGGH6GAD547ZFWQJT3DKUD/action/replication_record"}},"created_at":"2026-07-05T08:31:01.590927+00:00","updated_at":"2026-07-05T08:31:01.590927+00:00"}