{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6GVSXTDRH4CCATUEFRFPEC67QO","short_pith_number":"pith:6GVSXTDR","schema_version":"1.0","canonical_sha256":"f1ab2bcc713f04204e842c4af20bdf83a3dc996b05f6891adae0e871009bb518","source":{"kind":"arxiv","id":"1810.10659","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Qifeng Chen, Vladlen Koltun, Zhuwen Li","submitted_at":"2018-10-25T00:12:44Z","abstract_excerpt":"We present a learning-based approach to computing solutions for certain NP-hard problems. Our approach combines deep learning techniques with useful algorithmic elements from classic heuristics. The central component is a graph convolutional network that is trained to estimate the likelihood, for each vertex in a graph, of whether this vertex is part of the optimal solution. The network is designed and trained to synthesize a diverse set of solutions, which enables rapid exploration of the solution space via tree search. The presented approach is evaluated on four canonical NP-hard problems an"},"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":"1810.10659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T00:12:44Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"962dbf150c78a9ea2c3736e490078abaaba600f0a88b16a6de66c85bef5e0ca0","abstract_canon_sha256":"1c68ba2395801cbbac4473dcafe357f141a15254ef14c35270f071920f1d5537"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:19.972803Z","signature_b64":"9JKWBPq/GJBPcr7gJk1HTfsC7fka+60sGrD2rTFh0027wwxcMekc1igYBV2iSADCq2VxwBB4r56jgPH6myqFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1ab2bcc713f04204e842c4af20bdf83a3dc996b05f6891adae0e871009bb518","last_reissued_at":"2026-05-18T00:02:19.972332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:19.972332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Qifeng Chen, Vladlen Koltun, Zhuwen Li","submitted_at":"2018-10-25T00:12:44Z","abstract_excerpt":"We present a learning-based approach to computing solutions for certain NP-hard problems. Our approach combines deep learning techniques with useful algorithmic elements from classic heuristics. The central component is a graph convolutional network that is trained to estimate the likelihood, for each vertex in a graph, of whether this vertex is part of the optimal solution. The network is designed and trained to synthesize a diverse set of solutions, which enables rapid exploration of the solution space via tree search. The presented approach is evaluated on four canonical NP-hard problems an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10659","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1810.10659","created_at":"2026-05-18T00:02:19.972405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10659v1","created_at":"2026-05-18T00:02:19.972405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10659","created_at":"2026-05-18T00:02:19.972405+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GVSXTDRH4CC","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GVSXTDRH4CCATUE","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GVSXTDR","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.10520","citing_title":"Nonlocal Monte Carlo via Reinforcement Learning","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO","json":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO.json","graph_json":"https://pith.science/api/pith-number/6GVSXTDRH4CCATUEFRFPEC67QO/graph.json","events_json":"https://pith.science/api/pith-number/6GVSXTDRH4CCATUEFRFPEC67QO/events.json","paper":"https://pith.science/paper/6GVSXTDR"},"agent_actions":{"view_html":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO","download_json":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO.json","view_paper":"https://pith.science/paper/6GVSXTDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10659&json=true","fetch_graph":"https://pith.science/api/pith-number/6GVSXTDRH4CCATUEFRFPEC67QO/graph.json","fetch_events":"https://pith.science/api/pith-number/6GVSXTDRH4CCATUEFRFPEC67QO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO/action/storage_attestation","attest_author":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO/action/author_attestation","sign_citation":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO/action/citation_signature","submit_replication":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO/action/replication_record"}},"created_at":"2026-05-18T00:02:19.972405+00:00","updated_at":"2026-05-18T00:02:19.972405+00:00"}