{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FDSOTL4ZOZGRRSC3TTSAN7ATD5","short_pith_number":"pith:FDSOTL4Z","schema_version":"1.0","canonical_sha256":"28e4e9af99764d18c85b9ce406fc131f400ae01733ab4fa1047fdf9c937083fa","source":{"kind":"arxiv","id":"2002.01501","version":2},"attestation_state":"computed","paper":{"title":"The Privacy Funnel from the viewpoint of Local Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Milan Lopuha\\\"a-Zwakenberg","submitted_at":"2020-02-04T19:16:00Z","abstract_excerpt":"We consider a database $\\vec{X} = (X_1,\\cdots,X_n)$ containing the data of $n$ users. The data aggregator wants to publicise the database, but wishes to sanitise the dataset to hide sensitive data $S_i$ correlated to $X_i$. This setting is considered in the Privacy Funnel, which uses mutual information as a leakage metric. The downsides to this approach are that mutual information does not give worst-case guarantees, and that finding optimal sanitisation protocols can be computationally prohibitive. We tackle these problems by using differential privacy metrics, and by considering local protoc"},"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":"2002.01501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-02-04T19:16:00Z","cross_cats_sorted":["cs.DB","cs.IT","math.IT"],"title_canon_sha256":"6505f73c09945bee9ff60dd5b18bee0737f87445c5b0fedb919032c1fde0ed76","abstract_canon_sha256":"9e3e1342a91e4a2318d668c06d82ea7de547c24654abd5f7fea64de561587634"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:46:20.444700Z","signature_b64":"fDZDaaYfJw+ffG+6nG1dG+QaIchuKhrAlZb5dHQZuNOAlygq/f8+w0JZPz6W5EE5yifImlnapIK1URum0c4yDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28e4e9af99764d18c85b9ce406fc131f400ae01733ab4fa1047fdf9c937083fa","last_reissued_at":"2026-07-05T00:46:20.444205Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:46:20.444205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Privacy Funnel from the viewpoint of Local Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Milan Lopuha\\\"a-Zwakenberg","submitted_at":"2020-02-04T19:16:00Z","abstract_excerpt":"We consider a database $\\vec{X} = (X_1,\\cdots,X_n)$ containing the data of $n$ users. The data aggregator wants to publicise the database, but wishes to sanitise the dataset to hide sensitive data $S_i$ correlated to $X_i$. This setting is considered in the Privacy Funnel, which uses mutual information as a leakage metric. The downsides to this approach are that mutual information does not give worst-case guarantees, and that finding optimal sanitisation protocols can be computationally prohibitive. We tackle these problems by using differential privacy metrics, and by considering local protoc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01501","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/2002.01501/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":"2002.01501","created_at":"2026-07-05T00:46:20.444261+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.01501v2","created_at":"2026-07-05T00:46:20.444261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01501","created_at":"2026-07-05T00:46:20.444261+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDSOTL4ZOZGR","created_at":"2026-07-05T00:46:20.444261+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDSOTL4ZOZGRRSC3","created_at":"2026-07-05T00:46:20.444261+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDSOTL4Z","created_at":"2026-07-05T00:46:20.444261+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23096","citing_title":"Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FDSOTL4ZOZGRRSC3TTSAN7ATD5","json":"https://pith.science/pith/FDSOTL4ZOZGRRSC3TTSAN7ATD5.json","graph_json":"https://pith.science/api/pith-number/FDSOTL4ZOZGRRSC3TTSAN7ATD5/graph.json","events_json":"https://pith.science/api/pith-number/FDSOTL4ZOZGRRSC3TTSAN7ATD5/events.json","paper":"https://pith.science/paper/FDSOTL4Z"},"agent_actions":{"view_html":"https://pith.science/pith/FDSOTL4ZOZGRRSC3TTSAN7ATD5","download_json":"https://pith.science/pith/FDSOTL4ZOZGRRSC3TTSAN7ATD5.json","view_paper":"https://pith.science/paper/FDSOTL4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.01501&json=true","fetch_graph":"https://pith.science/api/pith-number/FDSOTL4ZOZGRRSC3TTSAN7ATD5/graph.json","fetch_events":"https://pith.science/api/pith-number/FDSOTL4ZOZGRRSC3TTSAN7ATD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDSOTL4ZOZGRRSC3TTSAN7ATD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDSOTL4ZOZGRRSC3TTSAN7ATD5/action/storage_attestation","attest_author":"https://pith.science/pith/FDSOTL4ZOZGRRSC3TTSAN7ATD5/action/author_attestation","sign_citation":"https://pith.science/pith/FDSOTL4ZOZGRRSC3TTSAN7ATD5/action/citation_signature","submit_replication":"https://pith.science/pith/FDSOTL4ZOZGRRSC3TTSAN7ATD5/action/replication_record"}},"created_at":"2026-07-05T00:46:20.444261+00:00","updated_at":"2026-07-05T00:46:20.444261+00:00"}