{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DV6XASYMWEHIMJTY76S32BAII6","short_pith_number":"pith:DV6XASYM","schema_version":"1.0","canonical_sha256":"1d7d704b0cb10e862678ffa5bd040847b51ff48f1a411aaf9878bcabc8326adf","source":{"kind":"arxiv","id":"2501.15767","version":2},"attestation_state":"computed","paper":{"title":"Formal Verification of Markov Processes with Learned Parameters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Muhammad Maaz, Timothy C. Y. Chan","submitted_at":"2025-01-27T04:34:22Z","abstract_excerpt":"We introduce the problem of formally verifying properties of Markov processes where the parameters are given by the output of machine learning models. For a broad class of machine learning models, including linear models, tree-based models, and neural networks, verifying properties of Markov chains like reachability, hitting time, and total reward can be formulated as a bilinear program. We develop a decomposition and bound propagation scheme for solving the bilinear program and show through computational experiments that our method solves the problem to global optimality up to 100x faster tha"},"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":"2501.15767","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-27T04:34:22Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"9b4dcd39cfd3b743683ae91515bced9d4dcfdb8bcc181c09878c5224897de783","abstract_canon_sha256":"85cae42d689bb13f7db2047230409c0ae0ffd1f9af355c557c93d8585558f9a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:31.278963Z","signature_b64":"eb5YvAxkfZggQ/1VwWJCTXRILYjGoj/Wz+yhPoRlMdIQXsu6oVPSxs4rClG19MgAR8LQVq29NsWeCKog63zsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d7d704b0cb10e862678ffa5bd040847b51ff48f1a411aaf9878bcabc8326adf","last_reissued_at":"2026-07-05T11:01:31.278577Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:31.278577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Verification of Markov Processes with Learned Parameters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Muhammad Maaz, Timothy C. Y. Chan","submitted_at":"2025-01-27T04:34:22Z","abstract_excerpt":"We introduce the problem of formally verifying properties of Markov processes where the parameters are given by the output of machine learning models. For a broad class of machine learning models, including linear models, tree-based models, and neural networks, verifying properties of Markov chains like reachability, hitting time, and total reward can be formulated as a bilinear program. We develop a decomposition and bound propagation scheme for solving the bilinear program and show through computational experiments that our method solves the problem to global optimality up to 100x faster tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15767","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.15767/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":"2501.15767","created_at":"2026-07-05T11:01:31.278626+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15767v2","created_at":"2026-07-05T11:01:31.278626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15767","created_at":"2026-07-05T11:01:31.278626+00:00"},{"alias_kind":"pith_short_12","alias_value":"DV6XASYMWEHI","created_at":"2026-07-05T11:01:31.278626+00:00"},{"alias_kind":"pith_short_16","alias_value":"DV6XASYMWEHIMJTY","created_at":"2026-07-05T11:01:31.278626+00:00"},{"alias_kind":"pith_short_8","alias_value":"DV6XASYM","created_at":"2026-07-05T11:01:31.278626+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/DV6XASYMWEHIMJTY76S32BAII6","json":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6.json","graph_json":"https://pith.science/api/pith-number/DV6XASYMWEHIMJTY76S32BAII6/graph.json","events_json":"https://pith.science/api/pith-number/DV6XASYMWEHIMJTY76S32BAII6/events.json","paper":"https://pith.science/paper/DV6XASYM"},"agent_actions":{"view_html":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6","download_json":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6.json","view_paper":"https://pith.science/paper/DV6XASYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15767&json=true","fetch_graph":"https://pith.science/api/pith-number/DV6XASYMWEHIMJTY76S32BAII6/graph.json","fetch_events":"https://pith.science/api/pith-number/DV6XASYMWEHIMJTY76S32BAII6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6/action/storage_attestation","attest_author":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6/action/author_attestation","sign_citation":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6/action/citation_signature","submit_replication":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6/action/replication_record"}},"created_at":"2026-07-05T11:01:31.278626+00:00","updated_at":"2026-07-05T11:01:31.278626+00:00"}