{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BOULT5SA4PS4M6QQWJJQU4HAIF","short_pith_number":"pith:BOULT5SA","schema_version":"1.0","canonical_sha256":"0ba8b9f640e3e5c67a10b2530a70e041510a2eaa78da021b5600b029e34d64df","source":{"kind":"arxiv","id":"2606.19017","version":1},"attestation_state":"computed","paper":{"title":"Completeness for Probabilistic Boolean Tapes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"cs.LO","authors_text":"Cipriano Junior Cioffo, Filippo Bonchi","submitted_at":"2026-06-17T12:39:15Z","abstract_excerpt":"Probabilistic Boolean circuits have recently been proposed as a string-diagrammatic foundation for finite probabilistic programming. In this paper, we present a complete set of axioms for their semantics in terms of Markov kernels. Our approach is based on two intermediate results: completeness for \\emph{partial} Boolean circuits and completeness for probabilistic Boolean tapes, a diagrammatic language for rig categories."},"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":"2606.19017","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-17T12:39:15Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"2804dec35c6cb20f77d58ac3d82daab61c7c67258d3ab97d18bffe4efb3fd192","abstract_canon_sha256":"3b88a2ab5665e12940b426346cbd904b4a70b2d2adaa08f38f593d2c7f0f9011"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:54.665820Z","signature_b64":"31hH8bdE4+aCt3yjuALLlWCjwuZ7TTfOQG4YGcNxDfygc9RlfXwP0OzAWotiw8vt5dabjoqTPWl0F4ajB2h+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ba8b9f640e3e5c67a10b2530a70e041510a2eaa78da021b5600b029e34d64df","last_reissued_at":"2026-06-19T16:11:54.665305Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:54.665305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completeness for Probabilistic Boolean Tapes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"cs.LO","authors_text":"Cipriano Junior Cioffo, Filippo Bonchi","submitted_at":"2026-06-17T12:39:15Z","abstract_excerpt":"Probabilistic Boolean circuits have recently been proposed as a string-diagrammatic foundation for finite probabilistic programming. In this paper, we present a complete set of axioms for their semantics in terms of Markov kernels. Our approach is based on two intermediate results: completeness for \\emph{partial} Boolean circuits and completeness for probabilistic Boolean tapes, a diagrammatic language for rig categories."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19017","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/2606.19017/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":"2606.19017","created_at":"2026-06-19T16:11:54.665429+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.19017v1","created_at":"2026-06-19T16:11:54.665429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19017","created_at":"2026-06-19T16:11:54.665429+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOULT5SA4PS4","created_at":"2026-06-19T16:11:54.665429+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOULT5SA4PS4M6QQ","created_at":"2026-06-19T16:11:54.665429+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOULT5SA","created_at":"2026-06-19T16:11:54.665429+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/BOULT5SA4PS4M6QQWJJQU4HAIF","json":"https://pith.science/pith/BOULT5SA4PS4M6QQWJJQU4HAIF.json","graph_json":"https://pith.science/api/pith-number/BOULT5SA4PS4M6QQWJJQU4HAIF/graph.json","events_json":"https://pith.science/api/pith-number/BOULT5SA4PS4M6QQWJJQU4HAIF/events.json","paper":"https://pith.science/paper/BOULT5SA"},"agent_actions":{"view_html":"https://pith.science/pith/BOULT5SA4PS4M6QQWJJQU4HAIF","download_json":"https://pith.science/pith/BOULT5SA4PS4M6QQWJJQU4HAIF.json","view_paper":"https://pith.science/paper/BOULT5SA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.19017&json=true","fetch_graph":"https://pith.science/api/pith-number/BOULT5SA4PS4M6QQWJJQU4HAIF/graph.json","fetch_events":"https://pith.science/api/pith-number/BOULT5SA4PS4M6QQWJJQU4HAIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOULT5SA4PS4M6QQWJJQU4HAIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOULT5SA4PS4M6QQWJJQU4HAIF/action/storage_attestation","attest_author":"https://pith.science/pith/BOULT5SA4PS4M6QQWJJQU4HAIF/action/author_attestation","sign_citation":"https://pith.science/pith/BOULT5SA4PS4M6QQWJJQU4HAIF/action/citation_signature","submit_replication":"https://pith.science/pith/BOULT5SA4PS4M6QQWJJQU4HAIF/action/replication_record"}},"created_at":"2026-06-19T16:11:54.665429+00:00","updated_at":"2026-06-19T16:11:54.665429+00:00"}