{"work":{"id":"97e8291f-6d9f-4f6a-b7c5-c1a6eff836bc","openalex_id":"https://openalex.org/W1969483458","doi":"10.1109/tssc.1968.300136","arxiv_id":"1968.300136","raw_key":null,"title":"IEEE Transactions on Systems Science and Cybernetics , author =","authors":null,"authors_text":"A","year":1968,"venue":"IEEE Transactions on Systems Science and Cybernetics","abstract":null,"external_url":"https://arxiv.org/abs/1968.300136","cited_by_count":12265,"metadata_source":"arxiv_reference","metadata_fetched_at":"2026-08-05T02:28:24.338817+00:00","pith_arxiv_id":null,"created_at":"2026-05-10T21:40:48.152422+00:00","updated_at":"2026-08-05T02:28:24.338817+00:00","title_quality_ok":false,"display_title":"A formal basis for the heuristic determination of minimum cost paths","render_title":"A formal basis for the heuristic determination of minimum cost paths"},"hub":{"state":{"work_id":"97e8291f-6d9f-4f6a-b7c5-c1a6eff836bc","tier":"super_hub","tier_reason":"100+ Pith inbound or 10,000+ external citations","pith_inbound_count":20,"external_cited_by_count":12265,"distinct_field_count":7,"first_pith_cited_at":"2023-05-17T23:16:17+00:00","last_pith_cited_at":"2026-07-08T03:40:38+00:00","author_build_status":"needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-08-22T10:39:49.311618+00:00","tier_text":"super_hub"},"tier":"super_hub","role_counts":[{"context_role":"background","n":2},{"context_role":"method","n":1}],"polarity_counts":[{"context_polarity":"background","n":2},{"context_polarity":"use_method","n":1}],"runs":{},"summary":{},"graph":{},"authors":[]}}