{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2UH2LZ462D3HFDT65GAVWZF2SA","short_pith_number":"pith:2UH2LZ46","canonical_record":{"source":{"id":"2607.06863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-07T23:30:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"483c14b5d6108df5f3790959e7ae958b41d37f7f578b4e08aa017de6637a3511","abstract_canon_sha256":"8859da9b15dbc751bfaefe940ae07cfd21895ea33258a7f1de62441c2beffc49"},"schema_version":"1.0"},"canonical_sha256":"d50fa5e79ed0f6728e7ee9815b64ba900749c9715c864b3d0e36d83b843ed64c","source":{"kind":"arxiv","id":"2607.06863","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.06863","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.06863v1","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06863","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"2UH2LZ462D3H","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"2UH2LZ462D3HFDT6","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"2UH2LZ46","created_at":"2026-07-09T00:19:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2UH2LZ462D3HFDT65GAVWZF2SA","target":"record","payload":{"canonical_record":{"source":{"id":"2607.06863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-07T23:30:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"483c14b5d6108df5f3790959e7ae958b41d37f7f578b4e08aa017de6637a3511","abstract_canon_sha256":"8859da9b15dbc751bfaefe940ae07cfd21895ea33258a7f1de62441c2beffc49"},"schema_version":"1.0"},"canonical_sha256":"d50fa5e79ed0f6728e7ee9815b64ba900749c9715c864b3d0e36d83b843ed64c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T00:19:31.822648Z","signature_b64":"T32q9kG5kbG4vXi1D3kP2sgia7F7mYsbi//Q4l5SlSOkTATpU4x4DQja5xTHJ5icsSPJQznG7z0ebT3glxipBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d50fa5e79ed0f6728e7ee9815b64ba900749c9715c864b3d0e36d83b843ed64c","last_reissued_at":"2026-07-09T00:19:31.822115Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T00:19:31.822115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.06863","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-09T00:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Imyp6aimxrdZvzA0TsJGQrD6QcmDVu937eD5l7raQaDPRY3Ibg6NkoXxbg44R7cGboZqo7U3PccKyeNGKXpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:28:37.518219Z"},"content_sha256":"e399804cc2d4ad4812763704cefab5f308fa5d75486f17ba4ff3f229e7830ecb","schema_version":"1.0","event_id":"sha256:e399804cc2d4ad4812763704cefab5f308fa5d75486f17ba4ff3f229e7830ecb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2UH2LZ462D3HFDT65GAVWZF2SA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Jacobi-like relative value iteration algorithms for ergodic risk-sensitive control of Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Guodong Pang, Nicola Sassone, Sumith Reddy Anugu","submitted_at":"2026-07-07T23:30:34Z","abstract_excerpt":"We propose a Jacobi-like relative value iteration (RVI) algorithm and a Gauss-Seidel-like implementation for the ergodic risk-sensitive control (ERSC) problem of a controlled discrete time Markov chain (DTMC) on a finite state space. Under the assumption that the DTMC is irreducible and recurrent under every stationary Markov policy, we prove that the iterates of the proposed RVI algorithms converge at a geometric rate. The main challenge stems from the multiplicative structure of the ERSC cost criterion and the associated Bellman-like operators, which prevents us from adapting the analogous g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06863","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/2607.06863/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-09T00:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KAxHarmo5rwkFfUfAHmMxap+5DnRraQc7hFZp1v0SQXcCUHjTQ+xs/HGLZ06A5SEplz7wJRh0osJWWhWF0nKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:28:37.518855Z"},"content_sha256":"28b952a16a164abd052e5cbf952a21e552d4d1692d18768efadc1726b4522630","schema_version":"1.0","event_id":"sha256:28b952a16a164abd052e5cbf952a21e552d4d1692d18768efadc1726b4522630"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UH2LZ462D3HFDT65GAVWZF2SA/bundle.json","state_url":"https://pith.science/pith/2UH2LZ462D3HFDT65GAVWZF2SA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UH2LZ462D3HFDT65GAVWZF2SA/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-16T18:28:37Z","links":{"resolver":"https://pith.science/pith/2UH2LZ462D3HFDT65GAVWZF2SA","bundle":"https://pith.science/pith/2UH2LZ462D3HFDT65GAVWZF2SA/bundle.json","state":"https://pith.science/pith/2UH2LZ462D3HFDT65GAVWZF2SA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UH2LZ462D3HFDT65GAVWZF2SA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2UH2LZ462D3HFDT65GAVWZF2SA","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":"8859da9b15dbc751bfaefe940ae07cfd21895ea33258a7f1de62441c2beffc49","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-07T23:30:34Z","title_canon_sha256":"483c14b5d6108df5f3790959e7ae958b41d37f7f578b4e08aa017de6637a3511"},"schema_version":"1.0","source":{"id":"2607.06863","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.06863","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.06863v1","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06863","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"2UH2LZ462D3H","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"2UH2LZ462D3HFDT6","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"2UH2LZ46","created_at":"2026-07-09T00:19:31Z"}],"graph_snapshots":[{"event_id":"sha256:28b952a16a164abd052e5cbf952a21e552d4d1692d18768efadc1726b4522630","target":"graph","created_at":"2026-07-09T00:19:31Z","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/2607.06863/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a Jacobi-like relative value iteration (RVI) algorithm and a Gauss-Seidel-like implementation for the ergodic risk-sensitive control (ERSC) problem of a controlled discrete time Markov chain (DTMC) on a finite state space. Under the assumption that the DTMC is irreducible and recurrent under every stationary Markov policy, we prove that the iterates of the proposed RVI algorithms converge at a geometric rate. The main challenge stems from the multiplicative structure of the ERSC cost criterion and the associated Bellman-like operators, which prevents us from adapting the analogous g","authors_text":"Guodong Pang, Nicola Sassone, Sumith Reddy Anugu","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-07T23:30:34Z","title":"Jacobi-like relative value iteration algorithms for ergodic risk-sensitive control of Markov chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06863","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:e399804cc2d4ad4812763704cefab5f308fa5d75486f17ba4ff3f229e7830ecb","target":"record","created_at":"2026-07-09T00:19:31Z","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":"8859da9b15dbc751bfaefe940ae07cfd21895ea33258a7f1de62441c2beffc49","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-07T23:30:34Z","title_canon_sha256":"483c14b5d6108df5f3790959e7ae958b41d37f7f578b4e08aa017de6637a3511"},"schema_version":"1.0","source":{"id":"2607.06863","kind":"arxiv","version":1}},"canonical_sha256":"d50fa5e79ed0f6728e7ee9815b64ba900749c9715c864b3d0e36d83b843ed64c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d50fa5e79ed0f6728e7ee9815b64ba900749c9715c864b3d0e36d83b843ed64c","first_computed_at":"2026-07-09T00:19:31.822115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T00:19:31.822115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T32q9kG5kbG4vXi1D3kP2sgia7F7mYsbi//Q4l5SlSOkTATpU4x4DQja5xTHJ5icsSPJQznG7z0ebT3glxipBQ==","signature_status":"signed_v1","signed_at":"2026-07-09T00:19:31.822648Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.06863","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e399804cc2d4ad4812763704cefab5f308fa5d75486f17ba4ff3f229e7830ecb","sha256:28b952a16a164abd052e5cbf952a21e552d4d1692d18768efadc1726b4522630"],"state_sha256":"0ac465a5ef81121c5d703b5a35d786fc57872eb51379ac45dc189d85c8cf80c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I2j7vrIKty9NTaRRAt4A9hDeJmAmEBu50QwrCdkD+rtRXPRJHD11s3NXAAsTG5/ZiSN1M59lEH2rX7eYzkqoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T18:28:37.524410Z","bundle_sha256":"59cf8d86672150b4a7a436145fef2fe7be5b9454c0a5ee6ef9531cc6a052d138"}}