{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2WRWAGOYU6UNQDJUUNPLPSX3SN","short_pith_number":"pith:2WRWAGOY","schema_version":"1.0","canonical_sha256":"d5a36019d8a7a8d80d34a35eb7cafb937efb7757e2ac6377edb88f9d0db6ec9d","source":{"kind":"arxiv","id":"2210.04123","version":2},"attestation_state":"computed","paper":{"title":"DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Ruizhong Qiu, Yiming Yang, Zhiqing Sun","submitted_at":"2022-10-08T23:24:37Z","abstract_excerpt":"Recently, deep reinforcement learning (DRL) models have shown promising results in solving NP-hard Combinatorial Optimization (CO) problems. However, most DRL solvers can only scale to a few hundreds of nodes for combinatorial optimization problems on graphs, such as the Traveling Salesman Problem (TSP). This paper addresses the scalability challenge in large-scale combinatorial optimization by proposing a novel approach, namely, DIMES. Unlike previous DRL methods which suffer from costly autoregressive decoding or iterative refinements of discrete solutions, DIMES introduces a compact continu"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2210.04123","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-08T23:24:37Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"8413aad395a4d31f115997f9f20043aa61ed99b71e451666eb6f629ebdd585ee","abstract_canon_sha256":"3593ce3476eb80cf842ce78a7178982b01e42ef54218b14d54082a8f2208670b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:10:16.488992Z","signature_b64":"Rcu7zrJFRLBj/Rb7z9QX4kVhCS40L3Hvvmwieq4/OkrKuE6NO6fzRmKZToJTJLivpkdYcI2RjlW9CM29XK/oDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5a36019d8a7a8d80d34a35eb7cafb937efb7757e2ac6377edb88f9d0db6ec9d","last_reissued_at":"2026-07-05T05:10:16.488521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:10:16.488521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Ruizhong Qiu, Yiming Yang, Zhiqing Sun","submitted_at":"2022-10-08T23:24:37Z","abstract_excerpt":"Recently, deep reinforcement learning (DRL) models have shown promising results in solving NP-hard Combinatorial Optimization (CO) problems. However, most DRL solvers can only scale to a few hundreds of nodes for combinatorial optimization problems on graphs, such as the Traveling Salesman Problem (TSP). This paper addresses the scalability challenge in large-scale combinatorial optimization by proposing a novel approach, namely, DIMES. Unlike previous DRL methods which suffer from costly autoregressive decoding or iterative refinements of discrete solutions, DIMES introduces a compact continu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04123","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.04123/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2210.04123","created_at":"2026-07-05T05:10:16.488575+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.04123v2","created_at":"2026-07-05T05:10:16.488575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04123","created_at":"2026-07-05T05:10:16.488575+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WRWAGOYU6UN","created_at":"2026-07-05T05:10:16.488575+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WRWAGOYU6UNQDJU","created_at":"2026-07-05T05:10:16.488575+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WRWAGOY","created_at":"2026-07-05T05:10:16.488575+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30415","citing_title":"Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems","ref_index":101,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2WRWAGOYU6UNQDJUUNPLPSX3SN","json":"https://pith.science/pith/2WRWAGOYU6UNQDJUUNPLPSX3SN.json","graph_json":"https://pith.science/api/pith-number/2WRWAGOYU6UNQDJUUNPLPSX3SN/graph.json","events_json":"https://pith.science/api/pith-number/2WRWAGOYU6UNQDJUUNPLPSX3SN/events.json","paper":"https://pith.science/paper/2WRWAGOY"},"agent_actions":{"view_html":"https://pith.science/pith/2WRWAGOYU6UNQDJUUNPLPSX3SN","download_json":"https://pith.science/pith/2WRWAGOYU6UNQDJUUNPLPSX3SN.json","view_paper":"https://pith.science/paper/2WRWAGOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.04123&json=true","fetch_graph":"https://pith.science/api/pith-number/2WRWAGOYU6UNQDJUUNPLPSX3SN/graph.json","fetch_events":"https://pith.science/api/pith-number/2WRWAGOYU6UNQDJUUNPLPSX3SN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WRWAGOYU6UNQDJUUNPLPSX3SN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WRWAGOYU6UNQDJUUNPLPSX3SN/action/storage_attestation","attest_author":"https://pith.science/pith/2WRWAGOYU6UNQDJUUNPLPSX3SN/action/author_attestation","sign_citation":"https://pith.science/pith/2WRWAGOYU6UNQDJUUNPLPSX3SN/action/citation_signature","submit_replication":"https://pith.science/pith/2WRWAGOYU6UNQDJUUNPLPSX3SN/action/replication_record"}},"created_at":"2026-07-05T05:10:16.488575+00:00","updated_at":"2026-07-05T05:10:16.488575+00:00"}