{"work":{"id":"97e8291f-6d9f-4f6a-b7c5-c1a6eff836bc","openalex_id":null,"doi":null,"arxiv_id":"1968.300136","raw_key":null,"title":"Omar Khattab, Keshav Santhanam, Xiang Lisa Li, David Hall, Percy Liang, Christopher Potts, and Matei Zaharia","authors":null,"authors_text":"doi: 10","year":1968,"venue":null,"abstract":null,"external_url":"https://arxiv.org/abs/1968.300136","cited_by_count":null,"metadata_source":"arxiv_reference","metadata_fetched_at":"2026-06-28T22:12:41.201832+00:00","pith_arxiv_id":null,"created_at":"2026-05-10T21:40:48.152422+00:00","updated_at":"2026-06-28T22:12:41.201832+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":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":15,"external_cited_by_count":null,"distinct_field_count":7,"first_pith_cited_at":"2023-05-17T23:16:17+00:00","last_pith_cited_at":"2026-06-22T09:51:28+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-29T04:38:19.087988+00:00","tier_text":"hub"},"tier":"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":[]}}