{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GEARKFRTCCFQMDYXVFPFI2VPC7","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":"83e7d8c8c833bbe942d085cd5320a9e3a4abba0931b3dfeb6f554816e8635f42","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-09T13:08:59Z","title_canon_sha256":"8f60eb71bf2c383cfe9f94555af290332526dc54b8d2f4aa7af62aa674aa3c3d"},"schema_version":"1.0","source":{"id":"2301.03313","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.03313","created_at":"2026-07-05T06:55:22Z"},{"alias_kind":"arxiv_version","alias_value":"2301.03313v3","created_at":"2026-07-05T06:55:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03313","created_at":"2026-07-05T06:55:22Z"},{"alias_kind":"pith_short_12","alias_value":"GEARKFRTCCFQ","created_at":"2026-07-05T06:55:22Z"},{"alias_kind":"pith_short_16","alias_value":"GEARKFRTCCFQMDYX","created_at":"2026-07-05T06:55:22Z"},{"alias_kind":"pith_short_8","alias_value":"GEARKFRT","created_at":"2026-07-05T06:55:22Z"}],"graph_snapshots":[{"event_id":"sha256:d9ceecb137efcffa19b60f62a8bd722e6071de95a411f1eb4427a29f2568d596","target":"graph","created_at":"2026-07-05T06:55:22Z","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/2301.03313/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Despite the success of neural-based combinatorial optimization methods for end-to-end heuristic learning, out-of-distribution generalization remains a challenge. In this paper, we present a novel formulation of Combinatorial Optimization Problems (COPs) as Markov Decision Processes (MDPs) that effectively leverages common symmetries of COPs to improve out-of-distribution robustness. Starting from a direct MDP formulation of a constructive method, we introduce a generic way to reduce the state space, based on Bisimulation Quotienting (BQ) in MDPs. Then, for COPs with a recursive nature, we spec","authors_text":"Arnaud Sors, Darko Drakulic, Florian Mai, Jean-Marc Andreoli, Sofia Michel","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-09T13:08:59Z","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03313","kind":"arxiv","version":3},"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:744d5fb352cbc1e073c2a8c2087dd37c18bd638f56b14059fc7ddfbfbf0d869d","target":"record","created_at":"2026-07-05T06:55:22Z","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":"83e7d8c8c833bbe942d085cd5320a9e3a4abba0931b3dfeb6f554816e8635f42","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-09T13:08:59Z","title_canon_sha256":"8f60eb71bf2c383cfe9f94555af290332526dc54b8d2f4aa7af62aa674aa3c3d"},"schema_version":"1.0","source":{"id":"2301.03313","kind":"arxiv","version":3}},"canonical_sha256":"3101151633108b060f17a95e546aaf17eaea0015605cdbba8175fb0fd25db6da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3101151633108b060f17a95e546aaf17eaea0015605cdbba8175fb0fd25db6da","first_computed_at":"2026-07-05T06:55:22.002985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:55:22.002985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WWu05dB0m3JXUSe3o28wJVYc8203Ba/e2zCjTEDwSoGZTrJEzdvAFHJnhOlbrWcVgwNGuxf5TUM1vN70C4/rAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:55:22.003480Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.03313","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:744d5fb352cbc1e073c2a8c2087dd37c18bd638f56b14059fc7ddfbfbf0d869d","sha256:d9ceecb137efcffa19b60f62a8bd722e6071de95a411f1eb4427a29f2568d596"],"state_sha256":"56a74328c9976e7a076cde68496a8df857763dfcbb7e2d54edd991b0625d796a"}