{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GKARKMBPZRQR4CDFZ3HGTXK7RY","short_pith_number":"pith:GKARKMBP","schema_version":"1.0","canonical_sha256":"328115302fcc611e0865cece69dd5f8e18d9f22480dfeefa50bffbf9a5d9e346","source":{"kind":"arxiv","id":"2311.13569","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial Optimization with Policy Adaptation using Latent Space Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexandre Laterre, Arnu Pretorius, Clement Bonnet, Felix Chalumeau, Nathan Grinsztajn, Shikha Surana, Thomas D. Barrett","submitted_at":"2023-11-13T12:24:54Z","abstract_excerpt":"Combinatorial Optimization underpins many real-world applications and yet, designing performant algorithms to solve these complex, typically NP-hard, problems remains a significant research challenge. Reinforcement Learning (RL) provides a versatile framework for designing heuristics across a broad spectrum of problem domains. However, despite notable progress, RL has not yet supplanted industrial solvers as the go-to solution. Current approaches emphasize pre-training heuristics that construct solutions but often rely on search procedures with limited variance, such as stochastically sampling"},"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":"2311.13569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-13T12:24:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d8784d4752241135e8cebc60a995c3667c49ee228b063c50d4acbda4a89d8397","abstract_canon_sha256":"9c05fc75b5a8c3f66a64fe2757aca1db0f1ee1eff81612463281a613e02e4f15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:57.677630Z","signature_b64":"9V9gCUjel1A7p4H0ryCbXNADaqcSkZ8Pg8LkZwCZg22H+vOGEGjZpVqzp695WmDM/DESCzzkzw0pl/xYUPiyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"328115302fcc611e0865cece69dd5f8e18d9f22480dfeefa50bffbf9a5d9e346","last_reissued_at":"2026-07-05T08:23:57.677116Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:57.677116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Optimization with Policy Adaptation using Latent Space Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexandre Laterre, Arnu Pretorius, Clement Bonnet, Felix Chalumeau, Nathan Grinsztajn, Shikha Surana, Thomas D. Barrett","submitted_at":"2023-11-13T12:24:54Z","abstract_excerpt":"Combinatorial Optimization underpins many real-world applications and yet, designing performant algorithms to solve these complex, typically NP-hard, problems remains a significant research challenge. Reinforcement Learning (RL) provides a versatile framework for designing heuristics across a broad spectrum of problem domains. However, despite notable progress, RL has not yet supplanted industrial solvers as the go-to solution. Current approaches emphasize pre-training heuristics that construct solutions but often rely on search procedures with limited variance, such as stochastically sampling"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13569","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/2311.13569/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":"2311.13569","created_at":"2026-07-05T08:23:57.677175+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13569v2","created_at":"2026-07-05T08:23:57.677175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13569","created_at":"2026-07-05T08:23:57.677175+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKARKMBPZRQR","created_at":"2026-07-05T08:23:57.677175+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKARKMBPZRQR4CDF","created_at":"2026-07-05T08:23:57.677175+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKARKMBP","created_at":"2026-07-05T08:23:57.677175+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10611","citing_title":"Geometry-Aware Reinforcement Learning for 2D Irregular Nesting","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GKARKMBPZRQR4CDFZ3HGTXK7RY","json":"https://pith.science/pith/GKARKMBPZRQR4CDFZ3HGTXK7RY.json","graph_json":"https://pith.science/api/pith-number/GKARKMBPZRQR4CDFZ3HGTXK7RY/graph.json","events_json":"https://pith.science/api/pith-number/GKARKMBPZRQR4CDFZ3HGTXK7RY/events.json","paper":"https://pith.science/paper/GKARKMBP"},"agent_actions":{"view_html":"https://pith.science/pith/GKARKMBPZRQR4CDFZ3HGTXK7RY","download_json":"https://pith.science/pith/GKARKMBPZRQR4CDFZ3HGTXK7RY.json","view_paper":"https://pith.science/paper/GKARKMBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13569&json=true","fetch_graph":"https://pith.science/api/pith-number/GKARKMBPZRQR4CDFZ3HGTXK7RY/graph.json","fetch_events":"https://pith.science/api/pith-number/GKARKMBPZRQR4CDFZ3HGTXK7RY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKARKMBPZRQR4CDFZ3HGTXK7RY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKARKMBPZRQR4CDFZ3HGTXK7RY/action/storage_attestation","attest_author":"https://pith.science/pith/GKARKMBPZRQR4CDFZ3HGTXK7RY/action/author_attestation","sign_citation":"https://pith.science/pith/GKARKMBPZRQR4CDFZ3HGTXK7RY/action/citation_signature","submit_replication":"https://pith.science/pith/GKARKMBPZRQR4CDFZ3HGTXK7RY/action/replication_record"}},"created_at":"2026-07-05T08:23:57.677175+00:00","updated_at":"2026-07-05T08:23:57.677175+00:00"}