{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WJOJSAG6EY5F4EZ57NP5I2KS2Y","short_pith_number":"pith:WJOJSAG6","schema_version":"1.0","canonical_sha256":"b25c9900de263a5e133dfb5fd46952d61f6654ec07da6eef1ec727ea6e2ad3a5","source":{"kind":"arxiv","id":"2207.04984","version":1},"attestation_state":"computed","paper":{"title":"Belief Propagation with Quantum Messages for Symmetric Classical-Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Avijit Mandal, Henry D. Pfister, S. Brandsen","submitted_at":"2022-07-11T16:14:49Z","abstract_excerpt":"Belief propagation (BP) is a classical algorithm that approximates the marginal distribution associated with a factor graph by passing messages between adjacent nodes in the graph. It gained popularity in the 1990's as a powerful decoding algorithm for LDPC codes. In 2016, Renes introduced a belief propagation with quantum messages (BPQM) and described how it could be used to decode classical codes defined by tree factor graphs that are sent over the classical-quantum pure-state channel. In this work, we propose an extension of BPQM to general binary-input symmetric classical-quantum (BSCQ) ch"},"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":"2207.04984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-07-11T16:14:49Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"5502c26374be053e7f4f38a78b0631d660b2749a8ef0a0cf44c7905d6bc4686a","abstract_canon_sha256":"e8830787190b9064165d78d2688f5838f28c8d8907f21430b2029ef4e6108f35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:39:05.792182Z","signature_b64":"KNutBEj9z2kJId1ZSEA4ittf4oWmpHlFaiORD851FtNkC6KuIf6/ST1UqwimnA3CHo9/qqVTLlBsjuhzrY2uCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b25c9900de263a5e133dfb5fd46952d61f6654ec07da6eef1ec727ea6e2ad3a5","last_reissued_at":"2026-07-05T04:39:05.791785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:39:05.791785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Belief Propagation with Quantum Messages for Symmetric Classical-Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Avijit Mandal, Henry D. Pfister, S. Brandsen","submitted_at":"2022-07-11T16:14:49Z","abstract_excerpt":"Belief propagation (BP) is a classical algorithm that approximates the marginal distribution associated with a factor graph by passing messages between adjacent nodes in the graph. It gained popularity in the 1990's as a powerful decoding algorithm for LDPC codes. In 2016, Renes introduced a belief propagation with quantum messages (BPQM) and described how it could be used to decode classical codes defined by tree factor graphs that are sent over the classical-quantum pure-state channel. In this work, we propose an extension of BPQM to general binary-input symmetric classical-quantum (BSCQ) ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.04984","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.04984/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.04984","created_at":"2026-07-05T04:39:05.791844+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.04984v1","created_at":"2026-07-05T04:39:05.791844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.04984","created_at":"2026-07-05T04:39:05.791844+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJOJSAG6EY5F","created_at":"2026-07-05T04:39:05.791844+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJOJSAG6EY5F4EZ5","created_at":"2026-07-05T04:39:05.791844+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJOJSAG6","created_at":"2026-07-05T04:39:05.791844+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13570","citing_title":"Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WJOJSAG6EY5F4EZ57NP5I2KS2Y","json":"https://pith.science/pith/WJOJSAG6EY5F4EZ57NP5I2KS2Y.json","graph_json":"https://pith.science/api/pith-number/WJOJSAG6EY5F4EZ57NP5I2KS2Y/graph.json","events_json":"https://pith.science/api/pith-number/WJOJSAG6EY5F4EZ57NP5I2KS2Y/events.json","paper":"https://pith.science/paper/WJOJSAG6"},"agent_actions":{"view_html":"https://pith.science/pith/WJOJSAG6EY5F4EZ57NP5I2KS2Y","download_json":"https://pith.science/pith/WJOJSAG6EY5F4EZ57NP5I2KS2Y.json","view_paper":"https://pith.science/paper/WJOJSAG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.04984&json=true","fetch_graph":"https://pith.science/api/pith-number/WJOJSAG6EY5F4EZ57NP5I2KS2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/WJOJSAG6EY5F4EZ57NP5I2KS2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJOJSAG6EY5F4EZ57NP5I2KS2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJOJSAG6EY5F4EZ57NP5I2KS2Y/action/storage_attestation","attest_author":"https://pith.science/pith/WJOJSAG6EY5F4EZ57NP5I2KS2Y/action/author_attestation","sign_citation":"https://pith.science/pith/WJOJSAG6EY5F4EZ57NP5I2KS2Y/action/citation_signature","submit_replication":"https://pith.science/pith/WJOJSAG6EY5F4EZ57NP5I2KS2Y/action/replication_record"}},"created_at":"2026-07-05T04:39:05.791844+00:00","updated_at":"2026-07-05T04:39:05.791844+00:00"}