{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NDXZFBR3SSF2UHQ5E4DOIX5NRO","short_pith_number":"pith:NDXZFBR3","schema_version":"1.0","canonical_sha256":"68ef92863b948baa1e1d2706e45fad8bb9c70eb38796989ce37a8ac81aaf7f3b","source":{"kind":"arxiv","id":"2308.01676","version":2},"attestation_state":"computed","paper":{"title":"Density-Based Semantics for Reactive Probabilistic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Christine Tasson, Guillaume Baudart, Louis Mandel","submitted_at":"2023-08-03T10:26:32Z","abstract_excerpt":"Synchronous languages are now a standard industry tool for critical embedded systems. Designers write high-level specifications by composing streams of values using block diagrams. These languages have been extended with Bayesian reasoning to program state-space models which compute a stream of distributions given a stream of observations. However, the semantics of probabilistic models is only defined for scheduled equations -- a significant limitation compared to dataflow synchronous languages and block diagrams which do not require any ordering.\n  In this paper we propose two schedule agnost"},"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":"2308.01676","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2023-08-03T10:26:32Z","cross_cats_sorted":[],"title_canon_sha256":"dc5fed1b622bddd22bc2b7d83314ccd4cee4bd56907e802d167fe430dfca4353","abstract_canon_sha256":"09ca7ab7c5213f81c883547406b05ee46dc8c824c20a95dfa1b4caa807b34ee5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:48:50.646501Z","signature_b64":"VSz/cZdMUffwwwpLGOTNrVbq9PZcjhh9/N5mBCjtRtNGjIC4fThfFjFUyI1/mLdSqokbhX+fdnaG1kzz/wXuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68ef92863b948baa1e1d2706e45fad8bb9c70eb38796989ce37a8ac81aaf7f3b","last_reissued_at":"2026-07-05T06:48:50.646008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:48:50.646008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density-Based Semantics for Reactive Probabilistic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Christine Tasson, Guillaume Baudart, Louis Mandel","submitted_at":"2023-08-03T10:26:32Z","abstract_excerpt":"Synchronous languages are now a standard industry tool for critical embedded systems. Designers write high-level specifications by composing streams of values using block diagrams. These languages have been extended with Bayesian reasoning to program state-space models which compute a stream of distributions given a stream of observations. However, the semantics of probabilistic models is only defined for scheduled equations -- a significant limitation compared to dataflow synchronous languages and block diagrams which do not require any ordering.\n  In this paper we propose two schedule agnost"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.01676","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/2308.01676/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":"2308.01676","created_at":"2026-07-05T06:48:50.646062+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.01676v2","created_at":"2026-07-05T06:48:50.646062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.01676","created_at":"2026-07-05T06:48:50.646062+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDXZFBR3SSF2","created_at":"2026-07-05T06:48:50.646062+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDXZFBR3SSF2UHQ5","created_at":"2026-07-05T06:48:50.646062+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDXZFBR3","created_at":"2026-07-05T06:48:50.646062+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.23047","citing_title":"MixQuant: Adaptive Mixed-Precision Quantization for Large Language Models","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDXZFBR3SSF2UHQ5E4DOIX5NRO","json":"https://pith.science/pith/NDXZFBR3SSF2UHQ5E4DOIX5NRO.json","graph_json":"https://pith.science/api/pith-number/NDXZFBR3SSF2UHQ5E4DOIX5NRO/graph.json","events_json":"https://pith.science/api/pith-number/NDXZFBR3SSF2UHQ5E4DOIX5NRO/events.json","paper":"https://pith.science/paper/NDXZFBR3"},"agent_actions":{"view_html":"https://pith.science/pith/NDXZFBR3SSF2UHQ5E4DOIX5NRO","download_json":"https://pith.science/pith/NDXZFBR3SSF2UHQ5E4DOIX5NRO.json","view_paper":"https://pith.science/paper/NDXZFBR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.01676&json=true","fetch_graph":"https://pith.science/api/pith-number/NDXZFBR3SSF2UHQ5E4DOIX5NRO/graph.json","fetch_events":"https://pith.science/api/pith-number/NDXZFBR3SSF2UHQ5E4DOIX5NRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDXZFBR3SSF2UHQ5E4DOIX5NRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDXZFBR3SSF2UHQ5E4DOIX5NRO/action/storage_attestation","attest_author":"https://pith.science/pith/NDXZFBR3SSF2UHQ5E4DOIX5NRO/action/author_attestation","sign_citation":"https://pith.science/pith/NDXZFBR3SSF2UHQ5E4DOIX5NRO/action/citation_signature","submit_replication":"https://pith.science/pith/NDXZFBR3SSF2UHQ5E4DOIX5NRO/action/replication_record"}},"created_at":"2026-07-05T06:48:50.646062+00:00","updated_at":"2026-07-05T06:48:50.646062+00:00"}