{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SB2KH2CL5WZ2IMMJAHVQPITGJZ","short_pith_number":"pith:SB2KH2CL","schema_version":"1.0","canonical_sha256":"9074a3e84bedb3a4318901eb07a2664e633d71056e80cad4ba79c557bd4d39d8","source":{"kind":"arxiv","id":"1908.06460","version":1},"attestation_state":"computed","paper":{"title":"A New k-Shortest Path Search Approach based on Graph Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hironobu Kitajima, Yasuo Yamane","submitted_at":"2019-08-18T15:15:38Z","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"},"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":"1908.06460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-18T15:15:38Z","cross_cats_sorted":[],"title_canon_sha256":"aab1bb05bba46a375c30bbcd474ebcfdf3a2b7913210472d2169aa94eecb9070","abstract_canon_sha256":"63a9ddc05bf77bc042ff7b092252c34b025acaa2ab27492681d759df197cb86e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:15.968829Z","signature_b64":"VhstI2HvYVQMErrh24HQYoDwOyYlZ9WCA5eq26uJRZmFZKVpe9ujSFUaiqgvA/1BbzkdIA3UvrrYPAKUw115AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9074a3e84bedb3a4318901eb07a2664e633d71056e80cad4ba79c557bd4d39d8","last_reissued_at":"2026-07-04T23:58:15.968511Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:15.968511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New k-Shortest Path Search Approach based on Graph Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hironobu Kitajima, Yasuo Yamane","submitted_at":"2019-08-18T15:15:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06460","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06460/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.06460","created_at":"2026-07-04T23:58:15.968559+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06460v1","created_at":"2026-07-04T23:58:15.968559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06460","created_at":"2026-07-04T23:58:15.968559+00:00"},{"alias_kind":"pith_short_12","alias_value":"SB2KH2CL5WZ2","created_at":"2026-07-04T23:58:15.968559+00:00"},{"alias_kind":"pith_short_16","alias_value":"SB2KH2CL5WZ2IMMJ","created_at":"2026-07-04T23:58:15.968559+00:00"},{"alias_kind":"pith_short_8","alias_value":"SB2KH2CL","created_at":"2026-07-04T23:58:15.968559+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/SB2KH2CL5WZ2IMMJAHVQPITGJZ","json":"https://pith.science/pith/SB2KH2CL5WZ2IMMJAHVQPITGJZ.json","graph_json":"https://pith.science/api/pith-number/SB2KH2CL5WZ2IMMJAHVQPITGJZ/graph.json","events_json":"https://pith.science/api/pith-number/SB2KH2CL5WZ2IMMJAHVQPITGJZ/events.json","paper":"https://pith.science/paper/SB2KH2CL"},"agent_actions":{"view_html":"https://pith.science/pith/SB2KH2CL5WZ2IMMJAHVQPITGJZ","download_json":"https://pith.science/pith/SB2KH2CL5WZ2IMMJAHVQPITGJZ.json","view_paper":"https://pith.science/paper/SB2KH2CL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06460&json=true","fetch_graph":"https://pith.science/api/pith-number/SB2KH2CL5WZ2IMMJAHVQPITGJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SB2KH2CL5WZ2IMMJAHVQPITGJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SB2KH2CL5WZ2IMMJAHVQPITGJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SB2KH2CL5WZ2IMMJAHVQPITGJZ/action/storage_attestation","attest_author":"https://pith.science/pith/SB2KH2CL5WZ2IMMJAHVQPITGJZ/action/author_attestation","sign_citation":"https://pith.science/pith/SB2KH2CL5WZ2IMMJAHVQPITGJZ/action/citation_signature","submit_replication":"https://pith.science/pith/SB2KH2CL5WZ2IMMJAHVQPITGJZ/action/replication_record"}},"created_at":"2026-07-04T23:58:15.968559+00:00","updated_at":"2026-07-04T23:58:15.968559+00:00"}