{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SFEUU3LGZHVLAQVNSMNUZLEJ5O","short_pith_number":"pith:SFEUU3LG","canonical_record":{"source":{"id":"2410.15714","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T07:33:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9fe916403aa1392ab07f552227fb6cd3670953e5000cd3c82cc07f6a5f343fd0","abstract_canon_sha256":"aa96257a5f802765ba34ec56f81d5bbbcc6aef2cca0b0ba70fbd90a2a8987282"},"schema_version":"1.0"},"canonical_sha256":"91494a6d66c9eab042ad931b4cac89eba7cd0311787e9c09b429fd1c8e021b01","source":{"kind":"arxiv","id":"2410.15714","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.15714","created_at":"2026-07-05T10:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"2410.15714v3","created_at":"2026-07-05T10:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.15714","created_at":"2026-07-05T10:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"SFEUU3LGZHVL","created_at":"2026-07-05T10:44:40Z"},{"alias_kind":"pith_short_16","alias_value":"SFEUU3LGZHVLAQVN","created_at":"2026-07-05T10:44:40Z"},{"alias_kind":"pith_short_8","alias_value":"SFEUU3LG","created_at":"2026-07-05T10:44:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SFEUU3LGZHVLAQVNSMNUZLEJ5O","target":"record","payload":{"canonical_record":{"source":{"id":"2410.15714","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T07:33:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9fe916403aa1392ab07f552227fb6cd3670953e5000cd3c82cc07f6a5f343fd0","abstract_canon_sha256":"aa96257a5f802765ba34ec56f81d5bbbcc6aef2cca0b0ba70fbd90a2a8987282"},"schema_version":"1.0"},"canonical_sha256":"91494a6d66c9eab042ad931b4cac89eba7cd0311787e9c09b429fd1c8e021b01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:40.758046Z","signature_b64":"rnlOAcLoriT4tuF4YnE3AtSVPEDMY7rb1l4ueD6ULkoCDIRJQfxMKCKcCjCB9ajHpheL+9aI1yoYf/BkDYYzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91494a6d66c9eab042ad931b4cac89eba7cd0311787e9c09b429fd1c8e021b01","last_reissued_at":"2026-07-05T10:44:40.757566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:40.757566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.15714","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-05T10:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRpD6KIzRcLyfHfPMfheUd1S0uzQIpLRueMP9z5p40qjOmGEhMtULjfxe0fYuie5qDM1xsz0dSlEpGttxQZzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:27:59.014147Z"},"content_sha256":"670cace43177724f26020a43bac110064311903f72367218276cafb00afdb94c","schema_version":"1.0","event_id":"sha256:670cace43177724f26020a43bac110064311903f72367218276cafb00afdb94c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SFEUU3LGZHVLAQVNSMNUZLEJ5O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Offline reinforcement learning for job-shop scheduling problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Imanol Echeverria, Maialen Murua, Roberto Santana","submitted_at":"2024-10-21T07:33:42Z","abstract_excerpt":"Recent advances in deep learning have shown significant potential for solving combinatorial optimization problems in real-time. Unlike traditional methods, deep learning can generate high-quality solutions efficiently, which is crucial for applications like routing and scheduling. However, existing approaches like deep reinforcement learning (RL) and behavioral cloning have notable limitations, with deep RL suffering from slow learning and behavioral cloning relying solely on expert actions, which can lead to generalization issues and neglect of the optimization objective. This paper introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.15714","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/2410.15714/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-05T10:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sabTdZmtzMKfI02HEfQS6HnqPzO13xFUa1m8sIg8KsN+DX+ZZX8XYqstMQw838jmOjeRAkGOAM2VsbgJnVp2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:27:59.014732Z"},"content_sha256":"9195adfe2a7e6f9f5b346257c259b2c97fa23eb0d24885caa18b1f6f7a8976ac","schema_version":"1.0","event_id":"sha256:9195adfe2a7e6f9f5b346257c259b2c97fa23eb0d24885caa18b1f6f7a8976ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SFEUU3LGZHVLAQVNSMNUZLEJ5O/bundle.json","state_url":"https://pith.science/pith/SFEUU3LGZHVLAQVNSMNUZLEJ5O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SFEUU3LGZHVLAQVNSMNUZLEJ5O/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-08-09T14:27:59Z","links":{"resolver":"https://pith.science/pith/SFEUU3LGZHVLAQVNSMNUZLEJ5O","bundle":"https://pith.science/pith/SFEUU3LGZHVLAQVNSMNUZLEJ5O/bundle.json","state":"https://pith.science/pith/SFEUU3LGZHVLAQVNSMNUZLEJ5O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SFEUU3LGZHVLAQVNSMNUZLEJ5O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SFEUU3LGZHVLAQVNSMNUZLEJ5O","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":"aa96257a5f802765ba34ec56f81d5bbbcc6aef2cca0b0ba70fbd90a2a8987282","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T07:33:42Z","title_canon_sha256":"9fe916403aa1392ab07f552227fb6cd3670953e5000cd3c82cc07f6a5f343fd0"},"schema_version":"1.0","source":{"id":"2410.15714","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.15714","created_at":"2026-07-05T10:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"2410.15714v3","created_at":"2026-07-05T10:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.15714","created_at":"2026-07-05T10:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"SFEUU3LGZHVL","created_at":"2026-07-05T10:44:40Z"},{"alias_kind":"pith_short_16","alias_value":"SFEUU3LGZHVLAQVN","created_at":"2026-07-05T10:44:40Z"},{"alias_kind":"pith_short_8","alias_value":"SFEUU3LG","created_at":"2026-07-05T10:44:40Z"}],"graph_snapshots":[{"event_id":"sha256:9195adfe2a7e6f9f5b346257c259b2c97fa23eb0d24885caa18b1f6f7a8976ac","target":"graph","created_at":"2026-07-05T10:44:40Z","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/2410.15714/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent advances in deep learning have shown significant potential for solving combinatorial optimization problems in real-time. Unlike traditional methods, deep learning can generate high-quality solutions efficiently, which is crucial for applications like routing and scheduling. However, existing approaches like deep reinforcement learning (RL) and behavioral cloning have notable limitations, with deep RL suffering from slow learning and behavioral cloning relying solely on expert actions, which can lead to generalization issues and neglect of the optimization objective. This paper introduce","authors_text":"Imanol Echeverria, Maialen Murua, Roberto Santana","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T07:33:42Z","title":"Offline reinforcement learning for job-shop scheduling problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.15714","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:670cace43177724f26020a43bac110064311903f72367218276cafb00afdb94c","target":"record","created_at":"2026-07-05T10:44:40Z","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":"aa96257a5f802765ba34ec56f81d5bbbcc6aef2cca0b0ba70fbd90a2a8987282","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T07:33:42Z","title_canon_sha256":"9fe916403aa1392ab07f552227fb6cd3670953e5000cd3c82cc07f6a5f343fd0"},"schema_version":"1.0","source":{"id":"2410.15714","kind":"arxiv","version":3}},"canonical_sha256":"91494a6d66c9eab042ad931b4cac89eba7cd0311787e9c09b429fd1c8e021b01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91494a6d66c9eab042ad931b4cac89eba7cd0311787e9c09b429fd1c8e021b01","first_computed_at":"2026-07-05T10:44:40.757566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:44:40.757566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rnlOAcLoriT4tuF4YnE3AtSVPEDMY7rb1l4ueD6ULkoCDIRJQfxMKCKcCjCB9ajHpheL+9aI1yoYf/BkDYYzCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:44:40.758046Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.15714","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:670cace43177724f26020a43bac110064311903f72367218276cafb00afdb94c","sha256:9195adfe2a7e6f9f5b346257c259b2c97fa23eb0d24885caa18b1f6f7a8976ac"],"state_sha256":"88d1e06a84e17c57bb4d7941917b21a23ba4f68501e309ed1f3d356099ba5374"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sc4zSK8sbd2mNpK2AbLSu3bmo/8Jg8zNVBSPs773Kp2nn9C/ZNSuKdphBPTFZfEbXMdi8bHLZtz+XrKyDEJxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T14:27:59.020730Z","bundle_sha256":"6b3a98d8d65c64c5f8b0986bfd8987cc9402c17424a9d25e322326c8f13d0a3c"}}