{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MY5U2GJJCVB6WMBXHYBX3QBRAC","short_pith_number":"pith:MY5U2GJJ","schema_version":"1.0","canonical_sha256":"663b4d19291543eb30373e037dc03100b3a7b96fa6c8d2ac76bf5a4dbfa5551d","source":{"kind":"arxiv","id":"1811.03407","version":1},"attestation_state":"computed","paper":{"title":"A Factor Graph Approach to Automated Design of Bayesian Signal Processing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bert de Vries, Marco Cox, Thijs van de Laar","submitted_at":"2018-11-08T13:53:46Z","abstract_excerpt":"The benefits of automating design cycles for Bayesian inference-based algorithms are becoming increasingly recognized by the machine learning community. As a result, interest in probabilistic programming frameworks has much increased over the past few years. This paper explores a specific probabilistic programming paradigm, namely message passing in Forney-style factor graphs (FFGs), in the context of automated design of efficient Bayesian signal processing algorithms. To this end, we developed \"ForneyLab\" (https://github.com/biaslab/ForneyLab.jl) as a Julia toolbox for message passing-based i"},"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":"1811.03407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-08T13:53:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"33babe70b46346ce9a624a9f6fde71bdcabc4cd1618e6b1e529a1898082c1648","abstract_canon_sha256":"b9496ddd9e3ee461bb076fb19ec69eecc62d818c5832dadec0893416dcc6e3e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:12.535633Z","signature_b64":"S/VuNjs+qH1M8y6pe+EjOCQEoeQZ5ZLNAShf8QOYHb4Z0lfpvlP3v0gRwBJoB67MHt6r9McRHT5G1xL1Vf8XBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"663b4d19291543eb30373e037dc03100b3a7b96fa6c8d2ac76bf5a4dbfa5551d","last_reissued_at":"2026-05-18T00:01:12.535030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:12.535030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Factor Graph Approach to Automated Design of Bayesian Signal Processing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bert de Vries, Marco Cox, Thijs van de Laar","submitted_at":"2018-11-08T13:53:46Z","abstract_excerpt":"The benefits of automating design cycles for Bayesian inference-based algorithms are becoming increasingly recognized by the machine learning community. As a result, interest in probabilistic programming frameworks has much increased over the past few years. This paper explores a specific probabilistic programming paradigm, namely message passing in Forney-style factor graphs (FFGs), in the context of automated design of efficient Bayesian signal processing algorithms. To this end, we developed \"ForneyLab\" (https://github.com/biaslab/ForneyLab.jl) as a Julia toolbox for message passing-based i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03407","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":"1811.03407","created_at":"2026-05-18T00:01:12.535120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03407v1","created_at":"2026-05-18T00:01:12.535120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03407","created_at":"2026-05-18T00:01:12.535120+00:00"},{"alias_kind":"pith_short_12","alias_value":"MY5U2GJJCVB6","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MY5U2GJJCVB6WMBX","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MY5U2GJJ","created_at":"2026-05-18T12:32:40.477152+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/MY5U2GJJCVB6WMBXHYBX3QBRAC","json":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC.json","graph_json":"https://pith.science/api/pith-number/MY5U2GJJCVB6WMBXHYBX3QBRAC/graph.json","events_json":"https://pith.science/api/pith-number/MY5U2GJJCVB6WMBXHYBX3QBRAC/events.json","paper":"https://pith.science/paper/MY5U2GJJ"},"agent_actions":{"view_html":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC","download_json":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC.json","view_paper":"https://pith.science/paper/MY5U2GJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03407&json=true","fetch_graph":"https://pith.science/api/pith-number/MY5U2GJJCVB6WMBXHYBX3QBRAC/graph.json","fetch_events":"https://pith.science/api/pith-number/MY5U2GJJCVB6WMBXHYBX3QBRAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/action/storage_attestation","attest_author":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/action/author_attestation","sign_citation":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/action/citation_signature","submit_replication":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/action/replication_record"}},"created_at":"2026-05-18T00:01:12.535120+00:00","updated_at":"2026-05-18T00:01:12.535120+00:00"}