{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6TQE6SD7UBJO2YAKEJXTCTK64N","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":"07f07ea7b94529e4610227e22f2ad49cbb5c0edb79190d8903d805bc8062db3a","cross_cats_sorted":["cs.LG","math.OC","stat.ME"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2024-07-24T12:00:30Z","title_canon_sha256":"7959503300211da185e49998de1e016b4f7b55dc427604ade30b123f7531ccc7"},"schema_version":"1.0","source":{"id":"2407.17200","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.17200","created_at":"2026-05-20T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2407.17200v3","created_at":"2026-05-20T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17200","created_at":"2026-05-20T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"6TQE6SD7UBJO","created_at":"2026-05-20T01:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"6TQE6SD7UBJO2YAK","created_at":"2026-05-20T01:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"6TQE6SD7","created_at":"2026-05-20T01:04:49Z"}],"graph_snapshots":[{"event_id":"sha256:818fd0f9f2e18b129ebb4622b17fa065174834f19c6818d85566209648e48859","target":"graph","created_at":"2026-05-20T01:04:49Z","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/2407.17200/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many real-world decision problems require solving, again and again, combinatorial optimization instances drawn from a common distribution. A recent line of structured learning methods exploits this regularity by learning policies that pair a statistical model with a tractable combinatorial oracle, instead of solving each instance independently. Training such policies is notoriously difficult, however: the resulting empirical risk is piecewise constant in the model parameters, which hinders gradient-based optimization, and only a few theoretical guarantees have been provided so far. We address ","authors_text":"Alessandro Rudi, Axel Parmentier, Pierre-Cyril Aubin-Frankowski, Yohann De Castro","cross_cats":["cs.LG","math.OC","stat.ME"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2024-07-24T12:00:30Z","title":"Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17200","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:eb39c02ff56df3aa017fd1f3cd69e2ce228cb4cf7473673e94bd8377e6944a7c","target":"record","created_at":"2026-05-20T01:04:49Z","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":"07f07ea7b94529e4610227e22f2ad49cbb5c0edb79190d8903d805bc8062db3a","cross_cats_sorted":["cs.LG","math.OC","stat.ME"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2024-07-24T12:00:30Z","title_canon_sha256":"7959503300211da185e49998de1e016b4f7b55dc427604ade30b123f7531ccc7"},"schema_version":"1.0","source":{"id":"2407.17200","kind":"arxiv","version":3}},"canonical_sha256":"f4e04f487fa052ed600a226f314d5ee36d2d2b33ace31e9e789102d5205e56c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4e04f487fa052ed600a226f314d5ee36d2d2b33ace31e9e789102d5205e56c6","first_computed_at":"2026-05-20T01:04:49.749360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:04:49.749360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FXLzG903313u+tTGg4OYLuhTcH5XeAbJbCzhdp64qobjqWGHL6VApsUhKqOAGdPPf/YkJWehIj2oqrf9cerZDg==","signature_status":"signed_v1","signed_at":"2026-05-20T01:04:49.750274Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.17200","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb39c02ff56df3aa017fd1f3cd69e2ce228cb4cf7473673e94bd8377e6944a7c","sha256:818fd0f9f2e18b129ebb4622b17fa065174834f19c6818d85566209648e48859"],"state_sha256":"632c3186d77c1068fefe620db35323ece85e35eabe54e8848c272a722ad72c83"}