{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5QJG33XO42VB4KOK5SIIC2WZQJ","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":"4f00cd7e68ec53cedec427eea4ac92e2bdc2e2770f066a0cf2bba8b8cd6f2d13","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T11:35:35Z","title_canon_sha256":"a8312b768fff70c22de9978e759534108c9d367e9273e7f5e8151cd0b8b3a9fd"},"schema_version":"1.0","source":{"id":"1510.03634","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03634","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03634v1","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03634","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"5QJG33XO42VB","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QJG33XO42VB4KOK","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QJG33XO","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:0e0ebc04ec848b3758421c35865af01bf2e2c42addf3b0933b9697c81da5be3c","target":"graph","created_at":"2026-05-18T01:30:16Z","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"},"paper":{"abstract_excerpt":"While feasibility and obtaining a solution of a given network coding problem are well studied, the decoding procedure and complexity have not garnered much attention. We consider the decoding problem in a network wherein the sources generate multiple messages and the sink nodes demand some or all of the source messages. We consider both linear and non-linear network codes over a finite field and propose to use the sum-product (SP) algorithm over Boolean semiring for decoding at the sink nodes in order to reduce the computational complexity. We use traceback to further lower the computational c","authors_text":"Anindya Gupta, B. Sundar Rajan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T11:35:35Z","title":"Decoding Network Codes using the Sum-Product Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03634","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:550175a1f989450860e830716b9ee4ac5d24ce32e05a064e10aa854afd82669e","target":"record","created_at":"2026-05-18T01:30:16Z","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":"4f00cd7e68ec53cedec427eea4ac92e2bdc2e2770f066a0cf2bba8b8cd6f2d13","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T11:35:35Z","title_canon_sha256":"a8312b768fff70c22de9978e759534108c9d367e9273e7f5e8151cd0b8b3a9fd"},"schema_version":"1.0","source":{"id":"1510.03634","kind":"arxiv","version":1}},"canonical_sha256":"ec126deeeee6aa1e29caec90816ad98262279d44f46cd4e52cec789df241fdf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec126deeeee6aa1e29caec90816ad98262279d44f46cd4e52cec789df241fdf1","first_computed_at":"2026-05-18T01:30:16.610697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:16.610697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"76Utx7MUR8lpbDjNDiEE/ohkgOQu/py4UL/CrCa4vydfiIEj4AnKVleFo2pTgEXl8FJTdPu9e1AC/IXu8gKWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:16.611385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03634","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:550175a1f989450860e830716b9ee4ac5d24ce32e05a064e10aa854afd82669e","sha256:0e0ebc04ec848b3758421c35865af01bf2e2c42addf3b0933b9697c81da5be3c"],"state_sha256":"e6054dba8fb589c11de1a6dfc979dcd62cfe403a3c378f42bc940be155a828af"}