{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GFBNZIIMQGF2ERPNDHDDZCPGUC","short_pith_number":"pith:GFBNZIIM","schema_version":"1.0","canonical_sha256":"3142dca10c818ba245ed19c63c89e6a0a49ef00d8242df88e790eb9a40f79ec6","source":{"kind":"arxiv","id":"1712.05888","version":1},"attestation_state":"computed","paper":{"title":"One-sided Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ashwin Machanavajjhala, Ios Kotsogiannis, Samuel Haney, Sharad Mehrotra, Stelios Doudalis","submitted_at":"2017-12-16T01:29:27Z","abstract_excerpt":"In this paper, we study the problem of privacy-preserving data sharing, wherein only a subset of the records in a database are sensitive, possibly based on predefined privacy policies. Existing solutions, viz, differential privacy (DP), are over-pessimistic and treat all information as sensitive. Alternatively, techniques, like access control and personalized differential privacy, reveal all non-sensitive records truthfully, and they indirectly leak information about sensitive records through exclusion attacks.\n  Motivated by the limitations of prior work, we introduce the notion of one-sided "},"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":"1712.05888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-12-16T01:29:27Z","cross_cats_sorted":[],"title_canon_sha256":"4e53cead68cedf6547409632c8fb659c9ddb43bd1c19d84405e5e22c6fba1c55","abstract_canon_sha256":"340fabd1554efad6ac59eeea27ffe4e8e1fd0aaa54d1f8ad6dd9609024f936ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:51.625082Z","signature_b64":"QqY+39DTrlXIOis10y0CBRiNyBlpTdoQYRHaQhpznb9BqltWd0HvDTPvnQIji+uvWtg05tSjNSBnQgJ8Ul7CDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3142dca10c818ba245ed19c63c89e6a0a49ef00d8242df88e790eb9a40f79ec6","last_reissued_at":"2026-05-18T00:27:51.624530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:51.624530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-sided Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ashwin Machanavajjhala, Ios Kotsogiannis, Samuel Haney, Sharad Mehrotra, Stelios Doudalis","submitted_at":"2017-12-16T01:29:27Z","abstract_excerpt":"In this paper, we study the problem of privacy-preserving data sharing, wherein only a subset of the records in a database are sensitive, possibly based on predefined privacy policies. Existing solutions, viz, differential privacy (DP), are over-pessimistic and treat all information as sensitive. Alternatively, techniques, like access control and personalized differential privacy, reveal all non-sensitive records truthfully, and they indirectly leak information about sensitive records through exclusion attacks.\n  Motivated by the limitations of prior work, we introduce the notion of one-sided "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05888","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":""},"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":"1712.05888","created_at":"2026-05-18T00:27:51.624606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05888v1","created_at":"2026-05-18T00:27:51.624606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05888","created_at":"2026-05-18T00:27:51.624606+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFBNZIIMQGF2","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFBNZIIMQGF2ERPN","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFBNZIIM","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.11515","citing_title":"Improving Utility and Security of the Shuffler-based Differential Privacy","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GFBNZIIMQGF2ERPNDHDDZCPGUC","json":"https://pith.science/pith/GFBNZIIMQGF2ERPNDHDDZCPGUC.json","graph_json":"https://pith.science/api/pith-number/GFBNZIIMQGF2ERPNDHDDZCPGUC/graph.json","events_json":"https://pith.science/api/pith-number/GFBNZIIMQGF2ERPNDHDDZCPGUC/events.json","paper":"https://pith.science/paper/GFBNZIIM"},"agent_actions":{"view_html":"https://pith.science/pith/GFBNZIIMQGF2ERPNDHDDZCPGUC","download_json":"https://pith.science/pith/GFBNZIIMQGF2ERPNDHDDZCPGUC.json","view_paper":"https://pith.science/paper/GFBNZIIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05888&json=true","fetch_graph":"https://pith.science/api/pith-number/GFBNZIIMQGF2ERPNDHDDZCPGUC/graph.json","fetch_events":"https://pith.science/api/pith-number/GFBNZIIMQGF2ERPNDHDDZCPGUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFBNZIIMQGF2ERPNDHDDZCPGUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFBNZIIMQGF2ERPNDHDDZCPGUC/action/storage_attestation","attest_author":"https://pith.science/pith/GFBNZIIMQGF2ERPNDHDDZCPGUC/action/author_attestation","sign_citation":"https://pith.science/pith/GFBNZIIMQGF2ERPNDHDDZCPGUC/action/citation_signature","submit_replication":"https://pith.science/pith/GFBNZIIMQGF2ERPNDHDDZCPGUC/action/replication_record"}},"created_at":"2026-05-18T00:27:51.624606+00:00","updated_at":"2026-05-18T00:27:51.624606+00:00"}