{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NL37B7KU2C627AFTCUAKVQ2EUK","short_pith_number":"pith:NL37B7KU","schema_version":"1.0","canonical_sha256":"6af7f0fd54d0bdaf80b31500aac344a290224a84dcbb3a585243b9e6983a63dd","source":{"kind":"arxiv","id":"1904.08096","version":1},"attestation_state":"computed","paper":{"title":"Scalable Verification of Probabilistic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alexandra Silva, David M Kahn, Dexter Kozen, Justin Hsu, Nate Foster, Praveen Kumar, Steffen Smolka","submitted_at":"2019-04-17T06:12:57Z","abstract_excerpt":"This paper presents McNetKAT, a scalable tool for verifying probabilistic network programs. McNetKAT is based on a new semantics for the guarded and history-free fragment of Probabilistic NetKAT in terms of finite-state, absorbing Markov chains. This view allows the semantics of all programs to be computed exactly, enabling construction of an automatic verification tool. Domain-specific optimizations and a parallelizing backend enable McNetKAT to analyze networks with thousands of nodes, automatically reasoning about general properties such as probabilistic program equivalence and refinement, "},"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":"1904.08096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-04-17T06:12:57Z","cross_cats_sorted":[],"title_canon_sha256":"12000f942dfd1504858e3a0b4d37ee28ab97f93a5c10d595874b74b33df0e590","abstract_canon_sha256":"2d4c42eb638e6cfe34f4be2582addcc5005a70d36997c0fdf810df7bb5837418"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:18.785564Z","signature_b64":"TW5cQwgt2JYluvAaVa68UMr9QwrP5TSxNMAlUEH9dMEq4eEM+sj0BxZBe52671a+UG4mLQOb7bqX9ihbDTe6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6af7f0fd54d0bdaf80b31500aac344a290224a84dcbb3a585243b9e6983a63dd","last_reissued_at":"2026-05-17T23:48:18.785008Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:18.785008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Verification of Probabilistic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alexandra Silva, David M Kahn, Dexter Kozen, Justin Hsu, Nate Foster, Praveen Kumar, Steffen Smolka","submitted_at":"2019-04-17T06:12:57Z","abstract_excerpt":"This paper presents McNetKAT, a scalable tool for verifying probabilistic network programs. McNetKAT is based on a new semantics for the guarded and history-free fragment of Probabilistic NetKAT in terms of finite-state, absorbing Markov chains. This view allows the semantics of all programs to be computed exactly, enabling construction of an automatic verification tool. Domain-specific optimizations and a parallelizing backend enable McNetKAT to analyze networks with thousands of nodes, automatically reasoning about general properties such as probabilistic program equivalence and refinement, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08096","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":"1904.08096","created_at":"2026-05-17T23:48:18.785091+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08096v1","created_at":"2026-05-17T23:48:18.785091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08096","created_at":"2026-05-17T23:48:18.785091+00:00"},{"alias_kind":"pith_short_12","alias_value":"NL37B7KU2C62","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NL37B7KU2C627AFT","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NL37B7KU","created_at":"2026-05-18T12:33:24.271573+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/NL37B7KU2C627AFTCUAKVQ2EUK","json":"https://pith.science/pith/NL37B7KU2C627AFTCUAKVQ2EUK.json","graph_json":"https://pith.science/api/pith-number/NL37B7KU2C627AFTCUAKVQ2EUK/graph.json","events_json":"https://pith.science/api/pith-number/NL37B7KU2C627AFTCUAKVQ2EUK/events.json","paper":"https://pith.science/paper/NL37B7KU"},"agent_actions":{"view_html":"https://pith.science/pith/NL37B7KU2C627AFTCUAKVQ2EUK","download_json":"https://pith.science/pith/NL37B7KU2C627AFTCUAKVQ2EUK.json","view_paper":"https://pith.science/paper/NL37B7KU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08096&json=true","fetch_graph":"https://pith.science/api/pith-number/NL37B7KU2C627AFTCUAKVQ2EUK/graph.json","fetch_events":"https://pith.science/api/pith-number/NL37B7KU2C627AFTCUAKVQ2EUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NL37B7KU2C627AFTCUAKVQ2EUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NL37B7KU2C627AFTCUAKVQ2EUK/action/storage_attestation","attest_author":"https://pith.science/pith/NL37B7KU2C627AFTCUAKVQ2EUK/action/author_attestation","sign_citation":"https://pith.science/pith/NL37B7KU2C627AFTCUAKVQ2EUK/action/citation_signature","submit_replication":"https://pith.science/pith/NL37B7KU2C627AFTCUAKVQ2EUK/action/replication_record"}},"created_at":"2026-05-17T23:48:18.785091+00:00","updated_at":"2026-05-17T23:48:18.785091+00:00"}