{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KL7OYM6ZKQN7QM5O2Z64PEFNYI","short_pith_number":"pith:KL7OYM6Z","schema_version":"1.0","canonical_sha256":"52feec33d9541bf833aed67dc790adc226b6cde1bfe01e2236e8e17af8affdac","source":{"kind":"arxiv","id":"2406.13125","version":1},"attestation_state":"computed","paper":{"title":"A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Shiqing Liu, Xiangyu Wang, Xueming Yan, Yaochu Jin","submitted_at":"2024-06-19T00:40:31Z","abstract_excerpt":"Graph neural networks (GNNs) have emerged as a powerful tool for solving combinatorial optimization problems (COPs), exhibiting state-of-the-art performance in both graph-structured and non-graph-structured domains. However, existing approaches lack a unified framework capable of addressing a wide range of COPs. After presenting a summary of representative COPs and a brief review of recent advancements in GNNs for solving COPs, this paper proposes a unified framework for solving COPs based on GNNs, including graph representation of COPs, equivalent conversion of non-graph structured COPs to gr"},"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":"2406.13125","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-06-19T00:40:31Z","cross_cats_sorted":[],"title_canon_sha256":"78ea23c1502469092c274f1f57af369100e5cc9306fa95e2ff6c11df42b0494b","abstract_canon_sha256":"fc1c735ad667f9cacbcf2e030b2307a5721c7e87b8fd978a4b16ae8aa8b77d2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:25.498990Z","signature_b64":"U8U9+Kp6t6RAOihYZYL/13Ob/Eg8AmlWscK2tFkIOujpFFlEhUU/TJ/oAyPTe/70kZn3IySPtftoSxrG54mgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52feec33d9541bf833aed67dc790adc226b6cde1bfe01e2236e8e17af8affdac","last_reissued_at":"2026-07-05T08:34:25.498592Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:25.498592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Shiqing Liu, Xiangyu Wang, Xueming Yan, Yaochu Jin","submitted_at":"2024-06-19T00:40:31Z","abstract_excerpt":"Graph neural networks (GNNs) have emerged as a powerful tool for solving combinatorial optimization problems (COPs), exhibiting state-of-the-art performance in both graph-structured and non-graph-structured domains. However, existing approaches lack a unified framework capable of addressing a wide range of COPs. After presenting a summary of representative COPs and a brief review of recent advancements in GNNs for solving COPs, this paper proposes a unified framework for solving COPs based on GNNs, including graph representation of COPs, equivalent conversion of non-graph structured COPs to gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13125","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.13125/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":"2406.13125","created_at":"2026-07-05T08:34:25.498649+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.13125v1","created_at":"2026-07-05T08:34:25.498649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13125","created_at":"2026-07-05T08:34:25.498649+00:00"},{"alias_kind":"pith_short_12","alias_value":"KL7OYM6ZKQN7","created_at":"2026-07-05T08:34:25.498649+00:00"},{"alias_kind":"pith_short_16","alias_value":"KL7OYM6ZKQN7QM5O","created_at":"2026-07-05T08:34:25.498649+00:00"},{"alias_kind":"pith_short_8","alias_value":"KL7OYM6Z","created_at":"2026-07-05T08:34:25.498649+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07040","citing_title":"Not All Problems Are Best Modeled as MILP: A DSL-Centric Framework for Flexible and Accurate Optimization Modeling","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KL7OYM6ZKQN7QM5O2Z64PEFNYI","json":"https://pith.science/pith/KL7OYM6ZKQN7QM5O2Z64PEFNYI.json","graph_json":"https://pith.science/api/pith-number/KL7OYM6ZKQN7QM5O2Z64PEFNYI/graph.json","events_json":"https://pith.science/api/pith-number/KL7OYM6ZKQN7QM5O2Z64PEFNYI/events.json","paper":"https://pith.science/paper/KL7OYM6Z"},"agent_actions":{"view_html":"https://pith.science/pith/KL7OYM6ZKQN7QM5O2Z64PEFNYI","download_json":"https://pith.science/pith/KL7OYM6ZKQN7QM5O2Z64PEFNYI.json","view_paper":"https://pith.science/paper/KL7OYM6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.13125&json=true","fetch_graph":"https://pith.science/api/pith-number/KL7OYM6ZKQN7QM5O2Z64PEFNYI/graph.json","fetch_events":"https://pith.science/api/pith-number/KL7OYM6ZKQN7QM5O2Z64PEFNYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KL7OYM6ZKQN7QM5O2Z64PEFNYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KL7OYM6ZKQN7QM5O2Z64PEFNYI/action/storage_attestation","attest_author":"https://pith.science/pith/KL7OYM6ZKQN7QM5O2Z64PEFNYI/action/author_attestation","sign_citation":"https://pith.science/pith/KL7OYM6ZKQN7QM5O2Z64PEFNYI/action/citation_signature","submit_replication":"https://pith.science/pith/KL7OYM6ZKQN7QM5O2Z64PEFNYI/action/replication_record"}},"created_at":"2026-07-05T08:34:25.498649+00:00","updated_at":"2026-07-05T08:34:25.498649+00:00"}