{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TFMQQYP2K3LWJPV6WCWDRB4BVO","short_pith_number":"pith:TFMQQYP2","schema_version":"1.0","canonical_sha256":"99590861fa56d764bebeb0ac388781ab890ba71c8399dee8550ba6092880622c","source":{"kind":"arxiv","id":"1402.5029","version":3},"attestation_state":"computed","paper":{"title":"Optimal Geo-Indistinguishable Mechanisms for Location Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Catuscia Palamidessi, Konstantinos Chatzikokolakis, Nicol\\'as E. Bordenabe","submitted_at":"2014-02-20T15:21:42Z","abstract_excerpt":"We consider the geo-indistinguishability approach to location privacy, and the trade-off with respect to utility. We show that, given a desired degree of geo-indistinguishability, it is possible to construct a mechanism that minimizes the service quality loss, using linear programming techniques. In addition we show that, under certain conditions, such mechanism also provides optimal privacy in the sense of Shokri et al. Furthermore, we propose a method to reduce the number of constraints of the linear program from cubic to quadratic, maintaining the privacy guarantees and without affecting si"},"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":"1402.5029","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-20T15:21:42Z","cross_cats_sorted":[],"title_canon_sha256":"fd2cec74475fa756b28d4d471d4c1581395d784ad99672d0af09d45eead5b8a8","abstract_canon_sha256":"6e1a135d31d2cdfd2a27f18af482235e905c8172246af573af1bdb1fd872c4f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:31.331050Z","signature_b64":"52EOG+8Lae8PgKOtorcKvLCFIzbRCwTffpquOBgB6ucm1AHPl8NeBl1J7/toiwUixBjxo8Wh8rHXofOC2hi3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99590861fa56d764bebeb0ac388781ab890ba71c8399dee8550ba6092880622c","last_reissued_at":"2026-05-18T02:44:31.330488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:31.330488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Geo-Indistinguishable Mechanisms for Location Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Catuscia Palamidessi, Konstantinos Chatzikokolakis, Nicol\\'as E. Bordenabe","submitted_at":"2014-02-20T15:21:42Z","abstract_excerpt":"We consider the geo-indistinguishability approach to location privacy, and the trade-off with respect to utility. We show that, given a desired degree of geo-indistinguishability, it is possible to construct a mechanism that minimizes the service quality loss, using linear programming techniques. In addition we show that, under certain conditions, such mechanism also provides optimal privacy in the sense of Shokri et al. Furthermore, we propose a method to reduce the number of constraints of the linear program from cubic to quadratic, maintaining the privacy guarantees and without affecting si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5029","kind":"arxiv","version":3},"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":"1402.5029","created_at":"2026-05-18T02:44:31.330572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5029v3","created_at":"2026-05-18T02:44:31.330572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5029","created_at":"2026-05-18T02:44:31.330572+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFMQQYP2K3LW","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFMQQYP2K3LWJPV6","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFMQQYP2","created_at":"2026-05-18T12:28:49.207871+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/TFMQQYP2K3LWJPV6WCWDRB4BVO","json":"https://pith.science/pith/TFMQQYP2K3LWJPV6WCWDRB4BVO.json","graph_json":"https://pith.science/api/pith-number/TFMQQYP2K3LWJPV6WCWDRB4BVO/graph.json","events_json":"https://pith.science/api/pith-number/TFMQQYP2K3LWJPV6WCWDRB4BVO/events.json","paper":"https://pith.science/paper/TFMQQYP2"},"agent_actions":{"view_html":"https://pith.science/pith/TFMQQYP2K3LWJPV6WCWDRB4BVO","download_json":"https://pith.science/pith/TFMQQYP2K3LWJPV6WCWDRB4BVO.json","view_paper":"https://pith.science/paper/TFMQQYP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5029&json=true","fetch_graph":"https://pith.science/api/pith-number/TFMQQYP2K3LWJPV6WCWDRB4BVO/graph.json","fetch_events":"https://pith.science/api/pith-number/TFMQQYP2K3LWJPV6WCWDRB4BVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFMQQYP2K3LWJPV6WCWDRB4BVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFMQQYP2K3LWJPV6WCWDRB4BVO/action/storage_attestation","attest_author":"https://pith.science/pith/TFMQQYP2K3LWJPV6WCWDRB4BVO/action/author_attestation","sign_citation":"https://pith.science/pith/TFMQQYP2K3LWJPV6WCWDRB4BVO/action/citation_signature","submit_replication":"https://pith.science/pith/TFMQQYP2K3LWJPV6WCWDRB4BVO/action/replication_record"}},"created_at":"2026-05-18T02:44:31.330572+00:00","updated_at":"2026-05-18T02:44:31.330572+00:00"}