{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SB2KH2CL5WZ2IMMJAHVQPITGJZ","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":"63a9ddc05bf77bc042ff7b092252c34b025acaa2ab27492681d759df197cb86e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-18T15:15:38Z","title_canon_sha256":"aab1bb05bba46a375c30bbcd474ebcfdf3a2b7913210472d2169aa94eecb9070"},"schema_version":"1.0","source":{"id":"1908.06460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06460","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06460v1","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06460","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"pith_short_12","alias_value":"SB2KH2CL5WZ2","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"pith_short_16","alias_value":"SB2KH2CL5WZ2IMMJ","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"pith_short_8","alias_value":"SB2KH2CL","created_at":"2026-07-04T23:58:15Z"}],"graph_snapshots":[{"event_id":"sha256:02ec3c4d87643a1e8cd9c4217cf1eaf161a52b9af07066aea368cc647c8f718a","target":"graph","created_at":"2026-07-04T23:58:15Z","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/1908.06460/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new approach called GR (Graph Reduction) algorithm for searching loop-less k-shortest paths (1st to k-th shortest paths) in a graph based on graph reduction. Let a source vertex and a target vertex of k-shortest paths be v_s and v_t respectively. First our approach computes shortest paths to every vertex from v_s and v_t respectively, and reduce a graph to a subgraph that contains all vertices and edges of loop-less k-shortest paths using the already computed shortest paths, and apply an existing k-shortest path search algorithm to the reduced graph. A graph can be reduced quickly","authors_text":"Hironobu Kitajima, Yasuo Yamane","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-18T15:15:38Z","title":"A New k-Shortest Path Search Approach based on Graph Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06460","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:f6dd92799f9e9408aa3432806ce87530aded5f540b5b9d068456c37910be9cb7","target":"record","created_at":"2026-07-04T23:58:15Z","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":"63a9ddc05bf77bc042ff7b092252c34b025acaa2ab27492681d759df197cb86e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-18T15:15:38Z","title_canon_sha256":"aab1bb05bba46a375c30bbcd474ebcfdf3a2b7913210472d2169aa94eecb9070"},"schema_version":"1.0","source":{"id":"1908.06460","kind":"arxiv","version":1}},"canonical_sha256":"9074a3e84bedb3a4318901eb07a2664e633d71056e80cad4ba79c557bd4d39d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9074a3e84bedb3a4318901eb07a2664e633d71056e80cad4ba79c557bd4d39d8","first_computed_at":"2026-07-04T23:58:15.968511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:15.968511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VhstI2HvYVQMErrh24HQYoDwOyYlZ9WCA5eq26uJRZmFZKVpe9ujSFUaiqgvA/1BbzkdIA3UvrrYPAKUw115AA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:15.968829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6dd92799f9e9408aa3432806ce87530aded5f540b5b9d068456c37910be9cb7","sha256:02ec3c4d87643a1e8cd9c4217cf1eaf161a52b9af07066aea368cc647c8f718a"],"state_sha256":"425549c0ebfbd0627454dc92e5005c7fcaa7715413bffd6d4b2e3aa08ea1f8e4"}