{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:K53C44D6IHMZELHDQM5ENRZKHV","short_pith_number":"pith:K53C44D6","canonical_record":{"source":{"id":"2402.09765","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-15T07:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"1306f487779534f1269e42b7b6d1d40bb7f506bf3c8de706203971177371fbf1","abstract_canon_sha256":"7a339da5110cbca20cf9532c4ed661653690697c8140250f8775428b4873a096"},"schema_version":"1.0"},"canonical_sha256":"57762e707e41d9922ce3833a46c72a3d59dd4e6c4b4bee33a369d850094dc6a4","source":{"kind":"arxiv","id":"2402.09765","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09765","created_at":"2026-07-05T07:45:36Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09765v1","created_at":"2026-07-05T07:45:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09765","created_at":"2026-07-05T07:45:36Z"},{"alias_kind":"pith_short_12","alias_value":"K53C44D6IHMZ","created_at":"2026-07-05T07:45:36Z"},{"alias_kind":"pith_short_16","alias_value":"K53C44D6IHMZELHD","created_at":"2026-07-05T07:45:36Z"},{"alias_kind":"pith_short_8","alias_value":"K53C44D6","created_at":"2026-07-05T07:45:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:K53C44D6IHMZELHDQM5ENRZKHV","target":"record","payload":{"canonical_record":{"source":{"id":"2402.09765","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-15T07:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"1306f487779534f1269e42b7b6d1d40bb7f506bf3c8de706203971177371fbf1","abstract_canon_sha256":"7a339da5110cbca20cf9532c4ed661653690697c8140250f8775428b4873a096"},"schema_version":"1.0"},"canonical_sha256":"57762e707e41d9922ce3833a46c72a3d59dd4e6c4b4bee33a369d850094dc6a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:36.595026Z","signature_b64":"O7wMDDkqCmQuQeoRgLUUxQviR4rH8oa+1m64+eJukVGr2RF83Ewv4ENUMflDVHpJngxertVlum5m0CMPEzCAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57762e707e41d9922ce3833a46c72a3d59dd4e6c4b4bee33a369d850094dc6a4","last_reissued_at":"2026-07-05T07:45:36.594600Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:36.594600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.09765","source_version":1,"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-05T07:45:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HtZ3dm85nbQoW4vnlLmGNAVdWnqei62aji72Bujr1/Bop2VbaF4qtcQdfiWg+rAC22brp5N2viPTp6iIGy1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:42:45.359682Z"},"content_sha256":"50f5a297a4c8f74e0a46741b74e36408d96c392ee11fef5e6126d43e1fcd80c7","schema_version":"1.0","event_id":"sha256:50f5a297a4c8f74e0a46741b74e36408d96c392ee11fef5e6126d43e1fcd80c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:K53C44D6IHMZELHDQM5ENRZKHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement Learning for Solving Stochastic Vehicle Routing Problem with Time Windows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ikboljon Sobirov, Martin Takac, Ruben Solozabal, Zangir Iklassov","submitted_at":"2024-02-15T07:35:29Z","abstract_excerpt":"This paper introduces a reinforcement learning approach to optimize the Stochastic Vehicle Routing Problem with Time Windows (SVRP), focusing on reducing travel costs in goods delivery. We develop a novel SVRP formulation that accounts for uncertain travel costs and demands, alongside specific customer time windows. An attention-based neural network trained through reinforcement learning is employed to minimize routing costs. Our approach addresses a gap in SVRP research, which traditionally relies on heuristic methods, by leveraging machine learning. The model outperforms the Ant-Colony Optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09765","kind":"arxiv","version":1},"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/2402.09765/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-05T07:45:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+KCIsiu5oMtZeqrbhcgLjqQRqHVrcPLExp/Si16VhWRV1Hr9wYp0x/HzyBrpoqoKGvEZHuPx0c4847I/zWvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:42:45.360054Z"},"content_sha256":"d95c38202f7d40578b49195c3e446b43839a3905933c76b68aafb29bc5ad9d05","schema_version":"1.0","event_id":"sha256:d95c38202f7d40578b49195c3e446b43839a3905933c76b68aafb29bc5ad9d05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K53C44D6IHMZELHDQM5ENRZKHV/bundle.json","state_url":"https://pith.science/pith/K53C44D6IHMZELHDQM5ENRZKHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K53C44D6IHMZELHDQM5ENRZKHV/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-07T13:42:45Z","links":{"resolver":"https://pith.science/pith/K53C44D6IHMZELHDQM5ENRZKHV","bundle":"https://pith.science/pith/K53C44D6IHMZELHDQM5ENRZKHV/bundle.json","state":"https://pith.science/pith/K53C44D6IHMZELHDQM5ENRZKHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K53C44D6IHMZELHDQM5ENRZKHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:K53C44D6IHMZELHDQM5ENRZKHV","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":"7a339da5110cbca20cf9532c4ed661653690697c8140250f8775428b4873a096","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-15T07:35:29Z","title_canon_sha256":"1306f487779534f1269e42b7b6d1d40bb7f506bf3c8de706203971177371fbf1"},"schema_version":"1.0","source":{"id":"2402.09765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09765","created_at":"2026-07-05T07:45:36Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09765v1","created_at":"2026-07-05T07:45:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09765","created_at":"2026-07-05T07:45:36Z"},{"alias_kind":"pith_short_12","alias_value":"K53C44D6IHMZ","created_at":"2026-07-05T07:45:36Z"},{"alias_kind":"pith_short_16","alias_value":"K53C44D6IHMZELHD","created_at":"2026-07-05T07:45:36Z"},{"alias_kind":"pith_short_8","alias_value":"K53C44D6","created_at":"2026-07-05T07:45:36Z"}],"graph_snapshots":[{"event_id":"sha256:d95c38202f7d40578b49195c3e446b43839a3905933c76b68aafb29bc5ad9d05","target":"graph","created_at":"2026-07-05T07:45:36Z","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/2402.09765/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a reinforcement learning approach to optimize the Stochastic Vehicle Routing Problem with Time Windows (SVRP), focusing on reducing travel costs in goods delivery. We develop a novel SVRP formulation that accounts for uncertain travel costs and demands, alongside specific customer time windows. An attention-based neural network trained through reinforcement learning is employed to minimize routing costs. Our approach addresses a gap in SVRP research, which traditionally relies on heuristic methods, by leveraging machine learning. The model outperforms the Ant-Colony Optim","authors_text":"Ikboljon Sobirov, Martin Takac, Ruben Solozabal, Zangir Iklassov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-15T07:35:29Z","title":"Reinforcement Learning for Solving Stochastic Vehicle Routing Problem with Time Windows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09765","kind":"arxiv","version":1},"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:50f5a297a4c8f74e0a46741b74e36408d96c392ee11fef5e6126d43e1fcd80c7","target":"record","created_at":"2026-07-05T07:45:36Z","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":"7a339da5110cbca20cf9532c4ed661653690697c8140250f8775428b4873a096","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-15T07:35:29Z","title_canon_sha256":"1306f487779534f1269e42b7b6d1d40bb7f506bf3c8de706203971177371fbf1"},"schema_version":"1.0","source":{"id":"2402.09765","kind":"arxiv","version":1}},"canonical_sha256":"57762e707e41d9922ce3833a46c72a3d59dd4e6c4b4bee33a369d850094dc6a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57762e707e41d9922ce3833a46c72a3d59dd4e6c4b4bee33a369d850094dc6a4","first_computed_at":"2026-07-05T07:45:36.594600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:45:36.594600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O7wMDDkqCmQuQeoRgLUUxQviR4rH8oa+1m64+eJukVGr2RF83Ewv4ENUMflDVHpJngxertVlum5m0CMPEzCAAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:45:36.595026Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.09765","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50f5a297a4c8f74e0a46741b74e36408d96c392ee11fef5e6126d43e1fcd80c7","sha256:d95c38202f7d40578b49195c3e446b43839a3905933c76b68aafb29bc5ad9d05"],"state_sha256":"0f7d4c6ea6eeb815915dd8ab5ba8680a6392f8397de1e91b3b6c7d761bb1de00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwgvwmJpo3fFX/j8D1VV5s6ANjnOWvD0OkbDLXiTPktpAa/JXPfYqj+VGDK0tJRf5Gamiy6gLc7ikygmPGLoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:42:45.362049Z","bundle_sha256":"ddf04e6326e217ab2ce52e2468e3e6f46e3dca9f518bd657abbd0f85a91a24fe"}}