{"work":{"id":"1bb10773-16bb-4c1d-a221-e6dc7d920481","openalex_id":"https://openalex.org/W2401610261","doi":"10.1007/978-1-4684-2001-2_9","arxiv_id":null,"raw_key":null,"title":"Karp.Reducibility among Combinatorial Problems, pages 85–103","authors":[{"given":"Richard M.","family":"Karp","sequence":"first","affiliation":[]}],"authors_text":"R","year":2001,"venue":"Complexity of Computer Computations","abstract":null,"external_url":"https://doi.org/10.1007/978-1-4684-2001-2_9","cited_by_count":6151,"metadata_source":"doi_reference","metadata_fetched_at":"2026-05-13T01:47:03.539626+00:00","pith_arxiv_id":null,"created_at":"2026-05-08T21:59:18.867456+00:00","updated_at":"2026-05-14T17:03:06.181135+00:00","title_quality_ok":true,"display_title":"Karp.Reducibility among Combinatorial Problems, pages 85–103","render_title":"Karp.Reducibility among Combinatorial Problems, pages 85–103"},"hub":{"state":{"work_id":"1bb10773-16bb-4c1d-a221-e6dc7d920481","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":11,"external_cited_by_count":6151,"distinct_field_count":7,"first_pith_cited_at":"2026-04-06T17:44:04+00:00","last_pith_cited_at":"2026-05-11T22:16:43+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-05-15T22:48:11.200896+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":1}],"polarity_counts":[{"context_polarity":"background","n":1}],"runs":{},"summary":{},"graph":{},"authors":[]}}