{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XZIHVJPJBQDBTWOLKGVPVUNQSL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7d5f70c69e2f54adc49620510ceac3ecd2079ca9e60eaea3226a8904fedd0df1","cross_cats_sorted":["cs.GT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-07T01:09:37Z","title_canon_sha256":"5f8bd69111bc3e71861a921b787b7fb68f5f14c60ef80f2450c48b42c40a14b1"},"schema_version":"1.0","source":{"id":"2007.03151","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.03151","created_at":"2026-07-05T06:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"2007.03151v2","created_at":"2026-07-05T06:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03151","created_at":"2026-07-05T06:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"XZIHVJPJBQDB","created_at":"2026-07-05T06:02:59Z"},{"alias_kind":"pith_short_16","alias_value":"XZIHVJPJBQDBTWOL","created_at":"2026-07-05T06:02:59Z"},{"alias_kind":"pith_short_8","alias_value":"XZIHVJPJ","created_at":"2026-07-05T06:02:59Z"}],"graph_snapshots":[{"event_id":"sha256:7cf5c4004085faea7e0690a17a7ddb18cc29ad29385c6432b17f7c58701ed8fa","target":"graph","created_at":"2026-07-05T06:02:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.03151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning heuristics for combinatorial optimization problems through graph neural networks have recently shown promising results on some classic NP-hard problems. These are single-level optimization problems with only one player. Multilevel combinatorial optimization problems are their generalization, encompassing situations with multiple players taking decisions sequentially. By framing them in a multi-agent reinforcement learning setting, we devise a value-based method to learn to solve multilevel budgeted combinatorial problems involving two players in a zero-sum game over a graph. Our frame","authors_text":"Adel Nabli, Margarida Carvalho","cross_cats":["cs.GT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-07T01:09:37Z","title":"Curriculum learning for multilevel budgeted combinatorial problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03151","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:07a692acab48af0e4b63882e9cb67d3eea46b195d593c978f08cf2bc2320d699","target":"record","created_at":"2026-07-05T06:02:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7d5f70c69e2f54adc49620510ceac3ecd2079ca9e60eaea3226a8904fedd0df1","cross_cats_sorted":["cs.GT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-07T01:09:37Z","title_canon_sha256":"5f8bd69111bc3e71861a921b787b7fb68f5f14c60ef80f2450c48b42c40a14b1"},"schema_version":"1.0","source":{"id":"2007.03151","kind":"arxiv","version":2}},"canonical_sha256":"be507aa5e90c0619d9cb51aafad1b092e93dbbecaa8283df8a7707b04ec450ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be507aa5e90c0619d9cb51aafad1b092e93dbbecaa8283df8a7707b04ec450ae","first_computed_at":"2026-07-05T06:02:59.632902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:02:59.632902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y+fAT1F3OJbJTZF+q5H1KX/s9J617L59UpmrK1TaVEdlwTh/8SxHSuQYuET8QpoTtCsE9H7KZg48Z/fBfPO4Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:02:59.633310Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.03151","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07a692acab48af0e4b63882e9cb67d3eea46b195d593c978f08cf2bc2320d699","sha256:7cf5c4004085faea7e0690a17a7ddb18cc29ad29385c6432b17f7c58701ed8fa"],"state_sha256":"258413c307aef482037f4060bed2e2998ef9a33f86cca003a156ee9a73d03818"}