{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QZAK63RYXADT6BWO5ODRCJYFK6","short_pith_number":"pith:QZAK63RY","canonical_record":{"source":{"id":"2401.12627","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-23T10:26:15Z","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"title_canon_sha256":"c23a2615fe636d49acdacdb1a9cba6be1a5de9d23b58be62ab230d14e8dbdfa1","abstract_canon_sha256":"b1b2c2b285c7b3052875687cadaed8015883b94ea9082caf050c7f983c59d09d"},"schema_version":"1.0"},"canonical_sha256":"8640af6e38b8073f06ceeb87112705579dfed5dfc9a0ae495343a9ad79bffd35","source":{"kind":"arxiv","id":"2401.12627","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.12627","created_at":"2026-07-05T10:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"2401.12627v2","created_at":"2026-07-05T10:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.12627","created_at":"2026-07-05T10:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"QZAK63RYXADT","created_at":"2026-07-05T10:08:13Z"},{"alias_kind":"pith_short_16","alias_value":"QZAK63RYXADT6BWO","created_at":"2026-07-05T10:08:13Z"},{"alias_kind":"pith_short_8","alias_value":"QZAK63RY","created_at":"2026-07-05T10:08:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QZAK63RYXADT6BWO5ODRCJYFK6","target":"record","payload":{"canonical_record":{"source":{"id":"2401.12627","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-23T10:26:15Z","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"title_canon_sha256":"c23a2615fe636d49acdacdb1a9cba6be1a5de9d23b58be62ab230d14e8dbdfa1","abstract_canon_sha256":"b1b2c2b285c7b3052875687cadaed8015883b94ea9082caf050c7f983c59d09d"},"schema_version":"1.0"},"canonical_sha256":"8640af6e38b8073f06ceeb87112705579dfed5dfc9a0ae495343a9ad79bffd35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:13.844230Z","signature_b64":"1b+MsZeVbdeluZA/z2EpgFRd1bZSt73dOBIbDnhv0y58RIz9YPQyIi63uHY7ikZU9S+hnhIoyOWM4CwpUGMpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8640af6e38b8073f06ceeb87112705579dfed5dfc9a0ae495343a9ad79bffd35","last_reissued_at":"2026-07-05T10:08:13.843782Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:13.843782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.12627","source_version":2,"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-07-05T10:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yy72DsB9zMEa0L/KqiAOqR/MlvowaL4oYaIOJY4nTJSppVwyw0QOGYnmXiDbnH4liagYVQEPRg9kLD3KLw0GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T23:05:39.378440Z"},"content_sha256":"7a92b567763b1f93ccc9eaec30b50c1d6247d4cb5f1937ff2f74f263f4973a47","schema_version":"1.0","event_id":"sha256:7a92b567763b1f93ccc9eaec30b50c1d6247d4cb5f1937ff2f74f263f4973a47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QZAK63RYXADT6BWO5ODRCJYFK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blind Channel Estimation and Joint Symbol Detection with Data-Driven Factor Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Laurent Schmalen, Luca Schmid, Nir Shlezinger, Tomer Raviv","submitted_at":"2024-01-23T10:26:15Z","abstract_excerpt":"We investigate the application of the factor graph framework for blind joint channel estimation and symbol detection on time-variant linear inter-symbol interference channels. In particular, we consider the expectation maximization (EM) algorithm for maximum likelihood estimation, which typically suffers from high complexity as it requires the computation of the symbol-wise posterior distributions in every iteration. We address this issue by efficiently approximating the posteriors using the belief propagation (BP) algorithm on a suitable factor graph. By interweaving the iterations of BP and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.12627","kind":"arxiv","version":2},"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/2401.12627/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"},"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-07-05T10:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qyal2iYUaZQ5SBxIS8YQXVNev7OTkY/uui0f8yOpinUYrVnfUJziS1KPbxEQAzcLTeDi9CdLZxE+Up0x38S2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T23:05:39.379017Z"},"content_sha256":"0cce094c77c2337308ea1c2b7f6172863fe847b626d5dcbbb0ecb4d29473ddff","schema_version":"1.0","event_id":"sha256:0cce094c77c2337308ea1c2b7f6172863fe847b626d5dcbbb0ecb4d29473ddff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZAK63RYXADT6BWO5ODRCJYFK6/bundle.json","state_url":"https://pith.science/pith/QZAK63RYXADT6BWO5ODRCJYFK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZAK63RYXADT6BWO5ODRCJYFK6/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-08-19T23:05:39Z","links":{"resolver":"https://pith.science/pith/QZAK63RYXADT6BWO5ODRCJYFK6","bundle":"https://pith.science/pith/QZAK63RYXADT6BWO5ODRCJYFK6/bundle.json","state":"https://pith.science/pith/QZAK63RYXADT6BWO5ODRCJYFK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZAK63RYXADT6BWO5ODRCJYFK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QZAK63RYXADT6BWO5ODRCJYFK6","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":"b1b2c2b285c7b3052875687cadaed8015883b94ea9082caf050c7f983c59d09d","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-23T10:26:15Z","title_canon_sha256":"c23a2615fe636d49acdacdb1a9cba6be1a5de9d23b58be62ab230d14e8dbdfa1"},"schema_version":"1.0","source":{"id":"2401.12627","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.12627","created_at":"2026-07-05T10:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"2401.12627v2","created_at":"2026-07-05T10:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.12627","created_at":"2026-07-05T10:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"QZAK63RYXADT","created_at":"2026-07-05T10:08:13Z"},{"alias_kind":"pith_short_16","alias_value":"QZAK63RYXADT6BWO","created_at":"2026-07-05T10:08:13Z"},{"alias_kind":"pith_short_8","alias_value":"QZAK63RY","created_at":"2026-07-05T10:08:13Z"}],"graph_snapshots":[{"event_id":"sha256:0cce094c77c2337308ea1c2b7f6172863fe847b626d5dcbbb0ecb4d29473ddff","target":"graph","created_at":"2026-07-05T10:08:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.12627/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the application of the factor graph framework for blind joint channel estimation and symbol detection on time-variant linear inter-symbol interference channels. In particular, we consider the expectation maximization (EM) algorithm for maximum likelihood estimation, which typically suffers from high complexity as it requires the computation of the symbol-wise posterior distributions in every iteration. We address this issue by efficiently approximating the posteriors using the belief propagation (BP) algorithm on a suitable factor graph. By interweaving the iterations of BP and ","authors_text":"Laurent Schmalen, Luca Schmid, Nir Shlezinger, Tomer Raviv","cross_cats":["cs.LG","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-23T10:26:15Z","title":"Blind Channel Estimation and Joint Symbol Detection with Data-Driven Factor Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.12627","kind":"arxiv","version":2},"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:7a92b567763b1f93ccc9eaec30b50c1d6247d4cb5f1937ff2f74f263f4973a47","target":"record","created_at":"2026-07-05T10:08:13Z","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":"b1b2c2b285c7b3052875687cadaed8015883b94ea9082caf050c7f983c59d09d","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-23T10:26:15Z","title_canon_sha256":"c23a2615fe636d49acdacdb1a9cba6be1a5de9d23b58be62ab230d14e8dbdfa1"},"schema_version":"1.0","source":{"id":"2401.12627","kind":"arxiv","version":2}},"canonical_sha256":"8640af6e38b8073f06ceeb87112705579dfed5dfc9a0ae495343a9ad79bffd35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8640af6e38b8073f06ceeb87112705579dfed5dfc9a0ae495343a9ad79bffd35","first_computed_at":"2026-07-05T10:08:13.843782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:13.843782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1b+MsZeVbdeluZA/z2EpgFRd1bZSt73dOBIbDnhv0y58RIz9YPQyIi63uHY7ikZU9S+hnhIoyOWM4CwpUGMpCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:13.844230Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.12627","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a92b567763b1f93ccc9eaec30b50c1d6247d4cb5f1937ff2f74f263f4973a47","sha256:0cce094c77c2337308ea1c2b7f6172863fe847b626d5dcbbb0ecb4d29473ddff"],"state_sha256":"29fb8d113b95301353b2b3ca93d67a399052e5484b5a8f60401e1c439657ea32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cbh2BgqAfSOLfcyFRC2CXmoBTZ75eS16/u4O8xSBMrJNAb7GOgFS+x8A8H4Ga7q+QLuvjMDhkU6CjPcijt7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T23:05:39.383251Z","bundle_sha256":"33a73082ad6657195732191433df75a7e315d5b31a6485474dda1a025598e590"}}