{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RYVL4QKKYBACQX466ANRJTLPT3","short_pith_number":"pith:RYVL4QKK","schema_version":"1.0","canonical_sha256":"8e2abe414ac040285f9ef01b14cd6f9ef473fb55df953520344ac3cbe6c9d167","source":{"kind":"arxiv","id":"1710.05524","version":1},"attestation_state":"computed","paper":{"title":"Trading Optimality for Performance in Location Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ali Kassem, Catuscia Palamidessi, Konstantinos Chatzikokolakis, Serge Haddad","submitted_at":"2017-10-16T06:04:48Z","abstract_excerpt":"Location-Based Services (LBSs) provide invaluable aid in the everyday activities of many individuals, however they also pose serious threats to the user' privacy. There is, therefore, a growing interest in the development of mechanisms to protect location privacy during the use of LBSs. Nowadays, the most popular methods are probabilistic, and the so-called optimal method achieves an optimal trade-off between privacy and utility by using linear optimization techniques. Unfortunately, due to the complexity of linear programming, the method is unfeasible for a large number n of locations, becaus"},"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":"1710.05524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-10-16T06:04:48Z","cross_cats_sorted":[],"title_canon_sha256":"8109478a4675a35d97e03cf16fb14f6468f4f59392bc8b5775c31d38821f82d9","abstract_canon_sha256":"5224d94799c7f54bf65f74a85b5432875db39b3d116bc9db890e71423f5c747c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:49.074294Z","signature_b64":"PxBbycH6WSdNQWBuUDCDi2ltIeC3ie6HyKa/Uw+3kxc/Xui+LtUdFM/bZO3Akf9pheZhFFMMEmFGDoZMmtynBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e2abe414ac040285f9ef01b14cd6f9ef473fb55df953520344ac3cbe6c9d167","last_reissued_at":"2026-05-18T00:32:49.073617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:49.073617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trading Optimality for Performance in Location Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ali Kassem, Catuscia Palamidessi, Konstantinos Chatzikokolakis, Serge Haddad","submitted_at":"2017-10-16T06:04:48Z","abstract_excerpt":"Location-Based Services (LBSs) provide invaluable aid in the everyday activities of many individuals, however they also pose serious threats to the user' privacy. There is, therefore, a growing interest in the development of mechanisms to protect location privacy during the use of LBSs. Nowadays, the most popular methods are probabilistic, and the so-called optimal method achieves an optimal trade-off between privacy and utility by using linear optimization techniques. Unfortunately, due to the complexity of linear programming, the method is unfeasible for a large number n of locations, becaus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05524","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":"1710.05524","created_at":"2026-05-18T00:32:49.073717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05524v1","created_at":"2026-05-18T00:32:49.073717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05524","created_at":"2026-05-18T00:32:49.073717+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYVL4QKKYBAC","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYVL4QKKYBACQX46","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYVL4QKK","created_at":"2026-05-18T12:31:43.269735+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/RYVL4QKKYBACQX466ANRJTLPT3","json":"https://pith.science/pith/RYVL4QKKYBACQX466ANRJTLPT3.json","graph_json":"https://pith.science/api/pith-number/RYVL4QKKYBACQX466ANRJTLPT3/graph.json","events_json":"https://pith.science/api/pith-number/RYVL4QKKYBACQX466ANRJTLPT3/events.json","paper":"https://pith.science/paper/RYVL4QKK"},"agent_actions":{"view_html":"https://pith.science/pith/RYVL4QKKYBACQX466ANRJTLPT3","download_json":"https://pith.science/pith/RYVL4QKKYBACQX466ANRJTLPT3.json","view_paper":"https://pith.science/paper/RYVL4QKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05524&json=true","fetch_graph":"https://pith.science/api/pith-number/RYVL4QKKYBACQX466ANRJTLPT3/graph.json","fetch_events":"https://pith.science/api/pith-number/RYVL4QKKYBACQX466ANRJTLPT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYVL4QKKYBACQX466ANRJTLPT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYVL4QKKYBACQX466ANRJTLPT3/action/storage_attestation","attest_author":"https://pith.science/pith/RYVL4QKKYBACQX466ANRJTLPT3/action/author_attestation","sign_citation":"https://pith.science/pith/RYVL4QKKYBACQX466ANRJTLPT3/action/citation_signature","submit_replication":"https://pith.science/pith/RYVL4QKKYBACQX466ANRJTLPT3/action/replication_record"}},"created_at":"2026-05-18T00:32:49.073717+00:00","updated_at":"2026-05-18T00:32:49.073717+00:00"}