{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:56VOWCXIHDOXJJNINDLODV2G2H","short_pith_number":"pith:56VOWCXI","schema_version":"1.0","canonical_sha256":"efaaeb0ae838dd74a5a868d6e1d746d1eb0617156c59a8c5b747e5636aa1f8a6","source":{"kind":"arxiv","id":"1601.02281","version":1},"attestation_state":"computed","paper":{"title":"Privacy-Preserving Shortest Path Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"David J. Wu, J\\'er\\'emy Planul, Joe Zimmerman, John C. Mitchell","submitted_at":"2016-01-10T23:49:17Z","abstract_excerpt":"Navigation is one of the most popular cloud computing services. But in virtually all cloud-based navigation systems, the client must reveal her location and destination to the cloud service provider in order to learn the fastest route. In this work, we present a cryptographic protocol for navigation on city streets that provides privacy for both the client's location and the service provider's routing data. Our key ingredient is a novel method for compressing the next-hop routing matrices in networks such as city street maps. Applying our compression method to the map of Los Angeles, for examp"},"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":"1601.02281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-10T23:49:17Z","cross_cats_sorted":[],"title_canon_sha256":"b2528e028003d115f64b837cfca796916f36080d041c5fb7ae3b27480440546f","abstract_canon_sha256":"989ad5717e1ddbe0e633b9f854c387dab3c177e9d5d966acadbf8ed7e3298cbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:06.807401Z","signature_b64":"RdAvjuWYKHTZqnGSARS+1h+7jvmX+lyXS5NFgYYBfnpxJyAC6V2iTJqC/lW+MNWOvdNFDffFTHfL6HdVpdf1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efaaeb0ae838dd74a5a868d6e1d746d1eb0617156c59a8c5b747e5636aa1f8a6","last_reissued_at":"2026-05-18T01:23:06.806875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:06.806875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy-Preserving Shortest Path Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"David J. Wu, J\\'er\\'emy Planul, Joe Zimmerman, John C. Mitchell","submitted_at":"2016-01-10T23:49:17Z","abstract_excerpt":"Navigation is one of the most popular cloud computing services. But in virtually all cloud-based navigation systems, the client must reveal her location and destination to the cloud service provider in order to learn the fastest route. In this work, we present a cryptographic protocol for navigation on city streets that provides privacy for both the client's location and the service provider's routing data. Our key ingredient is a novel method for compressing the next-hop routing matrices in networks such as city street maps. Applying our compression method to the map of Los Angeles, for examp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02281","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":"1601.02281","created_at":"2026-05-18T01:23:06.806960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.02281v1","created_at":"2026-05-18T01:23:06.806960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02281","created_at":"2026-05-18T01:23:06.806960+00:00"},{"alias_kind":"pith_short_12","alias_value":"56VOWCXIHDOX","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"56VOWCXIHDOXJJNI","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"56VOWCXI","created_at":"2026-05-18T12:29:58.707656+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/56VOWCXIHDOXJJNINDLODV2G2H","json":"https://pith.science/pith/56VOWCXIHDOXJJNINDLODV2G2H.json","graph_json":"https://pith.science/api/pith-number/56VOWCXIHDOXJJNINDLODV2G2H/graph.json","events_json":"https://pith.science/api/pith-number/56VOWCXIHDOXJJNINDLODV2G2H/events.json","paper":"https://pith.science/paper/56VOWCXI"},"agent_actions":{"view_html":"https://pith.science/pith/56VOWCXIHDOXJJNINDLODV2G2H","download_json":"https://pith.science/pith/56VOWCXIHDOXJJNINDLODV2G2H.json","view_paper":"https://pith.science/paper/56VOWCXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.02281&json=true","fetch_graph":"https://pith.science/api/pith-number/56VOWCXIHDOXJJNINDLODV2G2H/graph.json","fetch_events":"https://pith.science/api/pith-number/56VOWCXIHDOXJJNINDLODV2G2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56VOWCXIHDOXJJNINDLODV2G2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56VOWCXIHDOXJJNINDLODV2G2H/action/storage_attestation","attest_author":"https://pith.science/pith/56VOWCXIHDOXJJNINDLODV2G2H/action/author_attestation","sign_citation":"https://pith.science/pith/56VOWCXIHDOXJJNINDLODV2G2H/action/citation_signature","submit_replication":"https://pith.science/pith/56VOWCXIHDOXJJNINDLODV2G2H/action/replication_record"}},"created_at":"2026-05-18T01:23:06.806960+00:00","updated_at":"2026-05-18T01:23:06.806960+00:00"}