{"schema_version":"4ort.packet/1","entity":{"entity_id":"shortest-path-problem","kg_uuid":"3975ed7b-3967-4050-a30a-8927b06feb61","wikidata_id":"Q1058754","name":"shortest path problem","description":"problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized","type":"Thing","url":"https://4ort.xyz/entity/shortest-path-problem"},"status":"complete","as_of":{"copy_written_at":"2026-11-20T19:01:29Z","last_source_edit_seen":null,"stale_possible":true,"claims_refreshed_at":null,"source_revision":null},"facts":[{"field":"P31","label":"instance of","value":"computational problem","value_id":"Q3435924","value_raw":"Q3435924","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q1058754#P31","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P2812","label":"MathWorld ID","value":"ShortestPathProblem","value_id":null,"value_raw":"ShortestPathProblem","rank":"normal","current":null,"qualifiers":[{"field":"P1810","label":"subject named as","value":"Shortest Path Problem"}],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q1058754#P2812","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P5106","label":"Dictionary of Algorithms and Data Structures ID","value":"singlepairShortestpathProblem","value_id":null,"value_raw":"singlepairShortestpathProblem","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q1058754#P5106","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P5106","label":"Dictionary of Algorithms and Data Structures ID","value":"shortestpath","value_id":null,"value_raw":"shortestpath","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q1058754#P5106","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P6104","label":"maintained by WikiProject","value":"WikiProject Mathematics","value_id":"Q8487137","value_raw":"Q8487137","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q1058754#P6104","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P6366","label":"Microsoft Academic ID (discontinued)","value":"22590252","value_id":null,"value_raw":"22590252","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q1058754#P6366","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P13591","label":"Yale LUX ID","value":"concept/20f81b3b-453f-47f4-87ba-7b252da0431f","value_id":null,"value_raw":"concept/20f81b3b-453f-47f4-87ba-7b252da0431f","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q1058754#P13591","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}}],"unknowns":[],"omitted":{"facts":0,"reason":null},"licences":[{"source":"wikidata","source_name":"Wikidata","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"fields":["P31","P2812","P5106","P6104","P6366","P13591"]}],"routes":{"entity_page":"https://4ort.xyz/entity/shortest-path-problem","packet_api":"https://4ort.xyz/api/v1/entities/shortest-path-problem/packet","facts_jsonld":"https://4ort.xyz/entity/shortest-path-problem/facts.json","changes_api":"https://4ort.xyz/api/v1/knowledge/get_entity_changes?entity=shortest-path-problem","attention_api":"https://4ort.xyz/api/v1/knowledge/get_attention?entity=shortest-path-problem","wikidata":"https://www.wikidata.org/wiki/Q1058754","official_website":null},"trust_rules":{"wikidata-reference-support/2":"From the references in our copy of the statement: high = it cites a source (stated in P248, or a reference URL that is not Wikipedia); medium = only 'imported from Wikimedia project' or a Wikipedia URL; unscored = our copy holds no reference (older copies dropped references, so this is not evidence that Wikidata has none). Wikidata may hold more references than our copy shows. Reference support, not a probability."},"notes":["Our copy of this item's statements has not been checked against Wikidata since tracking began (2026-10-25); a newer value may exist."]}