{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WIW336ZED2MIMIC2255GP3UCEI","short_pith_number":"pith:WIW336ZE","schema_version":"1.0","canonical_sha256":"b22dbdfb241e9886205ad77a67ee82220b640ac2e72fa8a46c4ff05571372eea","source":{"kind":"arxiv","id":"1409.0599","version":1},"attestation_state":"computed","paper":{"title":"On Decoding of DVR-Based Linear Network Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qifu Tyler Sun, Shuo-Yen Robert Li","submitted_at":"2014-09-02T03:24:11Z","abstract_excerpt":"The conventional theory of linear network coding (LNC) is only over acyclic networks. Convolutional network coding (CNC) applies to all networks. It is also a form of LNC, but the linearity is w.r.t. the ring of rational power series rather than the field of data symbols. CNC has been generalized to LNC w.r.t. any discrete valuation ring (DVR) in order for flexibility in applications. For a causal DVR-based code, all possible source-generated messages form a free module, while incoming coding vectors to a receiver span the \\emph{received submodule}. An existing \\emph{time-invariant decoding} a"},"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":"1409.0599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-02T03:24:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"29b494f47461a182b5002132fcaa3e72f8abb190962a4bf4b5db316af6ae1e44","abstract_canon_sha256":"c9b125f3366f2c1e8d0c59c7131850d4b252530cf9941f5eb16732189bec0266"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:04.327552Z","signature_b64":"rAg/ox6qenfbGiw0rsWjYnvDDtv6Ip649MaetNcgysgD06zMSzgRbNOIZDdJJq4Ljg9p4nIzC/sIGJcBHt6eCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22dbdfb241e9886205ad77a67ee82220b640ac2e72fa8a46c4ff05571372eea","last_reissued_at":"2026-05-18T01:04:04.327133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:04.327133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Decoding of DVR-Based Linear Network Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qifu Tyler Sun, Shuo-Yen Robert Li","submitted_at":"2014-09-02T03:24:11Z","abstract_excerpt":"The conventional theory of linear network coding (LNC) is only over acyclic networks. Convolutional network coding (CNC) applies to all networks. It is also a form of LNC, but the linearity is w.r.t. the ring of rational power series rather than the field of data symbols. CNC has been generalized to LNC w.r.t. any discrete valuation ring (DVR) in order for flexibility in applications. For a causal DVR-based code, all possible source-generated messages form a free module, while incoming coding vectors to a receiver span the \\emph{received submodule}. An existing \\emph{time-invariant decoding} a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0599","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.0599","created_at":"2026-05-18T01:04:04.327190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0599v1","created_at":"2026-05-18T01:04:04.327190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0599","created_at":"2026-05-18T01:04:04.327190+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIW336ZED2MI","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIW336ZED2MIMIC2","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIW336ZE","created_at":"2026-05-18T12:28:54.890064+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/WIW336ZED2MIMIC2255GP3UCEI","json":"https://pith.science/pith/WIW336ZED2MIMIC2255GP3UCEI.json","graph_json":"https://pith.science/api/pith-number/WIW336ZED2MIMIC2255GP3UCEI/graph.json","events_json":"https://pith.science/api/pith-number/WIW336ZED2MIMIC2255GP3UCEI/events.json","paper":"https://pith.science/paper/WIW336ZE"},"agent_actions":{"view_html":"https://pith.science/pith/WIW336ZED2MIMIC2255GP3UCEI","download_json":"https://pith.science/pith/WIW336ZED2MIMIC2255GP3UCEI.json","view_paper":"https://pith.science/paper/WIW336ZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0599&json=true","fetch_graph":"https://pith.science/api/pith-number/WIW336ZED2MIMIC2255GP3UCEI/graph.json","fetch_events":"https://pith.science/api/pith-number/WIW336ZED2MIMIC2255GP3UCEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIW336ZED2MIMIC2255GP3UCEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIW336ZED2MIMIC2255GP3UCEI/action/storage_attestation","attest_author":"https://pith.science/pith/WIW336ZED2MIMIC2255GP3UCEI/action/author_attestation","sign_citation":"https://pith.science/pith/WIW336ZED2MIMIC2255GP3UCEI/action/citation_signature","submit_replication":"https://pith.science/pith/WIW336ZED2MIMIC2255GP3UCEI/action/replication_record"}},"created_at":"2026-05-18T01:04:04.327190+00:00","updated_at":"2026-05-18T01:04:04.327190+00:00"}