{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OKNBRNLX2DL6KVN6I7HD4SB7WO","short_pith_number":"pith:OKNBRNLX","canonical_record":{"source":{"id":"1601.04122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-16T04:25:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"801168cea6f6fa28ea16c9755aabbe5429f05fea4568fd06642e41aad08f71d6","abstract_canon_sha256":"4f8bf41a915cd0beaa4a6a3f8247f6f4c2ced084b9a59ef43b3f50116780d86d"},"schema_version":"1.0"},"canonical_sha256":"729a18b577d0d7e555be47ce3e483fb39d1110be013dc45fe7ef909dd0dff597","source":{"kind":"arxiv","id":"1601.04122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04122","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04122v1","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04122","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"OKNBRNLX2DL6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OKNBRNLX2DL6KVN6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OKNBRNLX","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OKNBRNLX2DL6KVN6I7HD4SB7WO","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-16T04:25:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"801168cea6f6fa28ea16c9755aabbe5429f05fea4568fd06642e41aad08f71d6","abstract_canon_sha256":"4f8bf41a915cd0beaa4a6a3f8247f6f4c2ced084b9a59ef43b3f50116780d86d"},"schema_version":"1.0"},"canonical_sha256":"729a18b577d0d7e555be47ce3e483fb39d1110be013dc45fe7ef909dd0dff597","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:45.845808Z","signature_b64":"QSCZU5Nx8f/Ym+nX/Dw9Suk5pBNLPv+DOt5DLbnik+02Z1wMFeRkauAtHlZPIDSFKnrmu6fCSUxIvKvHVBUbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"729a18b577d0d7e555be47ce3e483fb39d1110be013dc45fe7ef909dd0dff597","last_reissued_at":"2026-05-18T01:22:45.845220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:45.845220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04122","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-05-18T01:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4F7KdLqXoyerc/zqSefrpH1F4/JXWtpocv1Mf/zPIkBoyGh+88FajeTPWkDq2tJoN4X+FDlKxIrBy5WUUn2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:52:12.047823Z"},"content_sha256":"612dd5a7a0d5dffa6601e8c7946fd8dd24221e26aea6cb344fcf5859c7ab59f6","schema_version":"1.0","event_id":"sha256:612dd5a7a0d5dffa6601e8c7946fd8dd24221e26aea6cb344fcf5859c7ab59f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OKNBRNLX2DL6KVN6I7HD4SB7WO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduced Complexity Sum-Product Algorithm for Decoding Network Codes and In-Network Function Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anindya Gupta, B. Sundar Rajan","submitted_at":"2016-01-16T04:25:15Z","abstract_excerpt":"While the capacity, feasibility and methods to obtain codes for network coding problems are well studied, the decoding procedure and complexity have not garnered much attention. In this work, we pose the decoding problem at a sink node in a network as a marginalize a product function (MPF) problem over a Boolean semiring and use the sum-product (SP) algorithm on a suitably constructed factor graph to perform iterative decoding. We use \\textit{traceback} to reduce the number of operations required for SP decoding at sink node with general demands and obtain the number of operations required for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04122","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":""},"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-05-18T01:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJXDTJnG9cFdFEMXAZRUkCPv/YMu+3ki4KCFY2F8A7h68OR5ojplqdHbsTXQlKqmAhyAeqthjT1Dt7T8WlGDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:52:12.048165Z"},"content_sha256":"96de8bc652ed6749fe181dafba1fc0098cfe7cdc64958dd9d75964bd25e5281b","schema_version":"1.0","event_id":"sha256:96de8bc652ed6749fe181dafba1fc0098cfe7cdc64958dd9d75964bd25e5281b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKNBRNLX2DL6KVN6I7HD4SB7WO/bundle.json","state_url":"https://pith.science/pith/OKNBRNLX2DL6KVN6I7HD4SB7WO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKNBRNLX2DL6KVN6I7HD4SB7WO/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-06-04T21:52:12Z","links":{"resolver":"https://pith.science/pith/OKNBRNLX2DL6KVN6I7HD4SB7WO","bundle":"https://pith.science/pith/OKNBRNLX2DL6KVN6I7HD4SB7WO/bundle.json","state":"https://pith.science/pith/OKNBRNLX2DL6KVN6I7HD4SB7WO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKNBRNLX2DL6KVN6I7HD4SB7WO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OKNBRNLX2DL6KVN6I7HD4SB7WO","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":"4f8bf41a915cd0beaa4a6a3f8247f6f4c2ced084b9a59ef43b3f50116780d86d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-16T04:25:15Z","title_canon_sha256":"801168cea6f6fa28ea16c9755aabbe5429f05fea4568fd06642e41aad08f71d6"},"schema_version":"1.0","source":{"id":"1601.04122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04122","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04122v1","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04122","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"OKNBRNLX2DL6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OKNBRNLX2DL6KVN6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OKNBRNLX","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:96de8bc652ed6749fe181dafba1fc0098cfe7cdc64958dd9d75964bd25e5281b","target":"graph","created_at":"2026-05-18T01:22:45Z","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 the capacity, feasibility and methods to obtain codes for network coding problems are well studied, the decoding procedure and complexity have not garnered much attention. In this work, we pose the decoding problem at a sink node in a network as a marginalize a product function (MPF) problem over a Boolean semiring and use the sum-product (SP) algorithm on a suitably constructed factor graph to perform iterative decoding. We use \\textit{traceback} to reduce the number of operations required for SP decoding at sink node with general demands and obtain the number of operations required for","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":"2016-01-16T04:25:15Z","title":"Reduced Complexity Sum-Product Algorithm for Decoding Network Codes and In-Network Function Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04122","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:612dd5a7a0d5dffa6601e8c7946fd8dd24221e26aea6cb344fcf5859c7ab59f6","target":"record","created_at":"2026-05-18T01:22:45Z","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":"4f8bf41a915cd0beaa4a6a3f8247f6f4c2ced084b9a59ef43b3f50116780d86d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-16T04:25:15Z","title_canon_sha256":"801168cea6f6fa28ea16c9755aabbe5429f05fea4568fd06642e41aad08f71d6"},"schema_version":"1.0","source":{"id":"1601.04122","kind":"arxiv","version":1}},"canonical_sha256":"729a18b577d0d7e555be47ce3e483fb39d1110be013dc45fe7ef909dd0dff597","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"729a18b577d0d7e555be47ce3e483fb39d1110be013dc45fe7ef909dd0dff597","first_computed_at":"2026-05-18T01:22:45.845220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:45.845220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QSCZU5Nx8f/Ym+nX/Dw9Suk5pBNLPv+DOt5DLbnik+02Z1wMFeRkauAtHlZPIDSFKnrmu6fCSUxIvKvHVBUbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:45.845808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:612dd5a7a0d5dffa6601e8c7946fd8dd24221e26aea6cb344fcf5859c7ab59f6","sha256:96de8bc652ed6749fe181dafba1fc0098cfe7cdc64958dd9d75964bd25e5281b"],"state_sha256":"c15d26966e971840d1c7af16ab905016b65c81b6969be169117a5560e0ad115c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7iKCELNkzK41gddkRCd4F2zVzSfdHh7avkpBaI7n6uDch5dDUdCRAShjgVezRfhIWVigsBqywSPRTfDG8fPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:52:12.050155Z","bundle_sha256":"82a845eaa4a2ba5d1ecb548b7aa1458822ffa06d052eafdd129e05954e5a6584"}}