{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WSCYFAGMIOF33LBSV4HKNRHQVM","short_pith_number":"pith:WSCYFAGM","canonical_record":{"source":{"id":"1404.3162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-04-11T17:28:54Z","cross_cats_sorted":[],"title_canon_sha256":"b17fc824305985472cc6b5ce561d6119cb8bf32e17a92b481b14aba88f755acc","abstract_canon_sha256":"7fff7767ce29bbeb07ee88b8a0575567d32d759b9e4aa88aa422deb659ceb64f"},"schema_version":"1.0"},"canonical_sha256":"b4858280cc438bbdac32af0ea6c4f0ab2ee297eae6e0647a22b0068b8dfd2b27","source":{"kind":"arxiv","id":"1404.3162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3162","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3162v1","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3162","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"WSCYFAGMIOF3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WSCYFAGMIOF33LBS","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WSCYFAGM","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WSCYFAGMIOF33LBSV4HKNRHQVM","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-04-11T17:28:54Z","cross_cats_sorted":[],"title_canon_sha256":"b17fc824305985472cc6b5ce561d6119cb8bf32e17a92b481b14aba88f755acc","abstract_canon_sha256":"7fff7767ce29bbeb07ee88b8a0575567d32d759b9e4aa88aa422deb659ceb64f"},"schema_version":"1.0"},"canonical_sha256":"b4858280cc438bbdac32af0ea6c4f0ab2ee297eae6e0647a22b0068b8dfd2b27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:22.076740Z","signature_b64":"Y4JMJ7XjhNuyDg5wKTahYDE0UX5E+7XJRMapGZ3GjxOnYm9TP7kxJI0nEWPiVlj3AWKJxnf8tbl3SA7z/NNaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4858280cc438bbdac32af0ea6c4f0ab2ee297eae6e0647a22b0068b8dfd2b27","last_reissued_at":"2026-05-18T02:54:22.076307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:22.076307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3162","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-18T02:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4aBNnilHffQ/AhYQX9EBOVnnc0im1AbqlejVRUkYgdS2wTt4lNO7nZ50AIJpJ7kXe/+ZIR9OGhctscnf7VoFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:06:00.475277Z"},"content_sha256":"19277b41687e2d0e3bbe102e4a4d9cea648182d05025df40050481a600b94511","schema_version":"1.0","event_id":"sha256:19277b41687e2d0e3bbe102e4a4d9cea648182d05025df40050481a600b94511"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WSCYFAGMIOF33LBSV4HKNRHQVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Signal Processor for Gaussian Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Andreas Burg, Harald Kr\\\"oll, Lukas Bruderer, Qiuting Huang, Reto Odermatt, Stefan Zwicky","submitted_at":"2014-04-11T17:28:54Z","abstract_excerpt":"In this paper, we present a novel signal processing unit built upon the theory of factor graphs, which is able to address a wide range of signal processing algorithms. More specifically, the demonstrated factor graph processor (FGP) is tailored to Gaussian message passing algorithms. We show how to use a highly configurable systolic array to solve the message update equations of nodes in a factor graph efficiently. A proper instruction set and compilation procedure is presented. In a recursive least squares channel estimation example we show that the FGP can compute a message update faster tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3162","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-18T02:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zd8g7y23O8yeQrHZUh5gAAJO2ChUw31Wd37ZcehxrguTZveiLX/7e+dBVp+Q9uRTgisoZvPQAncPsDr4bKexBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:06:00.475658Z"},"content_sha256":"cbede88d4839080013bdba14c47b34a3ad3193a44ad3dbe98087bb7efa8187a4","schema_version":"1.0","event_id":"sha256:cbede88d4839080013bdba14c47b34a3ad3193a44ad3dbe98087bb7efa8187a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSCYFAGMIOF33LBSV4HKNRHQVM/bundle.json","state_url":"https://pith.science/pith/WSCYFAGMIOF33LBSV4HKNRHQVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSCYFAGMIOF33LBSV4HKNRHQVM/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-20T18:06:00Z","links":{"resolver":"https://pith.science/pith/WSCYFAGMIOF33LBSV4HKNRHQVM","bundle":"https://pith.science/pith/WSCYFAGMIOF33LBSV4HKNRHQVM/bundle.json","state":"https://pith.science/pith/WSCYFAGMIOF33LBSV4HKNRHQVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSCYFAGMIOF33LBSV4HKNRHQVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WSCYFAGMIOF33LBSV4HKNRHQVM","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":"7fff7767ce29bbeb07ee88b8a0575567d32d759b9e4aa88aa422deb659ceb64f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-04-11T17:28:54Z","title_canon_sha256":"b17fc824305985472cc6b5ce561d6119cb8bf32e17a92b481b14aba88f755acc"},"schema_version":"1.0","source":{"id":"1404.3162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3162","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3162v1","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3162","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"WSCYFAGMIOF3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WSCYFAGMIOF33LBS","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WSCYFAGM","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:cbede88d4839080013bdba14c47b34a3ad3193a44ad3dbe98087bb7efa8187a4","target":"graph","created_at":"2026-05-18T02:54:22Z","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":"In this paper, we present a novel signal processing unit built upon the theory of factor graphs, which is able to address a wide range of signal processing algorithms. More specifically, the demonstrated factor graph processor (FGP) is tailored to Gaussian message passing algorithms. We show how to use a highly configurable systolic array to solve the message update equations of nodes in a factor graph efficiently. A proper instruction set and compilation procedure is presented. In a recursive least squares channel estimation example we show that the FGP can compute a message update faster tha","authors_text":"Andreas Burg, Harald Kr\\\"oll, Lukas Bruderer, Qiuting Huang, Reto Odermatt, Stefan Zwicky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-04-11T17:28:54Z","title":"A Signal Processor for Gaussian Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3162","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:19277b41687e2d0e3bbe102e4a4d9cea648182d05025df40050481a600b94511","target":"record","created_at":"2026-05-18T02:54:22Z","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":"7fff7767ce29bbeb07ee88b8a0575567d32d759b9e4aa88aa422deb659ceb64f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-04-11T17:28:54Z","title_canon_sha256":"b17fc824305985472cc6b5ce561d6119cb8bf32e17a92b481b14aba88f755acc"},"schema_version":"1.0","source":{"id":"1404.3162","kind":"arxiv","version":1}},"canonical_sha256":"b4858280cc438bbdac32af0ea6c4f0ab2ee297eae6e0647a22b0068b8dfd2b27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4858280cc438bbdac32af0ea6c4f0ab2ee297eae6e0647a22b0068b8dfd2b27","first_computed_at":"2026-05-18T02:54:22.076307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:22.076307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y4JMJ7XjhNuyDg5wKTahYDE0UX5E+7XJRMapGZ3GjxOnYm9TP7kxJI0nEWPiVlj3AWKJxnf8tbl3SA7z/NNaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:22.076740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19277b41687e2d0e3bbe102e4a4d9cea648182d05025df40050481a600b94511","sha256:cbede88d4839080013bdba14c47b34a3ad3193a44ad3dbe98087bb7efa8187a4"],"state_sha256":"44a55a717bb925790731b59d60a8c781927021f731a437c71ae3082ad4a1fb0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iyl68qa7iLk30uQViBpcOrQWAaiFmmShFRPAMrvXqixaUas67jxTIT1Jn820Ic2MPsDLI1IPG12aIiSgvRRVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T18:06:00.477562Z","bundle_sha256":"f3c5a37efd9bdb54f2970f2af73d9d6d33638d632afb3b8b4019de1ba6f3e746"}}