{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LRUV55NFDZFPXT72XJWIIEUD7S","short_pith_number":"pith:LRUV55NF","schema_version":"1.0","canonical_sha256":"5c695ef5a51e4afbcffaba6c841283fcb4438044eb85239a464ff56cb6f33017","source":{"kind":"arxiv","id":"2010.03509","version":3},"attestation_state":"computed","paper":{"title":"Automatic Backward Filtering Forward Guiding for Markov processes and graphical models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Frank van der Meulen, Moritz Schauer","submitted_at":"2020-10-07T16:30:13Z","abstract_excerpt":"We incorporate discrete and continuous time Markov processes as building blocks into probabilistic graphical models with latent and observed variables. We introduce the automatic Backward Filtering Forward Guiding (BFFG) paradigm (Mider et al., 2021) for programmable inference on latent states and model parameters. Our starting point is a generative model, a forward description of the probabilistic process dynamics. We backpropagate the information provided by observations through the model to transform the generative (forward) model into a pre-conditional model guided by the data. It approxim"},"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":"2010.03509","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2020-10-07T16:30:13Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"b70cc6037cb62bff01fb41393d180ccc876a3371a7f4444d06f36fcde06cd6dc","abstract_canon_sha256":"229df8567d223e14dab7c30bde7bb1426baa5f0975c746fd5b2cc77b3d4a5b77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:07.253162Z","signature_b64":"NHa/wevukBPWrLCdj8J4IYbSInJWs54O7FRXG9XYhG4Wa45hSZagoJa5/XLfb/sunwY9ORdxY7CK4fCCs47VDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c695ef5a51e4afbcffaba6c841283fcb4438044eb85239a464ff56cb6f33017","last_reissued_at":"2026-07-05T05:12:07.252700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:07.252700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Backward Filtering Forward Guiding for Markov processes and graphical models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Frank van der Meulen, Moritz Schauer","submitted_at":"2020-10-07T16:30:13Z","abstract_excerpt":"We incorporate discrete and continuous time Markov processes as building blocks into probabilistic graphical models with latent and observed variables. We introduce the automatic Backward Filtering Forward Guiding (BFFG) paradigm (Mider et al., 2021) for programmable inference on latent states and model parameters. Our starting point is a generative model, a forward description of the probabilistic process dynamics. We backpropagate the information provided by observations through the model to transform the generative (forward) model into a pre-conditional model guided by the data. It approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.03509","kind":"arxiv","version":3},"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/2010.03509/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":"2010.03509","created_at":"2026-07-05T05:12:07.252753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.03509v3","created_at":"2026-07-05T05:12:07.252753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03509","created_at":"2026-07-05T05:12:07.252753+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRUV55NFDZFP","created_at":"2026-07-05T05:12:07.252753+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRUV55NFDZFPXT72","created_at":"2026-07-05T05:12:07.252753+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRUV55NF","created_at":"2026-07-05T05:12:07.252753+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2207.09180","citing_title":"Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2409.14585","citing_title":"A convergent scheme for the Bayesian filtering problem based on the Fokker--Planck equation and deep splitting","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2508.10630","citing_title":"Nonlinear filtering based on density approximation and deep BSDE prediction","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LRUV55NFDZFPXT72XJWIIEUD7S","json":"https://pith.science/pith/LRUV55NFDZFPXT72XJWIIEUD7S.json","graph_json":"https://pith.science/api/pith-number/LRUV55NFDZFPXT72XJWIIEUD7S/graph.json","events_json":"https://pith.science/api/pith-number/LRUV55NFDZFPXT72XJWIIEUD7S/events.json","paper":"https://pith.science/paper/LRUV55NF"},"agent_actions":{"view_html":"https://pith.science/pith/LRUV55NFDZFPXT72XJWIIEUD7S","download_json":"https://pith.science/pith/LRUV55NFDZFPXT72XJWIIEUD7S.json","view_paper":"https://pith.science/paper/LRUV55NF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.03509&json=true","fetch_graph":"https://pith.science/api/pith-number/LRUV55NFDZFPXT72XJWIIEUD7S/graph.json","fetch_events":"https://pith.science/api/pith-number/LRUV55NFDZFPXT72XJWIIEUD7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRUV55NFDZFPXT72XJWIIEUD7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRUV55NFDZFPXT72XJWIIEUD7S/action/storage_attestation","attest_author":"https://pith.science/pith/LRUV55NFDZFPXT72XJWIIEUD7S/action/author_attestation","sign_citation":"https://pith.science/pith/LRUV55NFDZFPXT72XJWIIEUD7S/action/citation_signature","submit_replication":"https://pith.science/pith/LRUV55NFDZFPXT72XJWIIEUD7S/action/replication_record"}},"created_at":"2026-07-05T05:12:07.252753+00:00","updated_at":"2026-07-05T05:12:07.252753+00:00"}