{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NJPRKZGDU2VUIIVE2ZTPTLUHYQ","short_pith_number":"pith:NJPRKZGD","schema_version":"1.0","canonical_sha256":"6a5f1564c3a6ab4422a4d666f9ae87c437e1c409abaa28327c4ec7943e8650d9","source":{"kind":"arxiv","id":"1902.05717","version":1},"attestation_state":"computed","paper":{"title":"A New Smoothing Technique based on the Parallel Concatenation of Forward/Backward Bayesian Filters: Turbo Smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Emilio Sirignano, Giorgio M. Vitetta, Pasquale Di Viesti","submitted_at":"2019-02-15T08:21:22Z","abstract_excerpt":"Recently, a novel method for developing filtering algorithms, based on the parallel concatenation of Bayesian filters and called turbo filtering, has been proposed. In this manuscript we show how the same conceptual approach can be exploited to devise a new smoothing method, called turbo smoothing. A turbo smoother combines a turbo filter, employed in its forward pass, with the parallel concatenation of two backward information filters used in its backward pass. As a specific application of our general theory, a detailed derivation of two turbo smoothing algorithms for conditionally linear Gau"},"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":"1902.05717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-02-15T08:21:22Z","cross_cats_sorted":[],"title_canon_sha256":"eda378a78d4c81181afe23b8a9bbcb1a189340819f8c4b6f394479bd1bb9fac1","abstract_canon_sha256":"fe8f749102ee5cf924ed5066b1fa3fecd49590eea64b7107d562abae74e33faa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:56.371106Z","signature_b64":"GeLGXT7TXu9a4FguGBS1wZ79i4ncwUTvE5I+a+Fib9BQpePLuj9D2lx7MPPr9ab1JYdyCqZvJs1lS1WB3HgeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a5f1564c3a6ab4422a4d666f9ae87c437e1c409abaa28327c4ec7943e8650d9","last_reissued_at":"2026-05-17T23:53:56.370434Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:56.370434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Smoothing Technique based on the Parallel Concatenation of Forward/Backward Bayesian Filters: Turbo Smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Emilio Sirignano, Giorgio M. Vitetta, Pasquale Di Viesti","submitted_at":"2019-02-15T08:21:22Z","abstract_excerpt":"Recently, a novel method for developing filtering algorithms, based on the parallel concatenation of Bayesian filters and called turbo filtering, has been proposed. In this manuscript we show how the same conceptual approach can be exploited to devise a new smoothing method, called turbo smoothing. A turbo smoother combines a turbo filter, employed in its forward pass, with the parallel concatenation of two backward information filters used in its backward pass. As a specific application of our general theory, a detailed derivation of two turbo smoothing algorithms for conditionally linear Gau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05717","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":"1902.05717","created_at":"2026-05-17T23:53:56.370519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05717v1","created_at":"2026-05-17T23:53:56.370519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05717","created_at":"2026-05-17T23:53:56.370519+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJPRKZGDU2VU","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJPRKZGDU2VUIIVE","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJPRKZGD","created_at":"2026-05-18T12:33:24.271573+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/NJPRKZGDU2VUIIVE2ZTPTLUHYQ","json":"https://pith.science/pith/NJPRKZGDU2VUIIVE2ZTPTLUHYQ.json","graph_json":"https://pith.science/api/pith-number/NJPRKZGDU2VUIIVE2ZTPTLUHYQ/graph.json","events_json":"https://pith.science/api/pith-number/NJPRKZGDU2VUIIVE2ZTPTLUHYQ/events.json","paper":"https://pith.science/paper/NJPRKZGD"},"agent_actions":{"view_html":"https://pith.science/pith/NJPRKZGDU2VUIIVE2ZTPTLUHYQ","download_json":"https://pith.science/pith/NJPRKZGDU2VUIIVE2ZTPTLUHYQ.json","view_paper":"https://pith.science/paper/NJPRKZGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05717&json=true","fetch_graph":"https://pith.science/api/pith-number/NJPRKZGDU2VUIIVE2ZTPTLUHYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NJPRKZGDU2VUIIVE2ZTPTLUHYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJPRKZGDU2VUIIVE2ZTPTLUHYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJPRKZGDU2VUIIVE2ZTPTLUHYQ/action/storage_attestation","attest_author":"https://pith.science/pith/NJPRKZGDU2VUIIVE2ZTPTLUHYQ/action/author_attestation","sign_citation":"https://pith.science/pith/NJPRKZGDU2VUIIVE2ZTPTLUHYQ/action/citation_signature","submit_replication":"https://pith.science/pith/NJPRKZGDU2VUIIVE2ZTPTLUHYQ/action/replication_record"}},"created_at":"2026-05-17T23:53:56.370519+00:00","updated_at":"2026-05-17T23:53:56.370519+00:00"}