{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CHFNGIILYS4B76RZLGRP3IVUYB","short_pith_number":"pith:CHFNGIIL","canonical_record":{"source":{"id":"2606.17545","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T05:49:43Z","cross_cats_sorted":["q-fin.CP","q-fin.PR"],"title_canon_sha256":"fd978cc55b34f3ad9b97106783d37216fba994f0c13dd103588e6fecd6dc81d8","abstract_canon_sha256":"565985e117177b239a97ec05809b6e50f580ecbebed9b115ae66446ccb0bf171"},"schema_version":"1.0"},"canonical_sha256":"11cad3210bc4b81ffa3959a2fda2b4c067b2e4053a88d68bbecd5fb564b0d4b8","source":{"kind":"arxiv","id":"2606.17545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17545","created_at":"2026-06-19T16:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17545v1","created_at":"2026-06-19T16:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17545","created_at":"2026-06-19T16:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"CHFNGIILYS4B","created_at":"2026-06-19T16:10:15Z"},{"alias_kind":"pith_short_16","alias_value":"CHFNGIILYS4B76RZ","created_at":"2026-06-19T16:10:15Z"},{"alias_kind":"pith_short_8","alias_value":"CHFNGIIL","created_at":"2026-06-19T16:10:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CHFNGIILYS4B76RZLGRP3IVUYB","target":"record","payload":{"canonical_record":{"source":{"id":"2606.17545","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T05:49:43Z","cross_cats_sorted":["q-fin.CP","q-fin.PR"],"title_canon_sha256":"fd978cc55b34f3ad9b97106783d37216fba994f0c13dd103588e6fecd6dc81d8","abstract_canon_sha256":"565985e117177b239a97ec05809b6e50f580ecbebed9b115ae66446ccb0bf171"},"schema_version":"1.0"},"canonical_sha256":"11cad3210bc4b81ffa3959a2fda2b4c067b2e4053a88d68bbecd5fb564b0d4b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:15.672347Z","signature_b64":"YUZkAAJgEeqrAp7a9T0mQ3fwyTmsNhu048xKEKzUBHa8gGWAkCo8EoMgWE22iXNavhYcEevSkH+IcIkgIzh3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11cad3210bc4b81ffa3959a2fda2b4c067b2e4053a88d68bbecd5fb564b0d4b8","last_reissued_at":"2026-06-19T16:10:15.671978Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:15.671978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.17545","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-06-19T16:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OqoZ5cgV4H5IlhAWMCe7xIeqV4XwfowvYbi3/lr/CPrRPqBbIiqNuIjRqjn3Sc7Z7FyrofHtr1pQIpFhMp0FCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:50:09.760577Z"},"content_sha256":"6f9c525acfa75a5e859f4c3dd55d4dcab61493c032c8130a885118696499b9cb","schema_version":"1.0","event_id":"sha256:6f9c525acfa75a5e859f4c3dd55d4dcab61493c032c8130a885118696499b9cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CHFNGIILYS4B76RZLGRP3IVUYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous-time Optimal Stopping through Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["q-fin.CP","q-fin.PR"],"primary_cat":"cs.LG","authors_text":"Cosmin Borsa, Michael Ludkovski","submitted_at":"2026-06-16T05:49:43Z","abstract_excerpt":"Simulation based solvers for optimal stopping problems must discretize the stopping decision. Under classical dynamic programming, a coarse exercise grid with only a few stopping opportunities can materially undervalue the optimal expected reward, whereas on a very fine grid, approximation errors accumulate through the backward recursion. To remove this limitation, we develop a new reinforcement-learning inspired algorithm that enables us to learn the exercise rule at arbitrarily fine time resolution. Our CARLOS (Continuous-time Adaptive Reinforcement Learning for Optimal Stopping) algorithm u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17545","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/2606.17545/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-06-19T16:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMH7qja9METBbha57UQuZ5dQFMZejbJRlpkH8rXJrifTMzXF4mzn+zJNlS7rn1ltahIm/ha3DiflBa0slROCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:50:09.760964Z"},"content_sha256":"bf94b6f279eeeab73852b5cbb3b8c90415cea62e09e7ea937353a3be7d79aa8e","schema_version":"1.0","event_id":"sha256:bf94b6f279eeeab73852b5cbb3b8c90415cea62e09e7ea937353a3be7d79aa8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHFNGIILYS4B76RZLGRP3IVUYB/bundle.json","state_url":"https://pith.science/pith/CHFNGIILYS4B76RZLGRP3IVUYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHFNGIILYS4B76RZLGRP3IVUYB/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-06-24T07:50:09Z","links":{"resolver":"https://pith.science/pith/CHFNGIILYS4B76RZLGRP3IVUYB","bundle":"https://pith.science/pith/CHFNGIILYS4B76RZLGRP3IVUYB/bundle.json","state":"https://pith.science/pith/CHFNGIILYS4B76RZLGRP3IVUYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHFNGIILYS4B76RZLGRP3IVUYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CHFNGIILYS4B76RZLGRP3IVUYB","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":"565985e117177b239a97ec05809b6e50f580ecbebed9b115ae66446ccb0bf171","cross_cats_sorted":["q-fin.CP","q-fin.PR"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T05:49:43Z","title_canon_sha256":"fd978cc55b34f3ad9b97106783d37216fba994f0c13dd103588e6fecd6dc81d8"},"schema_version":"1.0","source":{"id":"2606.17545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17545","created_at":"2026-06-19T16:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17545v1","created_at":"2026-06-19T16:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17545","created_at":"2026-06-19T16:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"CHFNGIILYS4B","created_at":"2026-06-19T16:10:15Z"},{"alias_kind":"pith_short_16","alias_value":"CHFNGIILYS4B76RZ","created_at":"2026-06-19T16:10:15Z"},{"alias_kind":"pith_short_8","alias_value":"CHFNGIIL","created_at":"2026-06-19T16:10:15Z"}],"graph_snapshots":[{"event_id":"sha256:bf94b6f279eeeab73852b5cbb3b8c90415cea62e09e7ea937353a3be7d79aa8e","target":"graph","created_at":"2026-06-19T16:10:15Z","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/2606.17545/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Simulation based solvers for optimal stopping problems must discretize the stopping decision. Under classical dynamic programming, a coarse exercise grid with only a few stopping opportunities can materially undervalue the optimal expected reward, whereas on a very fine grid, approximation errors accumulate through the backward recursion. To remove this limitation, we develop a new reinforcement-learning inspired algorithm that enables us to learn the exercise rule at arbitrarily fine time resolution. Our CARLOS (Continuous-time Adaptive Reinforcement Learning for Optimal Stopping) algorithm u","authors_text":"Cosmin Borsa, Michael Ludkovski","cross_cats":["q-fin.CP","q-fin.PR"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T05:49:43Z","title":"Continuous-time Optimal Stopping through Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17545","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:6f9c525acfa75a5e859f4c3dd55d4dcab61493c032c8130a885118696499b9cb","target":"record","created_at":"2026-06-19T16:10:15Z","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":"565985e117177b239a97ec05809b6e50f580ecbebed9b115ae66446ccb0bf171","cross_cats_sorted":["q-fin.CP","q-fin.PR"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T05:49:43Z","title_canon_sha256":"fd978cc55b34f3ad9b97106783d37216fba994f0c13dd103588e6fecd6dc81d8"},"schema_version":"1.0","source":{"id":"2606.17545","kind":"arxiv","version":1}},"canonical_sha256":"11cad3210bc4b81ffa3959a2fda2b4c067b2e4053a88d68bbecd5fb564b0d4b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11cad3210bc4b81ffa3959a2fda2b4c067b2e4053a88d68bbecd5fb564b0d4b8","first_computed_at":"2026-06-19T16:10:15.671978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:15.671978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YUZkAAJgEeqrAp7a9T0mQ3fwyTmsNhu048xKEKzUBHa8gGWAkCo8EoMgWE22iXNavhYcEevSkH+IcIkgIzh3BA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:15.672347Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.17545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f9c525acfa75a5e859f4c3dd55d4dcab61493c032c8130a885118696499b9cb","sha256:bf94b6f279eeeab73852b5cbb3b8c90415cea62e09e7ea937353a3be7d79aa8e"],"state_sha256":"b370048f5330d4f2e814e52e5a7370d57dc58b8b5bf43fe8366d8b26fa7c881b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z8HuiJyy9rjywE/bhBCCqXSSHIeXvrPhb1dofQuvtfQhT09/aqcXwJwIvJTX/o1f3b+ohBhJbkX8JX+SohhDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:50:09.762978Z","bundle_sha256":"77c4ba050b49a7a641b33462f9fe8105339ca549e3fc210f52cfb727b60b0a05"}}