{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GEARKFRTCCFQMDYXVFPFI2VPC7","short_pith_number":"pith:GEARKFRT","canonical_record":{"source":{"id":"2301.03313","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-09T13:08:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8f60eb71bf2c383cfe9f94555af290332526dc54b8d2f4aa7af62aa674aa3c3d","abstract_canon_sha256":"83e7d8c8c833bbe942d085cd5320a9e3a4abba0931b3dfeb6f554816e8635f42"},"schema_version":"1.0"},"canonical_sha256":"3101151633108b060f17a95e546aaf17eaea0015605cdbba8175fb0fd25db6da","source":{"kind":"arxiv","id":"2301.03313","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GEARKFRTCCFQMDYXVFPFI2VPC7","target":"record","payload":{"canonical_record":{"source":{"id":"2301.03313","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-09T13:08:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8f60eb71bf2c383cfe9f94555af290332526dc54b8d2f4aa7af62aa674aa3c3d","abstract_canon_sha256":"83e7d8c8c833bbe942d085cd5320a9e3a4abba0931b3dfeb6f554816e8635f42"},"schema_version":"1.0"},"canonical_sha256":"3101151633108b060f17a95e546aaf17eaea0015605cdbba8175fb0fd25db6da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:55:22.003480Z","signature_b64":"WWu05dB0m3JXUSe3o28wJVYc8203Ba/e2zCjTEDwSoGZTrJEzdvAFHJnhOlbrWcVgwNGuxf5TUM1vN70C4/rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3101151633108b060f17a95e546aaf17eaea0015605cdbba8175fb0fd25db6da","last_reissued_at":"2026-07-05T06:55:22.002985Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:55:22.002985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.03313","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:55:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aH7HUv1/7te8MhRbSUeSWHUu2hRrZNid6QZgTvEDXp7s5zdodLDO9sqUKamWjmjnzBNLSDd9K4s2SptAVETxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T13:37:11.537764Z"},"content_sha256":"744d5fb352cbc1e073c2a8c2087dd37c18bd638f56b14059fc7ddfbfbf0d869d","schema_version":"1.0","event_id":"sha256:744d5fb352cbc1e073c2a8c2087dd37c18bd638f56b14059fc7ddfbfbf0d869d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GEARKFRTCCFQMDYXVFPFI2VPC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Arnaud Sors, Darko Drakulic, Florian Mai, Jean-Marc Andreoli, Sofia Michel","submitted_at":"2023-01-09T13:08:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03313","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/2301.03313/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:55:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHm3p8s8jOjXbeQBi69lAoBTR4s1stzrZuxuA287Cs/FnHuPUCkf411UPrqepiZCnrPaGFJJNKoz/iTHT210Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T13:37:11.538432Z"},"content_sha256":"d9ceecb137efcffa19b60f62a8bd722e6071de95a411f1eb4427a29f2568d596","schema_version":"1.0","event_id":"sha256:d9ceecb137efcffa19b60f62a8bd722e6071de95a411f1eb4427a29f2568d596"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEARKFRTCCFQMDYXVFPFI2VPC7/bundle.json","state_url":"https://pith.science/pith/GEARKFRTCCFQMDYXVFPFI2VPC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEARKFRTCCFQMDYXVFPFI2VPC7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-12T13:37:11Z","links":{"resolver":"https://pith.science/pith/GEARKFRTCCFQMDYXVFPFI2VPC7","bundle":"https://pith.science/pith/GEARKFRTCCFQMDYXVFPFI2VPC7/bundle.json","state":"https://pith.science/pith/GEARKFRTCCFQMDYXVFPFI2VPC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEARKFRTCCFQMDYXVFPFI2VPC7/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eMxSqKOJD6jUro3dwsV1RsJrtjf3ya3w+2gQKBnNIs5/UCC4dTp9zy4QjMryPyh/1Yec2ani6BbCnFlMUfPyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T13:37:11.541641Z","bundle_sha256":"850e54789e60caf32329844bf10fcbd03eed8c1f45f526fc1dfef621335a99d3"}}