{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZN6TUICT4XUK76HRJUKYDPAY5F","short_pith_number":"pith:ZN6TUICT","canonical_record":{"source":{"id":"2410.05163","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T16:16:53Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"83fcdb67582473366272ddb2255291a195345b71ac84a5b98be370cba251c28c","abstract_canon_sha256":"9ac04507c4081b57e3e89e5e1345a41bc92f323ff52d9953941f47827ec46776"},"schema_version":"1.0"},"canonical_sha256":"cb7d3a2053e5e8aff8f14d1581bc18e96eb45ddd686ba6e1b5e63d4aa062b7f6","source":{"kind":"arxiv","id":"2410.05163","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.05163","created_at":"2026-07-05T11:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"2410.05163v3","created_at":"2026-07-05T11:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.05163","created_at":"2026-07-05T11:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZN6TUICT4XUK","created_at":"2026-07-05T11:02:13Z"},{"alias_kind":"pith_short_16","alias_value":"ZN6TUICT4XUK76HR","created_at":"2026-07-05T11:02:13Z"},{"alias_kind":"pith_short_8","alias_value":"ZN6TUICT","created_at":"2026-07-05T11:02:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZN6TUICT4XUK76HRJUKYDPAY5F","target":"record","payload":{"canonical_record":{"source":{"id":"2410.05163","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T16:16:53Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"83fcdb67582473366272ddb2255291a195345b71ac84a5b98be370cba251c28c","abstract_canon_sha256":"9ac04507c4081b57e3e89e5e1345a41bc92f323ff52d9953941f47827ec46776"},"schema_version":"1.0"},"canonical_sha256":"cb7d3a2053e5e8aff8f14d1581bc18e96eb45ddd686ba6e1b5e63d4aa062b7f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:13.087446Z","signature_b64":"BaBz7nnBAHzqNGiZotKpRfhm6BdXL1aQz+yEAG05rH4Iw1+q30C1AiShb4a2vtSoUuEEScMjZm8Que0MqNaiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb7d3a2053e5e8aff8f14d1581bc18e96eb45ddd686ba6e1b5e63d4aa062b7f6","last_reissued_at":"2026-07-05T11:02:13.086948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:13.086948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.05163","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-05T11:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abyjF//TToxr/stPbxgXWY1lgX8LADMV3jWoEEIJbftXn0URGxGJLkIZ7arK5TlEoxGx/sZVipt0j1xspYk2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:31:55.682826Z"},"content_sha256":"088db0e957682b66049ee708b19231f3e3ee8c440566d6c16f61614df60bacd5","schema_version":"1.0","event_id":"sha256:088db0e957682b66049ee708b19231f3e3ee8c440566d6c16f61614df60bacd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZN6TUICT4XUK76HRJUKYDPAY5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient On-Policy Deep Learning Framework for Stochastic Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Eric Vanden-Eijnden, Mathieu Lauri\\`ere, Mengjian Hua","submitted_at":"2024-10-07T16:16:53Z","abstract_excerpt":"We present a novel on-policy algorithm for solving stochastic optimal control (SOC) problems. By leveraging the Girsanov theorem, our method directly computes on-policy gradients of the SOC objective without expensive backpropagation through stochastic differential equations or adjoint problem solutions. This approach significantly accelerates the optimization of neural network control policies while scaling efficiently to high-dimensional problems and long time horizons. We evaluate our method on classical SOC benchmarks as well as applications to sampling from unnormalized distributions via "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.05163","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.05163/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-05T11:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aN4k/lu2C+dqf8hhlSOfpWhp0t6W4YMPdSuSQdlQj3YfJk2KGalA7CNUjFIxpcFsesbixMvv5PyrIP5AfKQPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:31:55.683460Z"},"content_sha256":"80e0364a6c38b9ed9f6278349b2867d2afdb1f23a7157a8f771f9a92b790cba7","schema_version":"1.0","event_id":"sha256:80e0364a6c38b9ed9f6278349b2867d2afdb1f23a7157a8f771f9a92b790cba7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZN6TUICT4XUK76HRJUKYDPAY5F/bundle.json","state_url":"https://pith.science/pith/ZN6TUICT4XUK76HRJUKYDPAY5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZN6TUICT4XUK76HRJUKYDPAY5F/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-18T18:31:55Z","links":{"resolver":"https://pith.science/pith/ZN6TUICT4XUK76HRJUKYDPAY5F","bundle":"https://pith.science/pith/ZN6TUICT4XUK76HRJUKYDPAY5F/bundle.json","state":"https://pith.science/pith/ZN6TUICT4XUK76HRJUKYDPAY5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZN6TUICT4XUK76HRJUKYDPAY5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZN6TUICT4XUK76HRJUKYDPAY5F","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":"9ac04507c4081b57e3e89e5e1345a41bc92f323ff52d9953941f47827ec46776","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T16:16:53Z","title_canon_sha256":"83fcdb67582473366272ddb2255291a195345b71ac84a5b98be370cba251c28c"},"schema_version":"1.0","source":{"id":"2410.05163","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.05163","created_at":"2026-07-05T11:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"2410.05163v3","created_at":"2026-07-05T11:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.05163","created_at":"2026-07-05T11:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZN6TUICT4XUK","created_at":"2026-07-05T11:02:13Z"},{"alias_kind":"pith_short_16","alias_value":"ZN6TUICT4XUK76HR","created_at":"2026-07-05T11:02:13Z"},{"alias_kind":"pith_short_8","alias_value":"ZN6TUICT","created_at":"2026-07-05T11:02:13Z"}],"graph_snapshots":[{"event_id":"sha256:80e0364a6c38b9ed9f6278349b2867d2afdb1f23a7157a8f771f9a92b790cba7","target":"graph","created_at":"2026-07-05T11:02:13Z","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.05163/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a novel on-policy algorithm for solving stochastic optimal control (SOC) problems. By leveraging the Girsanov theorem, our method directly computes on-policy gradients of the SOC objective without expensive backpropagation through stochastic differential equations or adjoint problem solutions. This approach significantly accelerates the optimization of neural network control policies while scaling efficiently to high-dimensional problems and long time horizons. We evaluate our method on classical SOC benchmarks as well as applications to sampling from unnormalized distributions via ","authors_text":"Eric Vanden-Eijnden, Mathieu Lauri\\`ere, Mengjian Hua","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T16:16:53Z","title":"An Efficient On-Policy Deep Learning Framework for Stochastic Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.05163","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:088db0e957682b66049ee708b19231f3e3ee8c440566d6c16f61614df60bacd5","target":"record","created_at":"2026-07-05T11:02:13Z","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":"9ac04507c4081b57e3e89e5e1345a41bc92f323ff52d9953941f47827ec46776","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T16:16:53Z","title_canon_sha256":"83fcdb67582473366272ddb2255291a195345b71ac84a5b98be370cba251c28c"},"schema_version":"1.0","source":{"id":"2410.05163","kind":"arxiv","version":3}},"canonical_sha256":"cb7d3a2053e5e8aff8f14d1581bc18e96eb45ddd686ba6e1b5e63d4aa062b7f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb7d3a2053e5e8aff8f14d1581bc18e96eb45ddd686ba6e1b5e63d4aa062b7f6","first_computed_at":"2026-07-05T11:02:13.086948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:02:13.086948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BaBz7nnBAHzqNGiZotKpRfhm6BdXL1aQz+yEAG05rH4Iw1+q30C1AiShb4a2vtSoUuEEScMjZm8Que0MqNaiCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:02:13.087446Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.05163","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:088db0e957682b66049ee708b19231f3e3ee8c440566d6c16f61614df60bacd5","sha256:80e0364a6c38b9ed9f6278349b2867d2afdb1f23a7157a8f771f9a92b790cba7"],"state_sha256":"1a755916463cd63f399f9aac185bdcec0c5fc42c5ae6f3859d0e2e68c037fed6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/orOUKJ2wm93ksrhq9FZbvas4tx+y/31moFSeyLXAXlFUMVWYoyFRmgzZv3AArkk6XLcwIM8hY2uIYG1xtzTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T18:31:55.690860Z","bundle_sha256":"0137e5dc3c5598590be4bb938e9c24000361a582f595b9fc9c089647c5337753"}}