{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FBPCPMZKMZNY34DB3HY332LGKT","short_pith_number":"pith:FBPCPMZK","canonical_record":{"source":{"id":"1605.03017","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-10T13:51:31Z","cross_cats_sorted":["cs.SY","stat.TH"],"title_canon_sha256":"f8687550553daab0d58fb1e6d77cd7f5897f17d589832d1ef87f9b3db134ce11","abstract_canon_sha256":"6be166a12a3c2b7dac0990b837daa885ed9601e7b93f2c1d30b1e6ce5ea6ef14"},"schema_version":"1.0"},"canonical_sha256":"285e27b32a665b8df061d9f1bde96654cf6c2191f36a1d9c7c91271a66fad7b7","source":{"kind":"arxiv","id":"1605.03017","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03017","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03017v3","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03017","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"FBPCPMZKMZNY","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FBPCPMZKMZNY34DB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FBPCPMZK","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FBPCPMZKMZNY34DB3HY332LGKT","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03017","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-10T13:51:31Z","cross_cats_sorted":["cs.SY","stat.TH"],"title_canon_sha256":"f8687550553daab0d58fb1e6d77cd7f5897f17d589832d1ef87f9b3db134ce11","abstract_canon_sha256":"6be166a12a3c2b7dac0990b837daa885ed9601e7b93f2c1d30b1e6ce5ea6ef14"},"schema_version":"1.0"},"canonical_sha256":"285e27b32a665b8df061d9f1bde96654cf6c2191f36a1d9c7c91271a66fad7b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:19.830710Z","signature_b64":"Xt88gdcGOLaNhHpm/iaZ5pEK1JK+Aiw5/0gZJdv37qN4n0YWebNKH8Pe//luKDZyax2/CKNl2tzXfSCAFCkcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"285e27b32a665b8df061d9f1bde96654cf6c2191f36a1d9c7c91271a66fad7b7","last_reissued_at":"2026-05-18T01:10:19.830283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:19.830283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03017","source_version":3,"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-18T01:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UM8bYsfRb7IVVfITO+/gHH9yJKoedj+Ae7nKdXwhTUVbmfpCk7RRGZcVKxxUntUIHGL0Ytryu4nh8bEdJdDECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:00:56.999158Z"},"content_sha256":"6f69592d9a63499d8aba4751302678e4ad32b9ba9b69418e766fa7a4af52db67","schema_version":"1.0","event_id":"sha256:6f69592d9a63499d8aba4751302678e4ad32b9ba9b69418e766fa7a4af52db67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FBPCPMZKMZNY34DB3HY332LGKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Marginalized Particle Filtering and Related Filtering Techniques as Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","stat.TH"],"primary_cat":"math.ST","authors_text":"Emilio Sirignano, Francesco Montorsi, Giorgio M. Vitetta, Matteo Sola","submitted_at":"2016-05-10T13:51:31Z","abstract_excerpt":"In this manuscript a factor graph approach is employed to investigate the recursive filtering problem for a mixed linear/nonlinear state-space model, i.e. for a model whose state vector can be partitioned in a linear state variable (characterized by conditionally linear dynamics) and a non linear state variable. Our approach allows us to show that: a) the factor graph characterizing the considered filtering problem is not cycle free; b) in the case of conditionally linear Gaussian systems, applying the sum-product rule, together with different scheduling procedures for message passing, to this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03017","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":""},"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-18T01:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/PoV+sYh1nr3WYutaOOAFh20NHfxqckidcKe9Gyz0F7prCZ5zctaqAl0bk7V+RUBLa5zPu/ONC4hqOJX8Iy9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:00:56.999838Z"},"content_sha256":"385a532fafc907239fa07e9e3febcff1879177dd01e3bdfa499306699a3d45e0","schema_version":"1.0","event_id":"sha256:385a532fafc907239fa07e9e3febcff1879177dd01e3bdfa499306699a3d45e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBPCPMZKMZNY34DB3HY332LGKT/bundle.json","state_url":"https://pith.science/pith/FBPCPMZKMZNY34DB3HY332LGKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBPCPMZKMZNY34DB3HY332LGKT/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-10T16:00:57Z","links":{"resolver":"https://pith.science/pith/FBPCPMZKMZNY34DB3HY332LGKT","bundle":"https://pith.science/pith/FBPCPMZKMZNY34DB3HY332LGKT/bundle.json","state":"https://pith.science/pith/FBPCPMZKMZNY34DB3HY332LGKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBPCPMZKMZNY34DB3HY332LGKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FBPCPMZKMZNY34DB3HY332LGKT","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":"6be166a12a3c2b7dac0990b837daa885ed9601e7b93f2c1d30b1e6ce5ea6ef14","cross_cats_sorted":["cs.SY","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-10T13:51:31Z","title_canon_sha256":"f8687550553daab0d58fb1e6d77cd7f5897f17d589832d1ef87f9b3db134ce11"},"schema_version":"1.0","source":{"id":"1605.03017","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03017","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03017v3","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03017","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"FBPCPMZKMZNY","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FBPCPMZKMZNY34DB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FBPCPMZK","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:385a532fafc907239fa07e9e3febcff1879177dd01e3bdfa499306699a3d45e0","target":"graph","created_at":"2026-05-18T01:10:19Z","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 manuscript a factor graph approach is employed to investigate the recursive filtering problem for a mixed linear/nonlinear state-space model, i.e. for a model whose state vector can be partitioned in a linear state variable (characterized by conditionally linear dynamics) and a non linear state variable. Our approach allows us to show that: a) the factor graph characterizing the considered filtering problem is not cycle free; b) in the case of conditionally linear Gaussian systems, applying the sum-product rule, together with different scheduling procedures for message passing, to this","authors_text":"Emilio Sirignano, Francesco Montorsi, Giorgio M. Vitetta, Matteo Sola","cross_cats":["cs.SY","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-10T13:51:31Z","title":"Marginalized Particle Filtering and Related Filtering Techniques as Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03017","kind":"arxiv","version":3},"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:6f69592d9a63499d8aba4751302678e4ad32b9ba9b69418e766fa7a4af52db67","target":"record","created_at":"2026-05-18T01:10:19Z","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":"6be166a12a3c2b7dac0990b837daa885ed9601e7b93f2c1d30b1e6ce5ea6ef14","cross_cats_sorted":["cs.SY","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-10T13:51:31Z","title_canon_sha256":"f8687550553daab0d58fb1e6d77cd7f5897f17d589832d1ef87f9b3db134ce11"},"schema_version":"1.0","source":{"id":"1605.03017","kind":"arxiv","version":3}},"canonical_sha256":"285e27b32a665b8df061d9f1bde96654cf6c2191f36a1d9c7c91271a66fad7b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"285e27b32a665b8df061d9f1bde96654cf6c2191f36a1d9c7c91271a66fad7b7","first_computed_at":"2026-05-18T01:10:19.830283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:19.830283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xt88gdcGOLaNhHpm/iaZ5pEK1JK+Aiw5/0gZJdv37qN4n0YWebNKH8Pe//luKDZyax2/CKNl2tzXfSCAFCkcAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:19.830710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03017","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f69592d9a63499d8aba4751302678e4ad32b9ba9b69418e766fa7a4af52db67","sha256:385a532fafc907239fa07e9e3febcff1879177dd01e3bdfa499306699a3d45e0"],"state_sha256":"0e7eb7f95f8ac0814c68d2544feea1a2aa777b73830bff0ccc96a0e850f49ba6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YE9Ep4Qdkft9IYVvkIhd2U8d3O6ryJDEV0UmMVYuVBXouCxG+YGYEdedd8pYwXc9J1sm2PzOD6p5ri8y6g5tBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:00:57.003562Z","bundle_sha256":"7492997252002fa5c7d6b539b69e4a8e91a131d998dc860de66ab20be4e9f913"}}