{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3TDHYBZWOEXS7GGP4KWYUDNTD7","short_pith_number":"pith:3TDHYBZW","schema_version":"1.0","canonical_sha256":"dcc67c0736712f2f98cfe2ad8a0db31fcfa20424e3ef5ec79b77c8f63795a625","source":{"kind":"arxiv","id":"1901.06210","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Monte Carlo-based Probabilistic Time-Dependent Routing Calculation Targeting a Server-Side Car Navigation System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cristina Silvano, Davide Gadioli, Emanuele Vitali, Gianluca Palermo, Jan Martinovic, Joao Bispo, Joao M. P. Cardoso, Katerina Slaninova, Martin Golasowski, Pedro Pinto","submitted_at":"2019-01-18T13:06:38Z","abstract_excerpt":"Incorporating speed probability distribution to the computation of the route planning in car navigation systems guarantees more accurate and precise responses. In this paper, we propose a novel approach for dynamically selecting the number of samples used for the Monte Carlo simulation to solve the Probabilistic Time-Dependent Routing (PTDR) problem, thus improving the computation efficiency. The proposed method is used to determine in a proactive manner the number of simulations to be done to extract the travel-time estimation for each specific request while respecting an error threshold as o"},"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":"1901.06210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-18T13:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"677d6f26ba137e86a8445fd65daf0e70d12318f67fabbfba275b2215cc0b2095","abstract_canon_sha256":"6a33bde02d678342b8c63d2d9c4e24b83d494d73ec514553373d3856672d6780"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:04.230426Z","signature_b64":"OIcddfZVAohsb4VrxHNwyZWul2HWhvMq75BXH9hI6IPvtzmFC2Y4ThIucG/znj7cU+KvUvJGm5L1/O56PtwfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcc67c0736712f2f98cfe2ad8a0db31fcfa20424e3ef5ec79b77c8f63795a625","last_reissued_at":"2026-05-17T23:56:04.229800Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:04.229800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Monte Carlo-based Probabilistic Time-Dependent Routing Calculation Targeting a Server-Side Car Navigation System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cristina Silvano, Davide Gadioli, Emanuele Vitali, Gianluca Palermo, Jan Martinovic, Joao Bispo, Joao M. P. Cardoso, Katerina Slaninova, Martin Golasowski, Pedro Pinto","submitted_at":"2019-01-18T13:06:38Z","abstract_excerpt":"Incorporating speed probability distribution to the computation of the route planning in car navigation systems guarantees more accurate and precise responses. In this paper, we propose a novel approach for dynamically selecting the number of samples used for the Monte Carlo simulation to solve the Probabilistic Time-Dependent Routing (PTDR) problem, thus improving the computation efficiency. The proposed method is used to determine in a proactive manner the number of simulations to be done to extract the travel-time estimation for each specific request while respecting an error threshold as o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06210","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":"1901.06210","created_at":"2026-05-17T23:56:04.229917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06210v1","created_at":"2026-05-17T23:56:04.229917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06210","created_at":"2026-05-17T23:56:04.229917+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TDHYBZWOEXS","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TDHYBZWOEXS7GGP","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TDHYBZW","created_at":"2026-05-18T12:33:10.108867+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/3TDHYBZWOEXS7GGP4KWYUDNTD7","json":"https://pith.science/pith/3TDHYBZWOEXS7GGP4KWYUDNTD7.json","graph_json":"https://pith.science/api/pith-number/3TDHYBZWOEXS7GGP4KWYUDNTD7/graph.json","events_json":"https://pith.science/api/pith-number/3TDHYBZWOEXS7GGP4KWYUDNTD7/events.json","paper":"https://pith.science/paper/3TDHYBZW"},"agent_actions":{"view_html":"https://pith.science/pith/3TDHYBZWOEXS7GGP4KWYUDNTD7","download_json":"https://pith.science/pith/3TDHYBZWOEXS7GGP4KWYUDNTD7.json","view_paper":"https://pith.science/paper/3TDHYBZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06210&json=true","fetch_graph":"https://pith.science/api/pith-number/3TDHYBZWOEXS7GGP4KWYUDNTD7/graph.json","fetch_events":"https://pith.science/api/pith-number/3TDHYBZWOEXS7GGP4KWYUDNTD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TDHYBZWOEXS7GGP4KWYUDNTD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TDHYBZWOEXS7GGP4KWYUDNTD7/action/storage_attestation","attest_author":"https://pith.science/pith/3TDHYBZWOEXS7GGP4KWYUDNTD7/action/author_attestation","sign_citation":"https://pith.science/pith/3TDHYBZWOEXS7GGP4KWYUDNTD7/action/citation_signature","submit_replication":"https://pith.science/pith/3TDHYBZWOEXS7GGP4KWYUDNTD7/action/replication_record"}},"created_at":"2026-05-17T23:56:04.229917+00:00","updated_at":"2026-05-17T23:56:04.229917+00:00"}