{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5JZBGOPQHO6GVDAY4JFS44XVRB","short_pith_number":"pith:5JZBGOPQ","schema_version":"1.0","canonical_sha256":"ea721339f03bbc6a8c18e24b2e72f5884f5c6aae662798bc9305443ea719e028","source":{"kind":"arxiv","id":"1102.3751","version":4},"attestation_state":"computed","paper":{"title":"Utility-Privacy Tradeoff in Databases: An Information-theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Lalitha Sankar, S. Raj Rajagopalan","submitted_at":"2011-02-18T04:23:48Z","abstract_excerpt":"Ensuring the usefulness of electronic data sources while providing necessary privacy guarantees is an important unsolved problem. This problem drives the need for an analytical framework that can quantify the safety of personally identifiable information (privacy) while still providing a quantifable benefit (utility) to multiple legitimate information consumers. This paper presents an information-theoretic framework that promises an analytical model guaranteeing tight bounds of how much utility is possible for a given level of privacy and vice-versa. Specific contributions include: i) stochast"},"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":"1102.3751","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-18T04:23:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cde890ae053815ac4728fc4cd662452c6de25fb738705467fccc68cae4fb8caf","abstract_canon_sha256":"5fa7ab141990c900034850825dc0e0f2b6fd56a2960e432a5cf0b97aa9180fde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.460721Z","signature_b64":"ChSkiE8fAsLKi2zxSxyeKdOyR/vLe9OkMMH2hxSFUVZ3jwK5p8MLIVeBGQSCMRgpJGiB+gZ2e9wFnqPBhVlyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea721339f03bbc6a8c18e24b2e72f5884f5c6aae662798bc9305443ea719e028","last_reissued_at":"2026-05-18T00:57:57.460358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.460358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Utility-Privacy Tradeoff in Databases: An Information-theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Lalitha Sankar, S. Raj Rajagopalan","submitted_at":"2011-02-18T04:23:48Z","abstract_excerpt":"Ensuring the usefulness of electronic data sources while providing necessary privacy guarantees is an important unsolved problem. This problem drives the need for an analytical framework that can quantify the safety of personally identifiable information (privacy) while still providing a quantifable benefit (utility) to multiple legitimate information consumers. This paper presents an information-theoretic framework that promises an analytical model guaranteeing tight bounds of how much utility is possible for a given level of privacy and vice-versa. Specific contributions include: i) stochast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3751","kind":"arxiv","version":4},"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":"1102.3751","created_at":"2026-05-18T00:57:57.460412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3751v4","created_at":"2026-05-18T00:57:57.460412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3751","created_at":"2026-05-18T00:57:57.460412+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JZBGOPQHO6G","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JZBGOPQHO6GVDAY","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JZBGOPQ","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.11742","citing_title":"Cross-Flow Correlations Survive Synthesis: Measuring Source-Level Privacy Leakage in Synthetic Network Traces","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5JZBGOPQHO6GVDAY4JFS44XVRB","json":"https://pith.science/pith/5JZBGOPQHO6GVDAY4JFS44XVRB.json","graph_json":"https://pith.science/api/pith-number/5JZBGOPQHO6GVDAY4JFS44XVRB/graph.json","events_json":"https://pith.science/api/pith-number/5JZBGOPQHO6GVDAY4JFS44XVRB/events.json","paper":"https://pith.science/paper/5JZBGOPQ"},"agent_actions":{"view_html":"https://pith.science/pith/5JZBGOPQHO6GVDAY4JFS44XVRB","download_json":"https://pith.science/pith/5JZBGOPQHO6GVDAY4JFS44XVRB.json","view_paper":"https://pith.science/paper/5JZBGOPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3751&json=true","fetch_graph":"https://pith.science/api/pith-number/5JZBGOPQHO6GVDAY4JFS44XVRB/graph.json","fetch_events":"https://pith.science/api/pith-number/5JZBGOPQHO6GVDAY4JFS44XVRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JZBGOPQHO6GVDAY4JFS44XVRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JZBGOPQHO6GVDAY4JFS44XVRB/action/storage_attestation","attest_author":"https://pith.science/pith/5JZBGOPQHO6GVDAY4JFS44XVRB/action/author_attestation","sign_citation":"https://pith.science/pith/5JZBGOPQHO6GVDAY4JFS44XVRB/action/citation_signature","submit_replication":"https://pith.science/pith/5JZBGOPQHO6GVDAY4JFS44XVRB/action/replication_record"}},"created_at":"2026-05-18T00:57:57.460412+00:00","updated_at":"2026-05-18T00:57:57.460412+00:00"}