{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MY5U2GJJCVB6WMBXHYBX3QBRAC","short_pith_number":"pith:MY5U2GJJ","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"},"canonical_sha256":"663b4d19291543eb30373e037dc03100b3a7b96fa6c8d2ac76bf5a4dbfa5551d","source":{"kind":"arxiv","id":"1811.03407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03407","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03407v1","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03407","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"MY5U2GJJCVB6","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MY5U2GJJCVB6WMBX","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MY5U2GJJ","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MY5U2GJJCVB6WMBXHYBX3QBRAC","target":"record","payload":{"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"},"canonical_sha256":"663b4d19291543eb30373e037dc03100b3a7b96fa6c8d2ac76bf5a4dbfa5551d","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"},"source_kind":"arxiv","source_id":"1811.03407","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFfhBMtYx+OKloPIu+h4CXvbnmsfcbeFD7wdWkggx1wMIo8gUcpP0SGFwMxFpcpth+aAg0QQtw4FVy6OUYOCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T00:42:46.568255Z"},"content_sha256":"a27a242b92e05137ee074db5aeb2fec1776b9128963fa65f577fef75825a9779","schema_version":"1.0","event_id":"sha256:a27a242b92e05137ee074db5aeb2fec1776b9128963fa65f577fef75825a9779"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MY5U2GJJCVB6WMBXHYBX3QBRAC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfOgQTwpZbcybjkXe98qSd+KEZoZzajW0+YIexEWgRoJh79mWD60hNzYq0C2cLogD/A9qzCLr+N61FqO1vPxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T00:42:46.568617Z"},"content_sha256":"65257962b47edd70986d0ec5e124db0c8226cc46b5c72c4b0cfbbfdbff56c911","schema_version":"1.0","event_id":"sha256:65257962b47edd70986d0ec5e124db0c8226cc46b5c72c4b0cfbbfdbff56c911"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/bundle.json","state_url":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T00:42:46Z","links":{"resolver":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC","bundle":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/bundle.json","state":"https://pith.science/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MY5U2GJJCVB6WMBXHYBX3QBRAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MY5U2GJJCVB6WMBXHYBX3QBRAC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b9496ddd9e3ee461bb076fb19ec69eecc62d818c5832dadec0893416dcc6e3e1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-08T13:53:46Z","title_canon_sha256":"33babe70b46346ce9a624a9f6fde71bdcabc4cd1618e6b1e529a1898082c1648"},"schema_version":"1.0","source":{"id":"1811.03407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03407","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03407v1","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03407","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"MY5U2GJJCVB6","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MY5U2GJJCVB6WMBX","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MY5U2GJJ","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:65257962b47edd70986d0ec5e124db0c8226cc46b5c72c4b0cfbbfdbff56c911","target":"graph","created_at":"2026-05-18T00:01:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bert de Vries, Marco Cox, Thijs van de Laar","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-08T13:53:46Z","title":"A Factor Graph Approach to Automated Design of Bayesian Signal Processing Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03407","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a27a242b92e05137ee074db5aeb2fec1776b9128963fa65f577fef75825a9779","target":"record","created_at":"2026-05-18T00:01:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b9496ddd9e3ee461bb076fb19ec69eecc62d818c5832dadec0893416dcc6e3e1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-08T13:53:46Z","title_canon_sha256":"33babe70b46346ce9a624a9f6fde71bdcabc4cd1618e6b1e529a1898082c1648"},"schema_version":"1.0","source":{"id":"1811.03407","kind":"arxiv","version":1}},"canonical_sha256":"663b4d19291543eb30373e037dc03100b3a7b96fa6c8d2ac76bf5a4dbfa5551d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"663b4d19291543eb30373e037dc03100b3a7b96fa6c8d2ac76bf5a4dbfa5551d","first_computed_at":"2026-05-18T00:01:12.535030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:12.535030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S/VuNjs+qH1M8y6pe+EjOCQEoeQZ5ZLNAShf8QOYHb4Z0lfpvlP3v0gRwBJoB67MHt6r9McRHT5G1xL1Vf8XBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:12.535633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a27a242b92e05137ee074db5aeb2fec1776b9128963fa65f577fef75825a9779","sha256:65257962b47edd70986d0ec5e124db0c8226cc46b5c72c4b0cfbbfdbff56c911"],"state_sha256":"8961806a77603b482b7848c6be9f221c75ac904920f9c43d1838784e2eb5bd0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGpjioAfPC5Up9WTm6McTrCykza2fszNcGB5tNWFyQ7I3ZkLvR7rq/sl0GDJDTt4eTT6AhZWDaTTr56C6IyRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T00:42:46.570497Z","bundle_sha256":"95fc0b946ff99d467386dc11b3449479d63c618a0cbc1ef139836157978f46f9"}}