{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LCSZR64RKA2M7LKAD3TE5ONH3Z","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":"8bbd5004435ba6b943b36ca82001c415fef2778c757a3dcfdb1d6071bad8ddb0","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-15T15:40:42Z","title_canon_sha256":"ce588f8a439a2f23958d554b7eb229d60b3b7591bc3fc14fd83abee6e23c651a"},"schema_version":"1.0","source":{"id":"2501.08871","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.08871","created_at":"2026-07-05T11:37:14Z"},{"alias_kind":"arxiv_version","alias_value":"2501.08871v3","created_at":"2026-07-05T11:37:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08871","created_at":"2026-07-05T11:37:14Z"},{"alias_kind":"pith_short_12","alias_value":"LCSZR64RKA2M","created_at":"2026-07-05T11:37:14Z"},{"alias_kind":"pith_short_16","alias_value":"LCSZR64RKA2M7LKA","created_at":"2026-07-05T11:37:14Z"},{"alias_kind":"pith_short_8","alias_value":"LCSZR64R","created_at":"2026-07-05T11:37:14Z"}],"graph_snapshots":[{"event_id":"sha256:d8c87cd056f6eaf9e4056c95bf1781658fa3240392b862929bce29961678278e","target":"graph","created_at":"2026-07-05T11:37:14Z","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/2501.08871/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Narrowing the performance gap between optimal and feasible detection in inter-symbol interference (ISI) channels, this paper proposes to use graph neural networks (GNNs) for detection that can also be used to perform joint detection and decoding (JDD). For detection, the GNN is build upon the factor graph representations of the channel, while for JDD, the factor graph is expanded by the Tanner graph of the parity-check matrix (PCM) of the channel code, sharing the variable nodes (VNs). A particularly advantageous property of the GNN is a) the robustness against cycles in the factor graphs whic","authors_text":"Daniel Tandler, Jannis Clausius, Marvin R\\\"ubenacke, Stephan ten Brink","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-15T15:40:42Z","title":"Joint Detection and Decoding: A Graph Neural Network Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08871","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:c4b2c25ec41ff06719ad7afd037a4bee4641418e1100fbabfd28191ecf4924d3","target":"record","created_at":"2026-07-05T11:37:14Z","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":"8bbd5004435ba6b943b36ca82001c415fef2778c757a3dcfdb1d6071bad8ddb0","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-15T15:40:42Z","title_canon_sha256":"ce588f8a439a2f23958d554b7eb229d60b3b7591bc3fc14fd83abee6e23c651a"},"schema_version":"1.0","source":{"id":"2501.08871","kind":"arxiv","version":3}},"canonical_sha256":"58a598fb915034cfad401ee64eb9a7de6aa46884bc7fc7594179181e662a9eb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58a598fb915034cfad401ee64eb9a7de6aa46884bc7fc7594179181e662a9eb5","first_computed_at":"2026-07-05T11:37:14.934891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:14.934891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6DLUP1xsxzqZ5RefcUEy/sad/LT3bXOUMfhqzeEGi0sBdIu7QEkIlgVpO5Q9gwuT24VXSrSgdPGf9kuFj9DoCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:14.935404Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.08871","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4b2c25ec41ff06719ad7afd037a4bee4641418e1100fbabfd28191ecf4924d3","sha256:d8c87cd056f6eaf9e4056c95bf1781658fa3240392b862929bce29961678278e"],"state_sha256":"dc1fa129ea11dcca57a5c0b300f1844c74c26c1da7848e9b1e43c0a82f96a9b1"}