{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WKUS5WP6ABV4DXCKSJ5EXN6ODC","short_pith_number":"pith:WKUS5WP6","schema_version":"1.0","canonical_sha256":"b2a92ed9fe006bc1dc4a927a4bb7ce189d11514957c17cd60d9879cda30343c3","source":{"kind":"arxiv","id":"1802.08014","version":1},"attestation_state":"computed","paper":{"title":"Finding Top-k Optimal Sequenced Routes -- Full Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Aoying Zhou, Bin Yang, Cheqing Jin, Huiping Liu","submitted_at":"2018-02-22T12:46:07Z","abstract_excerpt":"Motivated by many practical applications in logistics and mobility-as-a-service, we study the top-k optimal sequenced routes (KOSR) querying on large, general graphs where the edge weights may not satisfy the triangle inequality, e.g., road network graphs with travel times as edge weights. The KOSR querying strives to find the top-k optimal routes (i.e., with the top-k minimal total costs) from a given source to a given destination, which must visit a number of vertices with specific vertex categories (e.g., gas stations, restaurants, and shopping malls) in a particular order (e.g., visiting g"},"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":"1802.08014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-22T12:46:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3cc3e7995cdeec4dc38db8b43a5ee2fd9def22c06b0016666e343e2b3174ce57","abstract_canon_sha256":"2348e30d4209c23b192fe59c96c5a3124dfd02f0007f1d5a1ec60b85065329fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:45.846554Z","signature_b64":"Rd8vENykt7m2FfrZItyWH9C/g14kT01THmdUMRk/rWXo6M+eijXj4rE5vocaFvCvISLEBaqTcrPo/T11Y4K7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2a92ed9fe006bc1dc4a927a4bb7ce189d11514957c17cd60d9879cda30343c3","last_reissued_at":"2026-05-18T00:22:45.846000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:45.846000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Top-k Optimal Sequenced Routes -- Full Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Aoying Zhou, Bin Yang, Cheqing Jin, Huiping Liu","submitted_at":"2018-02-22T12:46:07Z","abstract_excerpt":"Motivated by many practical applications in logistics and mobility-as-a-service, we study the top-k optimal sequenced routes (KOSR) querying on large, general graphs where the edge weights may not satisfy the triangle inequality, e.g., road network graphs with travel times as edge weights. The KOSR querying strives to find the top-k optimal routes (i.e., with the top-k minimal total costs) from a given source to a given destination, which must visit a number of vertices with specific vertex categories (e.g., gas stations, restaurants, and shopping malls) in a particular order (e.g., visiting g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08014","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":"1802.08014","created_at":"2026-05-18T00:22:45.846079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08014v1","created_at":"2026-05-18T00:22:45.846079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08014","created_at":"2026-05-18T00:22:45.846079+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKUS5WP6ABV4","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKUS5WP6ABV4DXCK","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKUS5WP6","created_at":"2026-05-18T12:33:01.666342+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/WKUS5WP6ABV4DXCKSJ5EXN6ODC","json":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC.json","graph_json":"https://pith.science/api/pith-number/WKUS5WP6ABV4DXCKSJ5EXN6ODC/graph.json","events_json":"https://pith.science/api/pith-number/WKUS5WP6ABV4DXCKSJ5EXN6ODC/events.json","paper":"https://pith.science/paper/WKUS5WP6"},"agent_actions":{"view_html":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC","download_json":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC.json","view_paper":"https://pith.science/paper/WKUS5WP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08014&json=true","fetch_graph":"https://pith.science/api/pith-number/WKUS5WP6ABV4DXCKSJ5EXN6ODC/graph.json","fetch_events":"https://pith.science/api/pith-number/WKUS5WP6ABV4DXCKSJ5EXN6ODC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/action/storage_attestation","attest_author":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/action/author_attestation","sign_citation":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/action/citation_signature","submit_replication":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/action/replication_record"}},"created_at":"2026-05-18T00:22:45.846079+00:00","updated_at":"2026-05-18T00:22:45.846079+00:00"}