{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:AR2UAYQR7SLGYX5VPCVYBGJT4L","short_pith_number":"pith:AR2UAYQR","canonical_record":{"source":{"id":"2211.06962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-13T17:13:12Z","cross_cats_sorted":["cs.AI","math.IT"],"title_canon_sha256":"db6aebfa59aa64d41821ac299e46a57e3fc027f9467106dffa87bb8f4ade9ad0","abstract_canon_sha256":"18815c0efd2be769d665f4a4b6356dc2f4bcbb5850c038a6b8677088453f648a"},"schema_version":"1.0"},"canonical_sha256":"0475406211fc966c5fb578ab809933e2d7062b2b3434bb71ff54d7d429626fb0","source":{"kind":"arxiv","id":"2211.06962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.06962","created_at":"2026-07-05T05:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"2211.06962v1","created_at":"2026-07-05T05:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06962","created_at":"2026-07-05T05:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"AR2UAYQR7SLG","created_at":"2026-07-05T05:15:47Z"},{"alias_kind":"pith_short_16","alias_value":"AR2UAYQR7SLGYX5V","created_at":"2026-07-05T05:15:47Z"},{"alias_kind":"pith_short_8","alias_value":"AR2UAYQR","created_at":"2026-07-05T05:15:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:AR2UAYQR7SLGYX5VPCVYBGJT4L","target":"record","payload":{"canonical_record":{"source":{"id":"2211.06962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-13T17:13:12Z","cross_cats_sorted":["cs.AI","math.IT"],"title_canon_sha256":"db6aebfa59aa64d41821ac299e46a57e3fc027f9467106dffa87bb8f4ade9ad0","abstract_canon_sha256":"18815c0efd2be769d665f4a4b6356dc2f4bcbb5850c038a6b8677088453f648a"},"schema_version":"1.0"},"canonical_sha256":"0475406211fc966c5fb578ab809933e2d7062b2b3434bb71ff54d7d429626fb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:15:47.913350Z","signature_b64":"+G7hnXVWjedy29ufxBPGw8ie0K/j7gxPOcoN1e4bvlETyUb31bj85NReqvI1tMbhGN1po1dTuHFIWLfAACI8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0475406211fc966c5fb578ab809933e2d7062b2b3434bb71ff54d7d429626fb0","last_reissued_at":"2026-07-05T05:15:47.912931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:15:47.912931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.06962","source_version":1,"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-05T05:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNXP6VhSm17Q8fMVfNEBTmU5Qb+E43RK6CdZN6WFxypa2itciLVYQTPexsY5xeAl7vE+g95tCS8V+Re181mDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:51:30.563901Z"},"content_sha256":"1cbc311d5cde2b47320e66e5c90a9017e86200b8ad935efde9c04924356e135b","schema_version":"1.0","event_id":"sha256:1cbc311d5cde2b47320e66e5c90a9017e86200b8ad935efde9c04924356e135b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:AR2UAYQR7SLGYX5VPCVYBGJT4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Scalable Graph Neural Network Decoder for Short Block Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Changyang She, Chentao Yue, Kou Tian, Yonghui Li","submitted_at":"2022-11-13T17:13:12Z","abstract_excerpt":"In this work, we propose a novel decoding algorithm for short block codes based on an edge-weighted graph neural network (EW-GNN). The EW-GNN decoder operates on the Tanner graph with an iterative message-passing structure, which algorithmically aligns with the conventional belief propagation (BP) decoding method. In each iteration, the \"weight\" on the message passed along each edge is obtained from a fully connected neural network that has the reliability information from nodes/edges as its input. Compared to existing deep-learning-based decoding schemes, the EW-GNN decoder is characterised b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.06962","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/2211.06962/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-05T05:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BShXGLq+VuZgRkIawFriMJaE6DwsE2cmE/IGPs5bpH6RSDd4OrziHEx7uWRaBADnFszsG0MXNG2OuaH/5yF4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:51:30.564568Z"},"content_sha256":"b6a6e3ff0905b67b9bc2b47fb3b62725a1032b1eb3f91ed454c20ef0ba4e850d","schema_version":"1.0","event_id":"sha256:b6a6e3ff0905b67b9bc2b47fb3b62725a1032b1eb3f91ed454c20ef0ba4e850d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AR2UAYQR7SLGYX5VPCVYBGJT4L/bundle.json","state_url":"https://pith.science/pith/AR2UAYQR7SLGYX5VPCVYBGJT4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AR2UAYQR7SLGYX5VPCVYBGJT4L/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-12T22:51:30Z","links":{"resolver":"https://pith.science/pith/AR2UAYQR7SLGYX5VPCVYBGJT4L","bundle":"https://pith.science/pith/AR2UAYQR7SLGYX5VPCVYBGJT4L/bundle.json","state":"https://pith.science/pith/AR2UAYQR7SLGYX5VPCVYBGJT4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AR2UAYQR7SLGYX5VPCVYBGJT4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:AR2UAYQR7SLGYX5VPCVYBGJT4L","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":"18815c0efd2be769d665f4a4b6356dc2f4bcbb5850c038a6b8677088453f648a","cross_cats_sorted":["cs.AI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-13T17:13:12Z","title_canon_sha256":"db6aebfa59aa64d41821ac299e46a57e3fc027f9467106dffa87bb8f4ade9ad0"},"schema_version":"1.0","source":{"id":"2211.06962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.06962","created_at":"2026-07-05T05:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"2211.06962v1","created_at":"2026-07-05T05:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06962","created_at":"2026-07-05T05:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"AR2UAYQR7SLG","created_at":"2026-07-05T05:15:47Z"},{"alias_kind":"pith_short_16","alias_value":"AR2UAYQR7SLGYX5V","created_at":"2026-07-05T05:15:47Z"},{"alias_kind":"pith_short_8","alias_value":"AR2UAYQR","created_at":"2026-07-05T05:15:47Z"}],"graph_snapshots":[{"event_id":"sha256:b6a6e3ff0905b67b9bc2b47fb3b62725a1032b1eb3f91ed454c20ef0ba4e850d","target":"graph","created_at":"2026-07-05T05:15:47Z","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/2211.06962/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we propose a novel decoding algorithm for short block codes based on an edge-weighted graph neural network (EW-GNN). The EW-GNN decoder operates on the Tanner graph with an iterative message-passing structure, which algorithmically aligns with the conventional belief propagation (BP) decoding method. In each iteration, the \"weight\" on the message passed along each edge is obtained from a fully connected neural network that has the reliability information from nodes/edges as its input. Compared to existing deep-learning-based decoding schemes, the EW-GNN decoder is characterised b","authors_text":"Branka Vucetic, Changyang She, Chentao Yue, Kou Tian, Yonghui Li","cross_cats":["cs.AI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-13T17:13:12Z","title":"A Scalable Graph Neural Network Decoder for Short Block Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.06962","kind":"arxiv","version":1},"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:1cbc311d5cde2b47320e66e5c90a9017e86200b8ad935efde9c04924356e135b","target":"record","created_at":"2026-07-05T05:15:47Z","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":"18815c0efd2be769d665f4a4b6356dc2f4bcbb5850c038a6b8677088453f648a","cross_cats_sorted":["cs.AI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-13T17:13:12Z","title_canon_sha256":"db6aebfa59aa64d41821ac299e46a57e3fc027f9467106dffa87bb8f4ade9ad0"},"schema_version":"1.0","source":{"id":"2211.06962","kind":"arxiv","version":1}},"canonical_sha256":"0475406211fc966c5fb578ab809933e2d7062b2b3434bb71ff54d7d429626fb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0475406211fc966c5fb578ab809933e2d7062b2b3434bb71ff54d7d429626fb0","first_computed_at":"2026-07-05T05:15:47.912931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:15:47.912931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+G7hnXVWjedy29ufxBPGw8ie0K/j7gxPOcoN1e4bvlETyUb31bj85NReqvI1tMbhGN1po1dTuHFIWLfAACI8CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:15:47.913350Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.06962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cbc311d5cde2b47320e66e5c90a9017e86200b8ad935efde9c04924356e135b","sha256:b6a6e3ff0905b67b9bc2b47fb3b62725a1032b1eb3f91ed454c20ef0ba4e850d"],"state_sha256":"c9e7532a795b48e7d8193279b5679cdfe7e3b9905480abd127c4c4b9156fbaa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+zRMdjHiXdDMU+2hDeJS9n9TeBV2IInBESjcK5W2kdAv2oeBjxNPV8OLuDJ6BMRk8LngBncU06PLZGIDYIDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T22:51:30.567235Z","bundle_sha256":"3d8e19187925d06d78e820d23c57046c4c9ec2a2dc162ee787c9d3e73154b427"}}