{"work":{"id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","openalex_id":null,"doi":"10.48550/arxiv.1906.01227","arxiv_id":"1906.01227","raw_key":null,"title":"Joshi, Thomas Laurent, and Xavier Bresson","authors":null,"authors_text":"author author C","year":1906,"venue":null,"abstract":null,"external_url":"https://arxiv.org/abs/1906.01227","cited_by_count":null,"metadata_source":"arxiv_reference","metadata_fetched_at":"2026-07-10T06:15:00.866473+00:00","pith_arxiv_id":null,"created_at":"2026-05-11T13:41:09.249082+00:00","updated_at":"2026-07-10T06:15:00.866473+00:00","title_quality_ok":false,"display_title":"An efficient graph convolutional network technique for the travelling salesman problem","render_title":"An efficient graph convolutional network technique for the travelling salesman problem"},"hub":{"state":{"work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":17,"external_cited_by_count":null,"distinct_field_count":5,"first_pith_cited_at":"2024-05-24T07:54:44+00:00","last_pith_cited_at":"2026-07-01T17:17:55+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-08-04T03:20:25.222238+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":[]}}