{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X7FJWOOLSMHFTHO5WTENDJCG3H","short_pith_number":"pith:X7FJWOOL","schema_version":"1.0","canonical_sha256":"bfca9b39cb930e599dddb4c8d1a446d9c3fe807e2ed1fc5589f45ad3ab68c83f","source":{"kind":"arxiv","id":"1605.08010","version":2},"attestation_state":"computed","paper":{"title":"Recursive Construction of Confidence Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Igor Cialenco, Tao Chen, Tomasz R. Bielecki","submitted_at":"2016-05-25T19:16:20Z","abstract_excerpt":"Assuming that one-step transition kernel of a discrete time, time-homogenous Markov chain model is parameterized by a parameter $\\theta\\in \\boldsymbol \\Theta$, we derive a recursive (in time) construction of confidence regions for the unknown parameter of interest, say $\\theta^*\\in \\boldsymbol \\Theta$. It is supposed that the observed data used in construction of the confidence regions is generated by a Markov chain whose transition kernel corresponds to $\\theta^*$ . The key step in our construction is derivation of a recursive scheme for an appropriate point estimator of $\\theta^*$. To achiev"},"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":"1605.08010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-25T19:16:20Z","cross_cats_sorted":["math.PR","stat.TH"],"title_canon_sha256":"c965e08381516c1b2fd3f9d2fdd790e0885ef91b5e5e5d1d9c4b995f8765f52a","abstract_canon_sha256":"9d2245e1f039a52228948a4a6a11e2f0866855913c3f36424c516960cde69359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:51.743511Z","signature_b64":"NgLpq6KJfvSC7Y8fGNJ628ZZ8p2waVRFQQXVw264jx5wSNYrD46Y4s507BCuDnqHYhR6BLNVtEUX+175sMtDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfca9b39cb930e599dddb4c8d1a446d9c3fe807e2ed1fc5589f45ad3ab68c83f","last_reissued_at":"2026-05-18T00:42:51.742731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:51.742731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Construction of Confidence Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Igor Cialenco, Tao Chen, Tomasz R. Bielecki","submitted_at":"2016-05-25T19:16:20Z","abstract_excerpt":"Assuming that one-step transition kernel of a discrete time, time-homogenous Markov chain model is parameterized by a parameter $\\theta\\in \\boldsymbol \\Theta$, we derive a recursive (in time) construction of confidence regions for the unknown parameter of interest, say $\\theta^*\\in \\boldsymbol \\Theta$. It is supposed that the observed data used in construction of the confidence regions is generated by a Markov chain whose transition kernel corresponds to $\\theta^*$ . The key step in our construction is derivation of a recursive scheme for an appropriate point estimator of $\\theta^*$. To achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08010","kind":"arxiv","version":2},"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":"1605.08010","created_at":"2026-05-18T00:42:51.742839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08010v2","created_at":"2026-05-18T00:42:51.742839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08010","created_at":"2026-05-18T00:42:51.742839+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7FJWOOLSMHF","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7FJWOOLSMHFTHO5","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7FJWOOL","created_at":"2026-05-18T12:30:51.357362+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/X7FJWOOLSMHFTHO5WTENDJCG3H","json":"https://pith.science/pith/X7FJWOOLSMHFTHO5WTENDJCG3H.json","graph_json":"https://pith.science/api/pith-number/X7FJWOOLSMHFTHO5WTENDJCG3H/graph.json","events_json":"https://pith.science/api/pith-number/X7FJWOOLSMHFTHO5WTENDJCG3H/events.json","paper":"https://pith.science/paper/X7FJWOOL"},"agent_actions":{"view_html":"https://pith.science/pith/X7FJWOOLSMHFTHO5WTENDJCG3H","download_json":"https://pith.science/pith/X7FJWOOLSMHFTHO5WTENDJCG3H.json","view_paper":"https://pith.science/paper/X7FJWOOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08010&json=true","fetch_graph":"https://pith.science/api/pith-number/X7FJWOOLSMHFTHO5WTENDJCG3H/graph.json","fetch_events":"https://pith.science/api/pith-number/X7FJWOOLSMHFTHO5WTENDJCG3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7FJWOOLSMHFTHO5WTENDJCG3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7FJWOOLSMHFTHO5WTENDJCG3H/action/storage_attestation","attest_author":"https://pith.science/pith/X7FJWOOLSMHFTHO5WTENDJCG3H/action/author_attestation","sign_citation":"https://pith.science/pith/X7FJWOOLSMHFTHO5WTENDJCG3H/action/citation_signature","submit_replication":"https://pith.science/pith/X7FJWOOLSMHFTHO5WTENDJCG3H/action/replication_record"}},"created_at":"2026-05-18T00:42:51.742839+00:00","updated_at":"2026-05-18T00:42:51.742839+00:00"}