{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DV6XASYMWEHIMJTY76S32BAII6","short_pith_number":"pith:DV6XASYM","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"},"canonical_sha256":"1d7d704b0cb10e862678ffa5bd040847b51ff48f1a411aaf9878bcabc8326adf","source":{"kind":"arxiv","id":"2501.15767","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.15767","created_at":"2026-07-05T11:01:31Z"},{"alias_kind":"arxiv_version","alias_value":"2501.15767v2","created_at":"2026-07-05T11:01:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15767","created_at":"2026-07-05T11:01:31Z"},{"alias_kind":"pith_short_12","alias_value":"DV6XASYMWEHI","created_at":"2026-07-05T11:01:31Z"},{"alias_kind":"pith_short_16","alias_value":"DV6XASYMWEHIMJTY","created_at":"2026-07-05T11:01:31Z"},{"alias_kind":"pith_short_8","alias_value":"DV6XASYM","created_at":"2026-07-05T11:01:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DV6XASYMWEHIMJTY76S32BAII6","target":"record","payload":{"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"},"canonical_sha256":"1d7d704b0cb10e862678ffa5bd040847b51ff48f1a411aaf9878bcabc8326adf","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"},"source_kind":"arxiv","source_id":"2501.15767","source_version":2,"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-05T11:01:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q8YZ2PrLRSubJR4jAHF0qch9bbN1rgfNHK5IcCffJ4dVVw+iHmY3gMZGB30oVuIkAvqrRfEq1copmZtYdLeJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:43:30.267102Z"},"content_sha256":"d8b3fcdea3784b82de88d9f431c24934f8d43752aa712d7a78a4e91dc023edaf","schema_version":"1.0","event_id":"sha256:d8b3fcdea3784b82de88d9f431c24934f8d43752aa712d7a78a4e91dc023edaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DV6XASYMWEHIMJTY76S32BAII6","target":"graph","payload":{"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"},"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-05T11:01:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1iS7qZAcKUdmGjwNv4dW0BoY6cB8jKJUIFOTytR+sij9ucj0lSnid2/TTVHttSn3TJjzGP+AtAZNjJ3udsW3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:43:30.267487Z"},"content_sha256":"b98fcde3019eb738d3abe24b23e271cf0149f06addee6b6106dff365431831ef","schema_version":"1.0","event_id":"sha256:b98fcde3019eb738d3abe24b23e271cf0149f06addee6b6106dff365431831ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6/bundle.json","state_url":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DV6XASYMWEHIMJTY76S32BAII6/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-07-09T00:43:30Z","links":{"resolver":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6","bundle":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6/bundle.json","state":"https://pith.science/pith/DV6XASYMWEHIMJTY76S32BAII6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DV6XASYMWEHIMJTY76S32BAII6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DV6XASYMWEHIMJTY76S32BAII6","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":"85cae42d689bb13f7db2047230409c0ae0ffd1f9af355c557c93d8585558f9a0","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-27T04:34:22Z","title_canon_sha256":"9b4dcd39cfd3b743683ae91515bced9d4dcfdb8bcc181c09878c5224897de783"},"schema_version":"1.0","source":{"id":"2501.15767","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.15767","created_at":"2026-07-05T11:01:31Z"},{"alias_kind":"arxiv_version","alias_value":"2501.15767v2","created_at":"2026-07-05T11:01:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15767","created_at":"2026-07-05T11:01:31Z"},{"alias_kind":"pith_short_12","alias_value":"DV6XASYMWEHI","created_at":"2026-07-05T11:01:31Z"},{"alias_kind":"pith_short_16","alias_value":"DV6XASYMWEHIMJTY","created_at":"2026-07-05T11:01:31Z"},{"alias_kind":"pith_short_8","alias_value":"DV6XASYM","created_at":"2026-07-05T11:01:31Z"}],"graph_snapshots":[{"event_id":"sha256:b98fcde3019eb738d3abe24b23e271cf0149f06addee6b6106dff365431831ef","target":"graph","created_at":"2026-07-05T11:01: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/2501.15767/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Muhammad Maaz, Timothy C. Y. Chan","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-27T04:34:22Z","title":"Formal Verification of Markov Processes with Learned Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15767","kind":"arxiv","version":2},"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:d8b3fcdea3784b82de88d9f431c24934f8d43752aa712d7a78a4e91dc023edaf","target":"record","created_at":"2026-07-05T11:01: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":"85cae42d689bb13f7db2047230409c0ae0ffd1f9af355c557c93d8585558f9a0","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-27T04:34:22Z","title_canon_sha256":"9b4dcd39cfd3b743683ae91515bced9d4dcfdb8bcc181c09878c5224897de783"},"schema_version":"1.0","source":{"id":"2501.15767","kind":"arxiv","version":2}},"canonical_sha256":"1d7d704b0cb10e862678ffa5bd040847b51ff48f1a411aaf9878bcabc8326adf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d7d704b0cb10e862678ffa5bd040847b51ff48f1a411aaf9878bcabc8326adf","first_computed_at":"2026-07-05T11:01:31.278577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:01:31.278577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eb5YvAxkfZggQ/1VwWJCTXRILYjGoj/Wz+yhPoRlMdIQXsu6oVPSxs4rClG19MgAR8LQVq29NsWeCKog63zsDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:01:31.278963Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.15767","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8b3fcdea3784b82de88d9f431c24934f8d43752aa712d7a78a4e91dc023edaf","sha256:b98fcde3019eb738d3abe24b23e271cf0149f06addee6b6106dff365431831ef"],"state_sha256":"a078a3a7c4ea0951b9df8f11892d7175b9cf726c1d6316743c1ef1328289d871"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Qa9sH3kr1hubCq6VTuwwXm0+Pb7sllE+GubXLvxdsjC5+vB2/ypuGh75MWWai5dDZcX/kzCn4h0AsXFTWgdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T00:43:30.269494Z","bundle_sha256":"bdc0718586f0d40404de8570a3e1ab45bd76895d55bf8b08fcc4a56f41a2afbb"}}