{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:B2PZFCSGCHALDOCUDHW4TQOY3M","short_pith_number":"pith:B2PZFCSG","canonical_record":{"source":{"id":"2004.02580","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-06T11:52:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"303a6e47410b83a2cc776b558c5c4dcf0412a0fdcbb97c8d653ed55d8827e865","abstract_canon_sha256":"978c5ae9c0d084310fe6694f6c95b9cfe2fb81d73ec451526b3d01054798af24"},"schema_version":"1.0"},"canonical_sha256":"0e9f928a4611c0b1b85419edc9c1d8db318966e15ebadd9052f0c652ceffdefd","source":{"kind":"arxiv","id":"2004.02580","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.02580","created_at":"2026-07-05T04:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"2004.02580v3","created_at":"2026-07-05T04:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02580","created_at":"2026-07-05T04:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"B2PZFCSGCHAL","created_at":"2026-07-05T04:22:49Z"},{"alias_kind":"pith_short_16","alias_value":"B2PZFCSGCHALDOCU","created_at":"2026-07-05T04:22:49Z"},{"alias_kind":"pith_short_8","alias_value":"B2PZFCSG","created_at":"2026-07-05T04:22:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:B2PZFCSGCHALDOCUDHW4TQOY3M","target":"record","payload":{"canonical_record":{"source":{"id":"2004.02580","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-06T11:52:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"303a6e47410b83a2cc776b558c5c4dcf0412a0fdcbb97c8d653ed55d8827e865","abstract_canon_sha256":"978c5ae9c0d084310fe6694f6c95b9cfe2fb81d73ec451526b3d01054798af24"},"schema_version":"1.0"},"canonical_sha256":"0e9f928a4611c0b1b85419edc9c1d8db318966e15ebadd9052f0c652ceffdefd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:22:49.012355Z","signature_b64":"U07I7kdkrhdYp8em6IYIOureDvEVbPEKDU4VrpzFAzcToc2fQdQiqKcXa0EOdVtzVwhCRq7WioFl0zmVXEkICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e9f928a4611c0b1b85419edc9c1d8db318966e15ebadd9052f0c652ceffdefd","last_reissued_at":"2026-07-05T04:22:49.011833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:22:49.011833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.02580","source_version":3,"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-07-05T04:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKNg70jwdQl1fDYa+yabE97iXqVedTk5G9ifJsmK7bYEoeIuCJNJQk7M2bRW3OBIZgyXLEPbpIbF92ZsCXjUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:38:06.031000Z"},"content_sha256":"8a97a5d0c6f447f26dfd7207f052da71787873029b6e2fffa2142a732d50a8a1","schema_version":"1.0","event_id":"sha256:8a97a5d0c6f447f26dfd7207f052da71787873029b6e2fffa2142a732d50a8a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:B2PZFCSGCHALDOCUDHW4TQOY3M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Processing of k Shortest Path Queries over Dynamic Road Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Dingyu Yang, Nick Koudas, Xiaohui Yu, Yang Liu, Yifan Li, Yueting Chen, Ziqiang Yu","submitted_at":"2020-04-06T11:52:00Z","abstract_excerpt":"The problem of identifying the k-shortest paths (KSPs for short) in a dynamic road network is essential to many location-based services. Road networks are dynamic in the sense that the weights of the edges in the corresponding graph constantly change over time, representing evolving traffic conditions. Very often such services have to process numerous KSP queries over large road networks at the same time, thus there is a pressing need to identify distributed solutions for this problem. However, most existing approaches are designed to identify KSPs on a static graph in a sequential manner (i.e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02580","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.02580/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQiY3ELRKEUkUIhCNoVMcpLYpvMeZyC6PYJS3iyb9BjiscU43bgeQF6EWDOfjoI/9m7C3bjXrrCcyM0fstOwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:38:06.031395Z"},"content_sha256":"36160cbc2990310b0f64401bfc390eee414931ef3766bf9c10ed33c64c69b5b3","schema_version":"1.0","event_id":"sha256:36160cbc2990310b0f64401bfc390eee414931ef3766bf9c10ed33c64c69b5b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2PZFCSGCHALDOCUDHW4TQOY3M/bundle.json","state_url":"https://pith.science/pith/B2PZFCSGCHALDOCUDHW4TQOY3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2PZFCSGCHALDOCUDHW4TQOY3M/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-07-07T04:38:06Z","links":{"resolver":"https://pith.science/pith/B2PZFCSGCHALDOCUDHW4TQOY3M","bundle":"https://pith.science/pith/B2PZFCSGCHALDOCUDHW4TQOY3M/bundle.json","state":"https://pith.science/pith/B2PZFCSGCHALDOCUDHW4TQOY3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2PZFCSGCHALDOCUDHW4TQOY3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:B2PZFCSGCHALDOCUDHW4TQOY3M","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":"978c5ae9c0d084310fe6694f6c95b9cfe2fb81d73ec451526b3d01054798af24","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-06T11:52:00Z","title_canon_sha256":"303a6e47410b83a2cc776b558c5c4dcf0412a0fdcbb97c8d653ed55d8827e865"},"schema_version":"1.0","source":{"id":"2004.02580","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.02580","created_at":"2026-07-05T04:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"2004.02580v3","created_at":"2026-07-05T04:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02580","created_at":"2026-07-05T04:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"B2PZFCSGCHAL","created_at":"2026-07-05T04:22:49Z"},{"alias_kind":"pith_short_16","alias_value":"B2PZFCSGCHALDOCU","created_at":"2026-07-05T04:22:49Z"},{"alias_kind":"pith_short_8","alias_value":"B2PZFCSG","created_at":"2026-07-05T04:22:49Z"}],"graph_snapshots":[{"event_id":"sha256:36160cbc2990310b0f64401bfc390eee414931ef3766bf9c10ed33c64c69b5b3","target":"graph","created_at":"2026-07-05T04:22:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.02580/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of identifying the k-shortest paths (KSPs for short) in a dynamic road network is essential to many location-based services. Road networks are dynamic in the sense that the weights of the edges in the corresponding graph constantly change over time, representing evolving traffic conditions. Very often such services have to process numerous KSP queries over large road networks at the same time, thus there is a pressing need to identify distributed solutions for this problem. However, most existing approaches are designed to identify KSPs on a static graph in a sequential manner (i.e","authors_text":"Dingyu Yang, Nick Koudas, Xiaohui Yu, Yang Liu, Yifan Li, Yueting Chen, Ziqiang Yu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-06T11:52:00Z","title":"Distributed Processing of k Shortest Path Queries over Dynamic Road Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02580","kind":"arxiv","version":3},"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:8a97a5d0c6f447f26dfd7207f052da71787873029b6e2fffa2142a732d50a8a1","target":"record","created_at":"2026-07-05T04:22:49Z","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":"978c5ae9c0d084310fe6694f6c95b9cfe2fb81d73ec451526b3d01054798af24","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-06T11:52:00Z","title_canon_sha256":"303a6e47410b83a2cc776b558c5c4dcf0412a0fdcbb97c8d653ed55d8827e865"},"schema_version":"1.0","source":{"id":"2004.02580","kind":"arxiv","version":3}},"canonical_sha256":"0e9f928a4611c0b1b85419edc9c1d8db318966e15ebadd9052f0c652ceffdefd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e9f928a4611c0b1b85419edc9c1d8db318966e15ebadd9052f0c652ceffdefd","first_computed_at":"2026-07-05T04:22:49.011833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:22:49.011833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U07I7kdkrhdYp8em6IYIOureDvEVbPEKDU4VrpzFAzcToc2fQdQiqKcXa0EOdVtzVwhCRq7WioFl0zmVXEkICg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:22:49.012355Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.02580","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a97a5d0c6f447f26dfd7207f052da71787873029b6e2fffa2142a732d50a8a1","sha256:36160cbc2990310b0f64401bfc390eee414931ef3766bf9c10ed33c64c69b5b3"],"state_sha256":"9fa56713cc50674368ee7d1badd4319e4f246e4770b90a695dc4c9647f96d587"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L30nl+5kF3/X3kj78vCJmEZnF3QpyYTFVbnu+/UI46Tbb9Pv5epRjdNt6sJQrN+hHTDGug8Fy+M9aO2/nQ7UCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:38:06.033788Z","bundle_sha256":"60d46916297d3125296a49ae9079e4328b28cf532ce80e12adf77d03faa89f09"}}