{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BVJBFWSI6HJRAP7VK6UBCTHSZN","short_pith_number":"pith:BVJBFWSI","schema_version":"1.0","canonical_sha256":"0d5212da48f1d3103ff557a8114cf2cb5e35548222b071300e10885b59d497a2","source":{"kind":"arxiv","id":"1307.7138","version":3},"attestation_state":"computed","paper":{"title":"Reconstruction of Network Coded Sources From Incomplete Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eirina Bourtsoulatze, Nikolaos Thomos, Pascal Frossard","submitted_at":"2013-07-26T19:53:44Z","abstract_excerpt":"In this paper, we investigate the problem of recovering source information from an incomplete set of network coded data. We first study the theoretical performance of such systems under maximum a posteriori (MAP) decoding and derive the upper bound on the probability of decoding error as a function of the system parameters. We also establish the sufficient conditions on the number of network coded symbols required to achieve decoding error probability below a certain level. We then propose a low complexity iterative decoding algorithm based on message passing for decoding the network coded dat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1307.7138","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-26T19:53:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6629ba84c29bdcd06194f9d01bf53f19ff844a47e6eb33bbf1d8f31a0694a95c","abstract_canon_sha256":"f8cf829bac7603e618103d24358d876c4d0a593b5acd58f76c366d905f4ceddb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:58.902163Z","signature_b64":"cOXzzrLEDSORQa967MS08o9ksR6Ve3C1QHsIPULZEn52h0v4XmbYHXfrSwd5irEUkUsekuvFP0xqh67xZ2CnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d5212da48f1d3103ff557a8114cf2cb5e35548222b071300e10885b59d497a2","last_reissued_at":"2026-05-18T02:23:58.901580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:58.901580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstruction of Network Coded Sources From Incomplete Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eirina Bourtsoulatze, Nikolaos Thomos, Pascal Frossard","submitted_at":"2013-07-26T19:53:44Z","abstract_excerpt":"In this paper, we investigate the problem of recovering source information from an incomplete set of network coded data. We first study the theoretical performance of such systems under maximum a posteriori (MAP) decoding and derive the upper bound on the probability of decoding error as a function of the system parameters. We also establish the sufficient conditions on the number of network coded symbols required to achieve decoding error probability below a certain level. We then propose a low complexity iterative decoding algorithm based on message passing for decoding the network coded dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7138","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.7138","created_at":"2026-05-18T02:23:58.901656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7138v3","created_at":"2026-05-18T02:23:58.901656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7138","created_at":"2026-05-18T02:23:58.901656+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVJBFWSI6HJR","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVJBFWSI6HJRAP7V","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVJBFWSI","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BVJBFWSI6HJRAP7VK6UBCTHSZN","json":"https://pith.science/pith/BVJBFWSI6HJRAP7VK6UBCTHSZN.json","graph_json":"https://pith.science/api/pith-number/BVJBFWSI6HJRAP7VK6UBCTHSZN/graph.json","events_json":"https://pith.science/api/pith-number/BVJBFWSI6HJRAP7VK6UBCTHSZN/events.json","paper":"https://pith.science/paper/BVJBFWSI"},"agent_actions":{"view_html":"https://pith.science/pith/BVJBFWSI6HJRAP7VK6UBCTHSZN","download_json":"https://pith.science/pith/BVJBFWSI6HJRAP7VK6UBCTHSZN.json","view_paper":"https://pith.science/paper/BVJBFWSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7138&json=true","fetch_graph":"https://pith.science/api/pith-number/BVJBFWSI6HJRAP7VK6UBCTHSZN/graph.json","fetch_events":"https://pith.science/api/pith-number/BVJBFWSI6HJRAP7VK6UBCTHSZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVJBFWSI6HJRAP7VK6UBCTHSZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVJBFWSI6HJRAP7VK6UBCTHSZN/action/storage_attestation","attest_author":"https://pith.science/pith/BVJBFWSI6HJRAP7VK6UBCTHSZN/action/author_attestation","sign_citation":"https://pith.science/pith/BVJBFWSI6HJRAP7VK6UBCTHSZN/action/citation_signature","submit_replication":"https://pith.science/pith/BVJBFWSI6HJRAP7VK6UBCTHSZN/action/replication_record"}},"created_at":"2026-05-18T02:23:58.901656+00:00","updated_at":"2026-05-18T02:23:58.901656+00:00"}