{"schema_version":"4ort.packet/1","entity":{"entity_id":"randomized-shortest-paths-with-net-flows-and-capacity-constraints","kg_uuid":"3f04bde9-51a8-4522-9bd0-95dbc9c59aba","wikidata_id":"openalex:W2978720244","name":"Randomized shortest paths with net flows and capacity constraints","description":"Research article (Information Sciences, 2020) · cited 13× · AI/ML","type":"CreativeWork","url":"https://4ort.xyz/entity/randomized-shortest-paths-with-net-flows-and-capacity-constraints"},"status":"complete","as_of":{"copy_written_at":"2026-05-24T22:44:39Z","last_source_edit_seen":null,"stale_possible":false,"claims_refreshed_at":null,"source_revision":null},"facts":[{"field":"P31","label":"instance of","value":"scholarly article","value_id":"Q13442814","value_raw":"Q13442814","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"openalex","source_name":"OpenAlex","source_record":"https://4ort.xyz/api/v1/knowledge/get_source_info?source=openalex#record=W2978720244","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":"high","basis":"dataset-record/1","calibrated":false}}],"unknowns":[],"omitted":{"facts":0,"reason":null},"licences":[{"source":"openalex","source_name":"OpenAlex","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"fields":["P31"]}],"routes":{"entity_page":"https://4ort.xyz/entity/randomized-shortest-paths-with-net-flows-and-capacity-constraints","packet_api":"https://4ort.xyz/api/v1/entities/randomized-shortest-paths-with-net-flows-and-capacity-constraints/packet","facts_jsonld":"https://4ort.xyz/entity/randomized-shortest-paths-with-net-flows-and-capacity-constraints/facts.json","changes_api":"https://4ort.xyz/api/v1/knowledge/get_entity_changes?entity=randomized-shortest-paths-with-net-flows-and-capacity-constraints","attention_api":"https://4ort.xyz/api/v1/knowledge/get_attention?entity=randomized-shortest-paths-with-net-flows-and-capacity-constraints","wikidata":null,"official_website":null},"trust_rules":{"dataset-record/1":"The fact is the cited dataset's own published record (band high). Reference support, not a probability."},"notes":[]}