{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ILZPBJP4JL7OFWV6MWHMLNSAR7","short_pith_number":"pith:ILZPBJP4","schema_version":"1.0","canonical_sha256":"42f2f0a5fc4afee2dabe658ec5b6408fd26d735b1d6ce1c8a95880ff781045a1","source":{"kind":"arxiv","id":"1509.01881","version":1},"attestation_state":"computed","paper":{"title":"Optimal Time-dependent Sequenced Route Queries in Road Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Camila F. Costa, Javam Machado, Jose A. F. Macedo, Mario A. Nascimento, Nikos Pelekis, Yannis Theodoridis","submitted_at":"2015-09-07T01:32:59Z","abstract_excerpt":"In this paper we present an algorithm for optimal processing of time-dependent sequenced route queries in road networks, i.e., given a road network where the travel time over an edge is time-dependent and a given ordered list of categories of interest, we find the fastest route between an origin and destination that passes through a sequence of points of interest belonging to each of the specified categories of interest. For instance, considering a city road network at a given departure time, one can find the fastest route between one's work and his/her home, passing through a bank, a supermar"},"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":"1509.01881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-09-07T01:32:59Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"2303fbb4fb4148ff89c9c19c872bf4b7a4ffbaf2afbdd22db4fa0f1f6d2ff09f","abstract_canon_sha256":"e3c1efaa2005381a2d64698e77a86421b147b9627655bb0fea7c93681e7e374f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:50.283513Z","signature_b64":"AFt6f6QhiNHTvaGGR5gV61kYlkPfC3qGlQDrwh89XlO1d7MWmmcXYJGvizs0UM6fMLuGPxWpoPZeXv+e5hsnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42f2f0a5fc4afee2dabe658ec5b6408fd26d735b1d6ce1c8a95880ff781045a1","last_reissued_at":"2026-05-18T01:33:50.282753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:50.282753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Time-dependent Sequenced Route Queries in Road Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Camila F. Costa, Javam Machado, Jose A. F. Macedo, Mario A. Nascimento, Nikos Pelekis, Yannis Theodoridis","submitted_at":"2015-09-07T01:32:59Z","abstract_excerpt":"In this paper we present an algorithm for optimal processing of time-dependent sequenced route queries in road networks, i.e., given a road network where the travel time over an edge is time-dependent and a given ordered list of categories of interest, we find the fastest route between an origin and destination that passes through a sequence of points of interest belonging to each of the specified categories of interest. For instance, considering a city road network at a given departure time, one can find the fastest route between one's work and his/her home, passing through a bank, a supermar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01881","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":"1509.01881","created_at":"2026-05-18T01:33:50.282866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01881v1","created_at":"2026-05-18T01:33:50.282866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01881","created_at":"2026-05-18T01:33:50.282866+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILZPBJP4JL7O","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILZPBJP4JL7OFWV6","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILZPBJP4","created_at":"2026-05-18T12:29:25.134429+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/ILZPBJP4JL7OFWV6MWHMLNSAR7","json":"https://pith.science/pith/ILZPBJP4JL7OFWV6MWHMLNSAR7.json","graph_json":"https://pith.science/api/pith-number/ILZPBJP4JL7OFWV6MWHMLNSAR7/graph.json","events_json":"https://pith.science/api/pith-number/ILZPBJP4JL7OFWV6MWHMLNSAR7/events.json","paper":"https://pith.science/paper/ILZPBJP4"},"agent_actions":{"view_html":"https://pith.science/pith/ILZPBJP4JL7OFWV6MWHMLNSAR7","download_json":"https://pith.science/pith/ILZPBJP4JL7OFWV6MWHMLNSAR7.json","view_paper":"https://pith.science/paper/ILZPBJP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01881&json=true","fetch_graph":"https://pith.science/api/pith-number/ILZPBJP4JL7OFWV6MWHMLNSAR7/graph.json","fetch_events":"https://pith.science/api/pith-number/ILZPBJP4JL7OFWV6MWHMLNSAR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILZPBJP4JL7OFWV6MWHMLNSAR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILZPBJP4JL7OFWV6MWHMLNSAR7/action/storage_attestation","attest_author":"https://pith.science/pith/ILZPBJP4JL7OFWV6MWHMLNSAR7/action/author_attestation","sign_citation":"https://pith.science/pith/ILZPBJP4JL7OFWV6MWHMLNSAR7/action/citation_signature","submit_replication":"https://pith.science/pith/ILZPBJP4JL7OFWV6MWHMLNSAR7/action/replication_record"}},"created_at":"2026-05-18T01:33:50.282866+00:00","updated_at":"2026-05-18T01:33:50.282866+00:00"}