{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:44JIGHXCTROV6M4IGXYF2GHCQZ","short_pith_number":"pith:44JIGHXC","schema_version":"1.0","canonical_sha256":"e712831ee29c5d5f338835f05d18e2864dbad20c502c230f29ae15efaebda1a2","source":{"kind":"arxiv","id":"2410.09693","version":2},"attestation_state":"computed","paper":{"title":"Neural Solver Selection for Combinatorial Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"math.OC","authors_text":"Chao Qian, Chengrui Gao, Haopu Shang, Ke Xue","submitted_at":"2024-10-13T02:05:41Z","abstract_excerpt":"Machine learning has increasingly been employed to solve NP-hard combinatorial optimization problems, resulting in the emergence of neural solvers that demonstrate remarkable performance, even with minimal domain-specific knowledge. To date, the community has created numerous open-source neural solvers with distinct motivations and inductive biases. While considerable efforts are devoted to designing powerful single solvers, our findings reveal that existing solvers typically demonstrate complementary performance across different problem instances. This suggests that significant improvements c"},"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":"2410.09693","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-13T02:05:41Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d943f68b0779d1f0e3588767481386fe8594176f20e5c0e1d51a6ec8b2c423c1","abstract_canon_sha256":"3dee6a8ebe7a9da0ecd0e3f7c7c5de3872b873511ab73612d466fcd5e7fb4c0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:01.601356Z","signature_b64":"wLmBBSPhIBmhi2wNbXduYSb82ytnM2Q0d9302eGrkfxUTB/MEf01U2xV76FndKZDhEVOlpJFAPJ0gnwSWHUYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e712831ee29c5d5f338835f05d18e2864dbad20c502c230f29ae15efaebda1a2","last_reissued_at":"2026-07-05T11:09:01.600937Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:01.600937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Solver Selection for Combinatorial Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"math.OC","authors_text":"Chao Qian, Chengrui Gao, Haopu Shang, Ke Xue","submitted_at":"2024-10-13T02:05:41Z","abstract_excerpt":"Machine learning has increasingly been employed to solve NP-hard combinatorial optimization problems, resulting in the emergence of neural solvers that demonstrate remarkable performance, even with minimal domain-specific knowledge. To date, the community has created numerous open-source neural solvers with distinct motivations and inductive biases. While considerable efforts are devoted to designing powerful single solvers, our findings reveal that existing solvers typically demonstrate complementary performance across different problem instances. This suggests that significant improvements c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.09693","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/2410.09693/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":"2410.09693","created_at":"2026-07-05T11:09:01.600991+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.09693v2","created_at":"2026-07-05T11:09:01.600991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.09693","created_at":"2026-07-05T11:09:01.600991+00:00"},{"alias_kind":"pith_short_12","alias_value":"44JIGHXCTROV","created_at":"2026-07-05T11:09:01.600991+00:00"},{"alias_kind":"pith_short_16","alias_value":"44JIGHXCTROV6M4I","created_at":"2026-07-05T11:09:01.600991+00:00"},{"alias_kind":"pith_short_8","alias_value":"44JIGHXC","created_at":"2026-07-05T11:09:01.600991+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/44JIGHXCTROV6M4IGXYF2GHCQZ","json":"https://pith.science/pith/44JIGHXCTROV6M4IGXYF2GHCQZ.json","graph_json":"https://pith.science/api/pith-number/44JIGHXCTROV6M4IGXYF2GHCQZ/graph.json","events_json":"https://pith.science/api/pith-number/44JIGHXCTROV6M4IGXYF2GHCQZ/events.json","paper":"https://pith.science/paper/44JIGHXC"},"agent_actions":{"view_html":"https://pith.science/pith/44JIGHXCTROV6M4IGXYF2GHCQZ","download_json":"https://pith.science/pith/44JIGHXCTROV6M4IGXYF2GHCQZ.json","view_paper":"https://pith.science/paper/44JIGHXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.09693&json=true","fetch_graph":"https://pith.science/api/pith-number/44JIGHXCTROV6M4IGXYF2GHCQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/44JIGHXCTROV6M4IGXYF2GHCQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44JIGHXCTROV6M4IGXYF2GHCQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44JIGHXCTROV6M4IGXYF2GHCQZ/action/storage_attestation","attest_author":"https://pith.science/pith/44JIGHXCTROV6M4IGXYF2GHCQZ/action/author_attestation","sign_citation":"https://pith.science/pith/44JIGHXCTROV6M4IGXYF2GHCQZ/action/citation_signature","submit_replication":"https://pith.science/pith/44JIGHXCTROV6M4IGXYF2GHCQZ/action/replication_record"}},"created_at":"2026-07-05T11:09:01.600991+00:00","updated_at":"2026-07-05T11:09:01.600991+00:00"}