{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:TW32TMAWROHD42KKLZJEMULRDQ","short_pith_number":"pith:TW32TMAW","canonical_record":{"source":{"id":"2308.02148","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T06:09:51Z","cross_cats_sorted":[],"title_canon_sha256":"d1d2e83026fa2cac5e47d4c621c86658d1681e057b4e592e7430120de628c579","abstract_canon_sha256":"2f8cc1c0c39a0bb459bf9ad01ad32d4ad0eb9ead9d7a140f89a019ba58ff20e5"},"schema_version":"1.0"},"canonical_sha256":"9db7a9b0168b8e3e694a5e524651711c2388b24257359fa1a5dec45255687576","source":{"kind":"arxiv","id":"2308.02148","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.02148","created_at":"2026-07-05T09:56:47Z"},{"alias_kind":"arxiv_version","alias_value":"2308.02148v4","created_at":"2026-07-05T09:56:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.02148","created_at":"2026-07-05T09:56:47Z"},{"alias_kind":"pith_short_12","alias_value":"TW32TMAWROHD","created_at":"2026-07-05T09:56:47Z"},{"alias_kind":"pith_short_16","alias_value":"TW32TMAWROHD42KK","created_at":"2026-07-05T09:56:47Z"},{"alias_kind":"pith_short_8","alias_value":"TW32TMAW","created_at":"2026-07-05T09:56:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:TW32TMAWROHD42KKLZJEMULRDQ","target":"record","payload":{"canonical_record":{"source":{"id":"2308.02148","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T06:09:51Z","cross_cats_sorted":[],"title_canon_sha256":"d1d2e83026fa2cac5e47d4c621c86658d1681e057b4e592e7430120de628c579","abstract_canon_sha256":"2f8cc1c0c39a0bb459bf9ad01ad32d4ad0eb9ead9d7a140f89a019ba58ff20e5"},"schema_version":"1.0"},"canonical_sha256":"9db7a9b0168b8e3e694a5e524651711c2388b24257359fa1a5dec45255687576","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:47.579195Z","signature_b64":"zfyOQvce2kI8eDinBTM7NxFecXi7FDD659xd3lH+5WPq+rAOKufxQBlwbNpnGe988XgTpQRj5FzQfqn+xKjXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9db7a9b0168b8e3e694a5e524651711c2388b24257359fa1a5dec45255687576","last_reissued_at":"2026-07-05T09:56:47.578744Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:47.578744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.02148","source_version":4,"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-05T09:56:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/543FEk/0zSBdwr+qKi9A1WyxgA9Ou4NhbgAxcA+8zzpgO5bRFjiMC/RpE0TDpHieUf3j0b4yiQnh16+pbWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T13:32:09.709303Z"},"content_sha256":"20154061f14d8d61b4941ce5b2a819916cb2e6ddb9d61e1fdfa48ffa1e32056a","schema_version":"1.0","event_id":"sha256:20154061f14d8d61b4941ce5b2a819916cb2e6ddb9d61e1fdfa48ffa1e32056a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:TW32TMAWROHD42KKLZJEMULRDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Programs on Partially Ordered Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"John Stachurski, Thomas J. Sargent","submitted_at":"2023-08-04T06:09:51Z","abstract_excerpt":"We introduce a framework that represents a dynamic program as a family of operators acting on a partially ordered set. We provide an optimality theory based only on order-theoretic assumptions and show how applications across almost all subfields of dynamic programming fit into this framework. These range from traditional dynamic programs to those involving nonlinear recursive preferences, desire for robustness, function approximation, Monte Carlo sampling and distributional dynamic programs. We apply the framework to establish new optimality and algorithmic results for specific applications."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.02148","kind":"arxiv","version":4},"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/2308.02148/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-05T09:56:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybZxpuSPzVxYrvW10J3lCU8++w+wpXXG8otf2KEgdXpWMrKfFSk1zOX2FwHBUNHI+M13E1Lqmqj88QUG6hcxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T13:32:09.709917Z"},"content_sha256":"8c222091987c921841b99f6cea28757e181fdc531aaa758bcccef3c824c4e2fe","schema_version":"1.0","event_id":"sha256:8c222091987c921841b99f6cea28757e181fdc531aaa758bcccef3c824c4e2fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TW32TMAWROHD42KKLZJEMULRDQ/bundle.json","state_url":"https://pith.science/pith/TW32TMAWROHD42KKLZJEMULRDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TW32TMAWROHD42KKLZJEMULRDQ/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-14T13:32:09Z","links":{"resolver":"https://pith.science/pith/TW32TMAWROHD42KKLZJEMULRDQ","bundle":"https://pith.science/pith/TW32TMAWROHD42KKLZJEMULRDQ/bundle.json","state":"https://pith.science/pith/TW32TMAWROHD42KKLZJEMULRDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TW32TMAWROHD42KKLZJEMULRDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TW32TMAWROHD42KKLZJEMULRDQ","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":"2f8cc1c0c39a0bb459bf9ad01ad32d4ad0eb9ead9d7a140f89a019ba58ff20e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T06:09:51Z","title_canon_sha256":"d1d2e83026fa2cac5e47d4c621c86658d1681e057b4e592e7430120de628c579"},"schema_version":"1.0","source":{"id":"2308.02148","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.02148","created_at":"2026-07-05T09:56:47Z"},{"alias_kind":"arxiv_version","alias_value":"2308.02148v4","created_at":"2026-07-05T09:56:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.02148","created_at":"2026-07-05T09:56:47Z"},{"alias_kind":"pith_short_12","alias_value":"TW32TMAWROHD","created_at":"2026-07-05T09:56:47Z"},{"alias_kind":"pith_short_16","alias_value":"TW32TMAWROHD42KK","created_at":"2026-07-05T09:56:47Z"},{"alias_kind":"pith_short_8","alias_value":"TW32TMAW","created_at":"2026-07-05T09:56:47Z"}],"graph_snapshots":[{"event_id":"sha256:8c222091987c921841b99f6cea28757e181fdc531aaa758bcccef3c824c4e2fe","target":"graph","created_at":"2026-07-05T09:56:47Z","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/2308.02148/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a framework that represents a dynamic program as a family of operators acting on a partially ordered set. We provide an optimality theory based only on order-theoretic assumptions and show how applications across almost all subfields of dynamic programming fit into this framework. These range from traditional dynamic programs to those involving nonlinear recursive preferences, desire for robustness, function approximation, Monte Carlo sampling and distributional dynamic programs. We apply the framework to establish new optimality and algorithmic results for specific applications.","authors_text":"John Stachurski, Thomas J. Sargent","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T06:09:51Z","title":"Dynamic Programs on Partially Ordered Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.02148","kind":"arxiv","version":4},"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:20154061f14d8d61b4941ce5b2a819916cb2e6ddb9d61e1fdfa48ffa1e32056a","target":"record","created_at":"2026-07-05T09:56:47Z","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":"2f8cc1c0c39a0bb459bf9ad01ad32d4ad0eb9ead9d7a140f89a019ba58ff20e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T06:09:51Z","title_canon_sha256":"d1d2e83026fa2cac5e47d4c621c86658d1681e057b4e592e7430120de628c579"},"schema_version":"1.0","source":{"id":"2308.02148","kind":"arxiv","version":4}},"canonical_sha256":"9db7a9b0168b8e3e694a5e524651711c2388b24257359fa1a5dec45255687576","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9db7a9b0168b8e3e694a5e524651711c2388b24257359fa1a5dec45255687576","first_computed_at":"2026-07-05T09:56:47.578744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:56:47.578744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zfyOQvce2kI8eDinBTM7NxFecXi7FDD659xd3lH+5WPq+rAOKufxQBlwbNpnGe988XgTpQRj5FzQfqn+xKjXBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:56:47.579195Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.02148","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20154061f14d8d61b4941ce5b2a819916cb2e6ddb9d61e1fdfa48ffa1e32056a","sha256:8c222091987c921841b99f6cea28757e181fdc531aaa758bcccef3c824c4e2fe"],"state_sha256":"f8d3590b3c1fd2e636691bea1933dbdb83bd594b7c87fcf8c3378eea59b6c23e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CNoUHv+ieOL/3SVk9Jw38aMt+ey5VM4PvlsbEaZkLOTIESCctAPCeDrXwTf9JsSpBiAfx2NnAo1l96YqNHzfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T13:32:09.714313Z","bundle_sha256":"5ec2e9e216c39a8fe606fc67cb877938592c05ec569142e1ab906258c9be8585"}}