{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WKUS5WP6ABV4DXCKSJ5EXN6ODC","short_pith_number":"pith:WKUS5WP6","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"},"canonical_sha256":"b2a92ed9fe006bc1dc4a927a4bb7ce189d11514957c17cd60d9879cda30343c3","source":{"kind":"arxiv","id":"1802.08014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08014","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08014v1","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08014","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"WKUS5WP6ABV4","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WKUS5WP6ABV4DXCK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WKUS5WP6","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WKUS5WP6ABV4DXCKSJ5EXN6ODC","target":"record","payload":{"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"},"canonical_sha256":"b2a92ed9fe006bc1dc4a927a4bb7ce189d11514957c17cd60d9879cda30343c3","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"},"source_kind":"arxiv","source_id":"1802.08014","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2cco5h3lTclmoBJhovifS1gImdwo8sHxa5jcayCS7kco41eupPohQHdMMOrivF7LmTzzKqNJ4Mq9UGvsC4UjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:24:39.676859Z"},"content_sha256":"039cda2a1b0870a731b18396d787a9ad4b707d112c7b166c91308f22212d1efc","schema_version":"1.0","event_id":"sha256:039cda2a1b0870a731b18396d787a9ad4b707d112c7b166c91308f22212d1efc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WKUS5WP6ABV4DXCKSJ5EXN6ODC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sunv1+Eu9OaJFe9LimiuTIdgetRiSt/Gqiur2Juq/L4XoFkuAhbI/m4QPGk3C4UNpwryvnBFrHctonIELeOODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:24:39.677511Z"},"content_sha256":"daef2921e3e2b81b31ce8e9a340641608a6c08a1a958eca211ac66fee4f2e1a6","schema_version":"1.0","event_id":"sha256:daef2921e3e2b81b31ce8e9a340641608a6c08a1a958eca211ac66fee4f2e1a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/bundle.json","state_url":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T15:24:39Z","links":{"resolver":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC","bundle":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/bundle.json","state":"https://pith.science/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKUS5WP6ABV4DXCKSJ5EXN6ODC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WKUS5WP6ABV4DXCKSJ5EXN6ODC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2348e30d4209c23b192fe59c96c5a3124dfd02f0007f1d5a1ec60b85065329fe","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-22T12:46:07Z","title_canon_sha256":"3cc3e7995cdeec4dc38db8b43a5ee2fd9def22c06b0016666e343e2b3174ce57"},"schema_version":"1.0","source":{"id":"1802.08014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08014","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08014v1","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08014","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"WKUS5WP6ABV4","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WKUS5WP6ABV4DXCK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WKUS5WP6","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:daef2921e3e2b81b31ce8e9a340641608a6c08a1a958eca211ac66fee4f2e1a6","target":"graph","created_at":"2026-05-18T00:22:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aoying Zhou, Bin Yang, Cheqing Jin, Huiping Liu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-22T12:46:07Z","title":"Finding Top-k Optimal Sequenced Routes -- Full Version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08014","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:039cda2a1b0870a731b18396d787a9ad4b707d112c7b166c91308f22212d1efc","target":"record","created_at":"2026-05-18T00:22:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2348e30d4209c23b192fe59c96c5a3124dfd02f0007f1d5a1ec60b85065329fe","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-22T12:46:07Z","title_canon_sha256":"3cc3e7995cdeec4dc38db8b43a5ee2fd9def22c06b0016666e343e2b3174ce57"},"schema_version":"1.0","source":{"id":"1802.08014","kind":"arxiv","version":1}},"canonical_sha256":"b2a92ed9fe006bc1dc4a927a4bb7ce189d11514957c17cd60d9879cda30343c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2a92ed9fe006bc1dc4a927a4bb7ce189d11514957c17cd60d9879cda30343c3","first_computed_at":"2026-05-18T00:22:45.846000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:45.846000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rd8vENykt7m2FfrZItyWH9C/g14kT01THmdUMRk/rWXo6M+eijXj4rE5vocaFvCvISLEBaqTcrPo/T11Y4K7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:45.846554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:039cda2a1b0870a731b18396d787a9ad4b707d112c7b166c91308f22212d1efc","sha256:daef2921e3e2b81b31ce8e9a340641608a6c08a1a958eca211ac66fee4f2e1a6"],"state_sha256":"66cde8e4562c90f8ee582b083ef4d0c39a14e147487841708373d4202dbc0c94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v9ScXhX0Rbutke+KQhNJvtn002ok6bbO6zQWTgUKM5UTYQmkCHvZwSyPQcgw2ri2jsdmfUGvuRWcZkN+7pyHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:24:39.681215Z","bundle_sha256":"bf084500fded565794fe6d8efe4c18462d60ccdb4cd918486bc35340cb11473d"}}