{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:I6YCDX5YWXEJ7UQUQXCS527FWT","short_pith_number":"pith:I6YCDX5Y","schema_version":"1.0","canonical_sha256":"47b021dfb8b5c89fd21485c52eebe5b4c04d31a02cdabe7e57c4e8c968e25184","source":{"kind":"arxiv","id":"2410.05471","version":1},"attestation_state":"computed","paper":{"title":"Exact sensitivity analysis of Markov reward processes via algebraic geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.AG","math.PR"],"primary_cat":"math.OC","authors_text":"Muhammad Maaz, Timothy C. Y. Chan","submitted_at":"2024-10-07T20:08:02Z","abstract_excerpt":"We introduce a new approach for deterministic sensitivity analysis of Markov reward processes, commonly used in cost-effectiveness analyses, via reformulation into a polynomial system. Our approach leverages cylindrical algebraic decomposition (CAD), a technique arising from algebraic geometry that provides an exact description of all solutions to a polynomial system. While it is typically intractable to build a CAD for systems with more than a few variables, we show that a special class of polynomial systems, which includes the polynomials arising from Markov reward processes, can be analyzed"},"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":"2410.05471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-07T20:08:02Z","cross_cats_sorted":["cs.MS","math.AG","math.PR"],"title_canon_sha256":"56628857b838b9394d2ad3af65e88d0bf827ae457c1ab00a053e8229bfdb3d53","abstract_canon_sha256":"7f9f92d4f80c0e335eed09511cb96929963691acbec0a5b1754e37ab6c0976f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:19.769865Z","signature_b64":"ZJ/E4mtxzDBKOobv1T6K89jouXlwfgk/mepoMoYJkVqZXqW5J871eaqhlvX9a7MEGjvV4wFWRXYURTyR6y1LDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47b021dfb8b5c89fd21485c52eebe5b4c04d31a02cdabe7e57c4e8c968e25184","last_reissued_at":"2026-07-05T09:17:19.769418Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:19.769418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact sensitivity analysis of Markov reward processes via algebraic geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.AG","math.PR"],"primary_cat":"math.OC","authors_text":"Muhammad Maaz, Timothy C. Y. Chan","submitted_at":"2024-10-07T20:08:02Z","abstract_excerpt":"We introduce a new approach for deterministic sensitivity analysis of Markov reward processes, commonly used in cost-effectiveness analyses, via reformulation into a polynomial system. Our approach leverages cylindrical algebraic decomposition (CAD), a technique arising from algebraic geometry that provides an exact description of all solutions to a polynomial system. While it is typically intractable to build a CAD for systems with more than a few variables, we show that a special class of polynomial systems, which includes the polynomials arising from Markov reward processes, can be analyzed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.05471","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/2410.05471/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.05471","created_at":"2026-07-05T09:17:19.769475+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.05471v1","created_at":"2026-07-05T09:17:19.769475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.05471","created_at":"2026-07-05T09:17:19.769475+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6YCDX5YWXEJ","created_at":"2026-07-05T09:17:19.769475+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6YCDX5YWXEJ7UQU","created_at":"2026-07-05T09:17:19.769475+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6YCDX5Y","created_at":"2026-07-05T09:17:19.769475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15767","citing_title":"Formal Verification of Markov Processes with Learned Parameters","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I6YCDX5YWXEJ7UQUQXCS527FWT","json":"https://pith.science/pith/I6YCDX5YWXEJ7UQUQXCS527FWT.json","graph_json":"https://pith.science/api/pith-number/I6YCDX5YWXEJ7UQUQXCS527FWT/graph.json","events_json":"https://pith.science/api/pith-number/I6YCDX5YWXEJ7UQUQXCS527FWT/events.json","paper":"https://pith.science/paper/I6YCDX5Y"},"agent_actions":{"view_html":"https://pith.science/pith/I6YCDX5YWXEJ7UQUQXCS527FWT","download_json":"https://pith.science/pith/I6YCDX5YWXEJ7UQUQXCS527FWT.json","view_paper":"https://pith.science/paper/I6YCDX5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.05471&json=true","fetch_graph":"https://pith.science/api/pith-number/I6YCDX5YWXEJ7UQUQXCS527FWT/graph.json","fetch_events":"https://pith.science/api/pith-number/I6YCDX5YWXEJ7UQUQXCS527FWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6YCDX5YWXEJ7UQUQXCS527FWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6YCDX5YWXEJ7UQUQXCS527FWT/action/storage_attestation","attest_author":"https://pith.science/pith/I6YCDX5YWXEJ7UQUQXCS527FWT/action/author_attestation","sign_citation":"https://pith.science/pith/I6YCDX5YWXEJ7UQUQXCS527FWT/action/citation_signature","submit_replication":"https://pith.science/pith/I6YCDX5YWXEJ7UQUQXCS527FWT/action/replication_record"}},"created_at":"2026-07-05T09:17:19.769475+00:00","updated_at":"2026-07-05T09:17:19.769475+00:00"}