{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GNNYHZUD4QQX6TW5NT5BJ3XWCC","short_pith_number":"pith:GNNYHZUD","schema_version":"1.0","canonical_sha256":"335b83e683e4217f4edd6cfa14eef61098901e6f0069999c410ce8cd506e958b","source":{"kind":"arxiv","id":"1605.01482","version":1},"attestation_state":"computed","paper":{"title":"Componentwise accurate Brownian motion computations using Cyclic Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Federico Poloni, Giang T. Nguyen","submitted_at":"2016-05-05T03:29:07Z","abstract_excerpt":"Markov-modulated Brownian motion is a popular tool to model continuous-time phenomena in a stochastic context. The main quantity of interest is the invariant density, which satisfies a differential equation associated with the quadratic matrix polynomial $P(z) = Vz^2-Dz +Q$, where the matrices $V$ and $D$ are diagonal and $Q$ is the transition matrix of a discrete-time Markov chain. Its solution is typically constructed by computing an invariant pair of $P(z)$ associated with its eigenvalues in the left half-plane, or by solving the matrix equation $X^2V-XD+Q=0$. We show that these tasks can b"},"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.01482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-05T03:29:07Z","cross_cats_sorted":[],"title_canon_sha256":"82c90657a5a12557ffcf77046bf363dae9b3b419a80c37a5fc7352bb2cf3c175","abstract_canon_sha256":"b4bbda849ea270e77516027a155dc34a72642eeed3863ba43a3363fd9286d359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:33.572662Z","signature_b64":"SSDbv2QHoOqcZiJO4ayHvvfMOcFntHxcWEcSXXmAQLmCemQ4JJ2u5tQH0inHuoOlRRUgPwipB3jS4xT/axT2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"335b83e683e4217f4edd6cfa14eef61098901e6f0069999c410ce8cd506e958b","last_reissued_at":"2026-05-18T01:15:33.571667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:33.571667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Componentwise accurate Brownian motion computations using Cyclic Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Federico Poloni, Giang T. Nguyen","submitted_at":"2016-05-05T03:29:07Z","abstract_excerpt":"Markov-modulated Brownian motion is a popular tool to model continuous-time phenomena in a stochastic context. The main quantity of interest is the invariant density, which satisfies a differential equation associated with the quadratic matrix polynomial $P(z) = Vz^2-Dz +Q$, where the matrices $V$ and $D$ are diagonal and $Q$ is the transition matrix of a discrete-time Markov chain. Its solution is typically constructed by computing an invariant pair of $P(z)$ associated with its eigenvalues in the left half-plane, or by solving the matrix equation $X^2V-XD+Q=0$. We show that these tasks can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01482","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":""},"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.01482","created_at":"2026-05-18T01:15:33.571791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01482v1","created_at":"2026-05-18T01:15:33.571791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01482","created_at":"2026-05-18T01:15:33.571791+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNNYHZUD4QQX","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNNYHZUD4QQX6TW5","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNNYHZUD","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.21679","citing_title":"Component-wise accurate computation of the square root of an M-matrix","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GNNYHZUD4QQX6TW5NT5BJ3XWCC","json":"https://pith.science/pith/GNNYHZUD4QQX6TW5NT5BJ3XWCC.json","graph_json":"https://pith.science/api/pith-number/GNNYHZUD4QQX6TW5NT5BJ3XWCC/graph.json","events_json":"https://pith.science/api/pith-number/GNNYHZUD4QQX6TW5NT5BJ3XWCC/events.json","paper":"https://pith.science/paper/GNNYHZUD"},"agent_actions":{"view_html":"https://pith.science/pith/GNNYHZUD4QQX6TW5NT5BJ3XWCC","download_json":"https://pith.science/pith/GNNYHZUD4QQX6TW5NT5BJ3XWCC.json","view_paper":"https://pith.science/paper/GNNYHZUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01482&json=true","fetch_graph":"https://pith.science/api/pith-number/GNNYHZUD4QQX6TW5NT5BJ3XWCC/graph.json","fetch_events":"https://pith.science/api/pith-number/GNNYHZUD4QQX6TW5NT5BJ3XWCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNNYHZUD4QQX6TW5NT5BJ3XWCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNNYHZUD4QQX6TW5NT5BJ3XWCC/action/storage_attestation","attest_author":"https://pith.science/pith/GNNYHZUD4QQX6TW5NT5BJ3XWCC/action/author_attestation","sign_citation":"https://pith.science/pith/GNNYHZUD4QQX6TW5NT5BJ3XWCC/action/citation_signature","submit_replication":"https://pith.science/pith/GNNYHZUD4QQX6TW5NT5BJ3XWCC/action/replication_record"}},"created_at":"2026-05-18T01:15:33.571791+00:00","updated_at":"2026-05-18T01:15:33.571791+00:00"}