{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AZ6VACCQM44DTCOGMEEJTSDIXC","short_pith_number":"pith:AZ6VACCQ","schema_version":"1.0","canonical_sha256":"067d50085067383989c6610899c868b8918617d695021b98851d46c115b02fd0","source":{"kind":"arxiv","id":"2102.09544","version":3},"attestation_state":"computed","paper":{"title":"Combinatorial optimization and reasoning with graph neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NE","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Lodi, Christopher Morris, Didier Ch\\'etelat, Elias Khalil, Petar Veli\\v{c}kovi\\'c, Quentin Cappart","submitted_at":"2021-02-18T18:47:20Z","abstract_excerpt":"Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolation, ignoring that they often stem from related data distributions in practice. However, recent years have seen a surge of interest in using machine learning, especially graph neural networks (GNNs), as a key building block for combinatorial tasks, either directly as solvers or by enhancing exact solvers. The inductive bias of GNNs effectively encodes combinatorial and relational input due to their invariance to permut"},"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":"2102.09544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-18T18:47:20Z","cross_cats_sorted":["cs.DS","cs.NE","math.OC","stat.ML"],"title_canon_sha256":"9fff0d7956e49d443e057a0e46c8b11b00797e40027d0a97a800b5f11188f8bd","abstract_canon_sha256":"74271491ffd61fb807b6c04bcb19acb29b5fb6cc74950d9b048e7c9a3ff126e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:47:10.552536Z","signature_b64":"usR9kkyEvd3UzbdnYWuzS2ipVP+NVWcuRBAvKjmg3IxJciVikVIYkUU5nvtc+Xgic5CJTFzckmIo9oV7mTx3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"067d50085067383989c6610899c868b8918617d695021b98851d46c115b02fd0","last_reissued_at":"2026-07-05T06:47:10.552034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:47:10.552034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial optimization and reasoning with graph neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NE","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Lodi, Christopher Morris, Didier Ch\\'etelat, Elias Khalil, Petar Veli\\v{c}kovi\\'c, Quentin Cappart","submitted_at":"2021-02-18T18:47:20Z","abstract_excerpt":"Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolation, ignoring that they often stem from related data distributions in practice. However, recent years have seen a surge of interest in using machine learning, especially graph neural networks (GNNs), as a key building block for combinatorial tasks, either directly as solvers or by enhancing exact solvers. The inductive bias of GNNs effectively encodes combinatorial and relational input due to their invariance to permut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.09544","kind":"arxiv","version":3},"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/2102.09544/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":"2102.09544","created_at":"2026-07-05T06:47:10.552093+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.09544v3","created_at":"2026-07-05T06:47:10.552093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.09544","created_at":"2026-07-05T06:47:10.552093+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZ6VACCQM44D","created_at":"2026-07-05T06:47:10.552093+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZ6VACCQM44DTCOG","created_at":"2026-07-05T06:47:10.552093+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZ6VACCQ","created_at":"2026-07-05T06:47:10.552093+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21483","citing_title":"A note on the convergence guarantees of RLT-based algorithms for polynomial optimization","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27063","citing_title":"Learning Dynamic Graph Representations through Timespan View Contrasts","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AZ6VACCQM44DTCOGMEEJTSDIXC","json":"https://pith.science/pith/AZ6VACCQM44DTCOGMEEJTSDIXC.json","graph_json":"https://pith.science/api/pith-number/AZ6VACCQM44DTCOGMEEJTSDIXC/graph.json","events_json":"https://pith.science/api/pith-number/AZ6VACCQM44DTCOGMEEJTSDIXC/events.json","paper":"https://pith.science/paper/AZ6VACCQ"},"agent_actions":{"view_html":"https://pith.science/pith/AZ6VACCQM44DTCOGMEEJTSDIXC","download_json":"https://pith.science/pith/AZ6VACCQM44DTCOGMEEJTSDIXC.json","view_paper":"https://pith.science/paper/AZ6VACCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.09544&json=true","fetch_graph":"https://pith.science/api/pith-number/AZ6VACCQM44DTCOGMEEJTSDIXC/graph.json","fetch_events":"https://pith.science/api/pith-number/AZ6VACCQM44DTCOGMEEJTSDIXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZ6VACCQM44DTCOGMEEJTSDIXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZ6VACCQM44DTCOGMEEJTSDIXC/action/storage_attestation","attest_author":"https://pith.science/pith/AZ6VACCQM44DTCOGMEEJTSDIXC/action/author_attestation","sign_citation":"https://pith.science/pith/AZ6VACCQM44DTCOGMEEJTSDIXC/action/citation_signature","submit_replication":"https://pith.science/pith/AZ6VACCQM44DTCOGMEEJTSDIXC/action/replication_record"}},"created_at":"2026-07-05T06:47:10.552093+00:00","updated_at":"2026-07-05T06:47:10.552093+00:00"}