{"schema_version":"4ort.packet/1","entity":{"entity_id":"worst-case-complexity","kg_uuid":"21542443-99b9-4828-9b16-64226ad8e236","wikidata_id":"Q8037118","name":"worst-case complexity","description":"worst possible asymptotic complexity of an algorithm","type":"Thing","url":"https://4ort.xyz/entity/worst-case-complexity"},"status":"complete","as_of":{"copy_written_at":"2026-11-15T16:07:08Z","last_source_edit_seen":"2026-11-04T16:02:55Z","stale_possible":false,"claims_refreshed_at":"2026-11-04T16:03:11Z","source_revision":2564754498},"facts":[{"field":"P279","label":"subclass of","value":"computational complexity","value_id":"Q5157286","value_raw":"Q5157286","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q8037118#P279","source_edition":"2026-11-04T16:03:11Z","edition_basis":"claims_refreshed_at","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":"P279","label":"subclass of","value":"worst-case scenario","value_id":"Q2330707","value_raw":"Q2330707","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q8037118#P279","source_edition":"2026-11-04T16:03:11Z","edition_basis":"claims_refreshed_at","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":"P1889","label":"different from","value":"worst-case execution time","value_id":"Q362858","value_raw":"Q362858","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q8037118#P1889","source_edition":"2026-11-04T16:03:11Z","edition_basis":"claims_refreshed_at","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":"P2579","label":"studied by","value":"computational complexity theory","value_id":"Q205084","value_raw":"Q205084","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q8037118#P2579","source_edition":"2026-11-04T16:03:11Z","edition_basis":"claims_refreshed_at","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":"P2579","label":"studied by","value":"analysis of algorithms","value_id":"Q333464","value_raw":"Q333464","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q8037118#P2579","source_edition":"2026-11-04T16:03:11Z","edition_basis":"claims_refreshed_at","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":"P2579","label":"studied by","value":"theory of computation","value_id":"Q844718","value_raw":"Q844718","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q8037118#P2579","source_edition":"2026-11-04T16:03:11Z","edition_basis":"claims_refreshed_at","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":"96563100","value_id":null,"value_raw":"96563100","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q8037118#P6366","source_edition":"2026-11-04T16:03:11Z","edition_basis":"claims_refreshed_at","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":["P279","P1889","P2579","P6366"]}],"routes":{"entity_page":"https://4ort.xyz/entity/worst-case-complexity","packet_api":"https://4ort.xyz/api/v1/entities/worst-case-complexity/packet","facts_jsonld":"https://4ort.xyz/entity/worst-case-complexity/facts.json","changes_api":"https://4ort.xyz/api/v1/knowledge/get_entity_changes?entity=worst-case-complexity","attention_api":"https://4ort.xyz/api/v1/knowledge/get_attention?entity=worst-case-complexity","wikidata":"https://www.wikidata.org/wiki/Q8037118","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":[]}