{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:24FI2QXCHAJUY6AWVDGCV3XHBM","short_pith_number":"pith:24FI2QXC","schema_version":"1.0","canonical_sha256":"d70a8d42e238134c7816a8cc2aeee70b204d12daad1f538fe3032c1b24d5efb0","source":{"kind":"arxiv","id":"2404.06492","version":2},"attestation_state":"computed","paper":{"title":"Graph Reinforcement Learning for Combinatorial Optimization: A Survey and Unifying Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mirco Musolesi, Stephen Hailes, Victor-Alexandru Darvariu","submitted_at":"2024-04-09T17:45:25Z","abstract_excerpt":"Graphs are a natural representation for systems based on relations between connected entities. Combinatorial optimization problems, which arise when considering an objective function related to a process of interest on discrete structures, are often challenging due to the rapid growth of the solution space. The trial-and-error paradigm of Reinforcement Learning has recently emerged as a promising alternative to traditional methods, such as exact algorithms and (meta)heuristics, for discovering better decision-making strategies in a variety of disciplines including chemistry, computer science, "},"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":"2404.06492","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-09T17:45:25Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"070facd95858e7785d24768d30a04d31c78f5d91cbd246c85c2e0f0dab5ade8a","abstract_canon_sha256":"dbca436fbc1743365e0ff940046a52d678a1b30fecfb4a0621d3f84b17a2d3ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:02.147998Z","signature_b64":"zc1QzHG2lDDRpIejFvcgm3Llsl/et+GImqEMl1OCOzI42ferqmYXDwQSDhI5GBH042fT0uVIv3GPddCFH3jrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d70a8d42e238134c7816a8cc2aeee70b204d12daad1f538fe3032c1b24d5efb0","last_reissued_at":"2026-07-05T08:57:02.147593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:02.147593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Reinforcement Learning for Combinatorial Optimization: A Survey and Unifying Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mirco Musolesi, Stephen Hailes, Victor-Alexandru Darvariu","submitted_at":"2024-04-09T17:45:25Z","abstract_excerpt":"Graphs are a natural representation for systems based on relations between connected entities. Combinatorial optimization problems, which arise when considering an objective function related to a process of interest on discrete structures, are often challenging due to the rapid growth of the solution space. The trial-and-error paradigm of Reinforcement Learning has recently emerged as a promising alternative to traditional methods, such as exact algorithms and (meta)heuristics, for discovering better decision-making strategies in a variety of disciplines including chemistry, computer science, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06492","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/2404.06492/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":"2404.06492","created_at":"2026-07-05T08:57:02.147648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.06492v2","created_at":"2026-07-05T08:57:02.147648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06492","created_at":"2026-07-05T08:57:02.147648+00:00"},{"alias_kind":"pith_short_12","alias_value":"24FI2QXCHAJU","created_at":"2026-07-05T08:57:02.147648+00:00"},{"alias_kind":"pith_short_16","alias_value":"24FI2QXCHAJUY6AW","created_at":"2026-07-05T08:57:02.147648+00:00"},{"alias_kind":"pith_short_8","alias_value":"24FI2QXC","created_at":"2026-07-05T08:57:02.147648+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10321","citing_title":"Baseline-Free Policy Optimization for Neural Combinatorial Optimization","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04167","citing_title":"Smart Transportation Without Neurons -- Fair Metro Network Expansion with Tabular Reinforcement Learning","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/24FI2QXCHAJUY6AWVDGCV3XHBM","json":"https://pith.science/pith/24FI2QXCHAJUY6AWVDGCV3XHBM.json","graph_json":"https://pith.science/api/pith-number/24FI2QXCHAJUY6AWVDGCV3XHBM/graph.json","events_json":"https://pith.science/api/pith-number/24FI2QXCHAJUY6AWVDGCV3XHBM/events.json","paper":"https://pith.science/paper/24FI2QXC"},"agent_actions":{"view_html":"https://pith.science/pith/24FI2QXCHAJUY6AWVDGCV3XHBM","download_json":"https://pith.science/pith/24FI2QXCHAJUY6AWVDGCV3XHBM.json","view_paper":"https://pith.science/paper/24FI2QXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.06492&json=true","fetch_graph":"https://pith.science/api/pith-number/24FI2QXCHAJUY6AWVDGCV3XHBM/graph.json","fetch_events":"https://pith.science/api/pith-number/24FI2QXCHAJUY6AWVDGCV3XHBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24FI2QXCHAJUY6AWVDGCV3XHBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24FI2QXCHAJUY6AWVDGCV3XHBM/action/storage_attestation","attest_author":"https://pith.science/pith/24FI2QXCHAJUY6AWVDGCV3XHBM/action/author_attestation","sign_citation":"https://pith.science/pith/24FI2QXCHAJUY6AWVDGCV3XHBM/action/citation_signature","submit_replication":"https://pith.science/pith/24FI2QXCHAJUY6AWVDGCV3XHBM/action/replication_record"}},"created_at":"2026-07-05T08:57:02.147648+00:00","updated_at":"2026-07-05T08:57:02.147648+00:00"}