{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2OFDKZEGIXPTHJBXFR5NZAD7K4","short_pith_number":"pith:2OFDKZEG","schema_version":"1.0","canonical_sha256":"d38a35648645df33a4372c7adc807f57309abd1fe9acca5b4bb0e4fbb5e47dae","source":{"kind":"arxiv","id":"1903.09136","version":1},"attestation_state":"computed","paper":{"title":"On Approximate Nonlinear Gaussian Message Passing On Factor Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SP"],"primary_cat":"stat.ML","authors_text":"Christian Hoffmann, Eike Petersen, Philipp Rostalski","submitted_at":"2019-03-21T17:48:06Z","abstract_excerpt":"Factor graphs have recently gained increasing attention as a unified framework for representing and constructing algorithms for signal processing, estimation, and control. One capability that does not seem to be well explored within the factor graph tool kit is the ability to handle deterministic nonlinear transformations, such as those occurring in nonlinear filtering and smoothing problems, using tabulated message passing rules. In this contribution, we provide general forward (filtering) and backward (smoothing) approximate Gaussian message passing rules for deterministic nonlinear transfor"},"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":"1903.09136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-21T17:48:06Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SP"],"title_canon_sha256":"cfa1d9b395e6f03c45705f990eb4d521408e73c95546b568cda3ae3812d3607b","abstract_canon_sha256":"e9f2271e42e95701cf93279005773f97ccb525dc0a86ed35a12b43f6769fb916"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:43.170493Z","signature_b64":"TldJMCdBFER96pxFOxswimpTG6Vxan8pkEOgQdCloRsPljJJXiJov4m2Sp9X/vBFKBIlaXNYIWIpU/BZOsFyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d38a35648645df33a4372c7adc807f57309abd1fe9acca5b4bb0e4fbb5e47dae","last_reissued_at":"2026-05-17T23:50:43.170029Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:43.170029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Approximate Nonlinear Gaussian Message Passing On Factor Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SP"],"primary_cat":"stat.ML","authors_text":"Christian Hoffmann, Eike Petersen, Philipp Rostalski","submitted_at":"2019-03-21T17:48:06Z","abstract_excerpt":"Factor graphs have recently gained increasing attention as a unified framework for representing and constructing algorithms for signal processing, estimation, and control. One capability that does not seem to be well explored within the factor graph tool kit is the ability to handle deterministic nonlinear transformations, such as those occurring in nonlinear filtering and smoothing problems, using tabulated message passing rules. In this contribution, we provide general forward (filtering) and backward (smoothing) approximate Gaussian message passing rules for deterministic nonlinear transfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09136","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":"1903.09136","created_at":"2026-05-17T23:50:43.170110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09136v1","created_at":"2026-05-17T23:50:43.170110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09136","created_at":"2026-05-17T23:50:43.170110+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OFDKZEGIXPT","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OFDKZEGIXPTHJBX","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OFDKZEG","created_at":"2026-05-18T12:33:07.085635+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/2OFDKZEGIXPTHJBXFR5NZAD7K4","json":"https://pith.science/pith/2OFDKZEGIXPTHJBXFR5NZAD7K4.json","graph_json":"https://pith.science/api/pith-number/2OFDKZEGIXPTHJBXFR5NZAD7K4/graph.json","events_json":"https://pith.science/api/pith-number/2OFDKZEGIXPTHJBXFR5NZAD7K4/events.json","paper":"https://pith.science/paper/2OFDKZEG"},"agent_actions":{"view_html":"https://pith.science/pith/2OFDKZEGIXPTHJBXFR5NZAD7K4","download_json":"https://pith.science/pith/2OFDKZEGIXPTHJBXFR5NZAD7K4.json","view_paper":"https://pith.science/paper/2OFDKZEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09136&json=true","fetch_graph":"https://pith.science/api/pith-number/2OFDKZEGIXPTHJBXFR5NZAD7K4/graph.json","fetch_events":"https://pith.science/api/pith-number/2OFDKZEGIXPTHJBXFR5NZAD7K4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OFDKZEGIXPTHJBXFR5NZAD7K4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OFDKZEGIXPTHJBXFR5NZAD7K4/action/storage_attestation","attest_author":"https://pith.science/pith/2OFDKZEGIXPTHJBXFR5NZAD7K4/action/author_attestation","sign_citation":"https://pith.science/pith/2OFDKZEGIXPTHJBXFR5NZAD7K4/action/citation_signature","submit_replication":"https://pith.science/pith/2OFDKZEGIXPTHJBXFR5NZAD7K4/action/replication_record"}},"created_at":"2026-05-17T23:50:43.170110+00:00","updated_at":"2026-05-17T23:50:43.170110+00:00"}