{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:4PYQ52AWGC7IZRRRFRHDTMD3XW","short_pith_number":"pith:4PYQ52AW","schema_version":"1.0","canonical_sha256":"e3f10ee81630be8cc6312c4e39b07bbdbc3c57027c0e3e20739b06cc945c693d","source":{"kind":"arxiv","id":"math/0610855","version":4},"attestation_state":"computed","paper":{"title":"On finite-difference approximations for normalized Bellman equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"David \\v{S}i\\v{s}ka, Istv\\'an Gy\\\"ongy","submitted_at":"2006-10-27T16:07:48Z","abstract_excerpt":"A class of stochastic optimal control problems involving optimal stopping is considered. Methods of Krylov are adapted to investigate the numerical solutions of the corresponding normalized Bellman equations and to estimate the rate of convergence of finite difference approximations for the optimal reward functions."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"math/0610855","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2006-10-27T16:07:48Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"3c2fde7349fa449d9a0c2837f7fee0acd17f75988645fd737266cbd88c8c8640","abstract_canon_sha256":"c3fec9837232e6b643160a9dffa8167eb2763d11bcb54f1b02b2b78ce8945f6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:02.704874Z","signature_b64":"I1Z8JDWGjPi0RBJ+1A2OqksUd5Ck08UvQNR//DOkFQOfihN1RMXlX8K7NEAhFeoEyk2bnrsdrsdf/GXF2B2DDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3f10ee81630be8cc6312c4e39b07bbdbc3c57027c0e3e20739b06cc945c693d","last_reissued_at":"2026-05-18T02:31:02.704374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:02.704374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On finite-difference approximations for normalized Bellman equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"David \\v{S}i\\v{s}ka, Istv\\'an Gy\\\"ongy","submitted_at":"2006-10-27T16:07:48Z","abstract_excerpt":"A class of stochastic optimal control problems involving optimal stopping is considered. Methods of Krylov are adapted to investigate the numerical solutions of the corresponding normalized Bellman equations and to estimate the rate of convergence of finite difference approximations for the optimal reward functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0610855","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0610855","created_at":"2026-05-18T02:31:02.704452+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0610855v4","created_at":"2026-05-18T02:31:02.704452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0610855","created_at":"2026-05-18T02:31:02.704452+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PYQ52AWGC7I","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PYQ52AWGC7IZRRR","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PYQ52AW","created_at":"2026-05-18T12:25:53.939244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4PYQ52AWGC7IZRRRFRHDTMD3XW","json":"https://pith.science/pith/4PYQ52AWGC7IZRRRFRHDTMD3XW.json","graph_json":"https://pith.science/api/pith-number/4PYQ52AWGC7IZRRRFRHDTMD3XW/graph.json","events_json":"https://pith.science/api/pith-number/4PYQ52AWGC7IZRRRFRHDTMD3XW/events.json","paper":"https://pith.science/paper/4PYQ52AW"},"agent_actions":{"view_html":"https://pith.science/pith/4PYQ52AWGC7IZRRRFRHDTMD3XW","download_json":"https://pith.science/pith/4PYQ52AWGC7IZRRRFRHDTMD3XW.json","view_paper":"https://pith.science/paper/4PYQ52AW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0610855&json=true","fetch_graph":"https://pith.science/api/pith-number/4PYQ52AWGC7IZRRRFRHDTMD3XW/graph.json","fetch_events":"https://pith.science/api/pith-number/4PYQ52AWGC7IZRRRFRHDTMD3XW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PYQ52AWGC7IZRRRFRHDTMD3XW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PYQ52AWGC7IZRRRFRHDTMD3XW/action/storage_attestation","attest_author":"https://pith.science/pith/4PYQ52AWGC7IZRRRFRHDTMD3XW/action/author_attestation","sign_citation":"https://pith.science/pith/4PYQ52AWGC7IZRRRFRHDTMD3XW/action/citation_signature","submit_replication":"https://pith.science/pith/4PYQ52AWGC7IZRRRFRHDTMD3XW/action/replication_record"}},"created_at":"2026-05-18T02:31:02.704452+00:00","updated_at":"2026-05-18T02:31:02.704452+00:00"}