{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:K6AKHCY3U6LEECVUJLGBKJIWQW","short_pith_number":"pith:K6AKHCY3","schema_version":"1.0","canonical_sha256":"5780a38b1ba796420ab44acc15251685abd225310ae186a7eedf68eb9e34a7a6","source":{"kind":"arxiv","id":"1302.4146","version":1},"attestation_state":"computed","paper":{"title":"Linear Network Error Correction Multicast/Broadcast/Dispersion Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Xuan Guang","submitted_at":"2013-02-18T01:49:25Z","abstract_excerpt":"In this paper, for the purposes of information transmission and network error correction simultaneously, three classes of important linear network codes in network coding, linear multicast/broadcast/dispersion codes are generalized to linear network error correction coding, i.e., linear network error correction multicast/broadcast/dispersion codes. We further propose the (weakly, strongly) extended Singleton bounds for these new classes of codes, and define the optimal codes satisfying the corresponding Singleton bounds with equality, which are called multicast/broadcast/dispersion MDS codes r"},"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":"1302.4146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-18T01:49:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5f3b5887d1336eedf295085040e9cf81daece014a369791b4edde260be08b3c6","abstract_canon_sha256":"968eb9bf013973d30628fc7f4acc318a8137d01454963f7e52a68882c04eaced"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:23.987559Z","signature_b64":"CjHWX4OmszSOc7BsIFVw8pSB1B+ezCImfOOuncmlpMYBBMchhuMf9qAhiYisbG/Vib18sfwmNJui0rArzLSfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5780a38b1ba796420ab44acc15251685abd225310ae186a7eedf68eb9e34a7a6","last_reissued_at":"2026-05-18T03:33:23.986836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:23.986836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Network Error Correction Multicast/Broadcast/Dispersion Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Xuan Guang","submitted_at":"2013-02-18T01:49:25Z","abstract_excerpt":"In this paper, for the purposes of information transmission and network error correction simultaneously, three classes of important linear network codes in network coding, linear multicast/broadcast/dispersion codes are generalized to linear network error correction coding, i.e., linear network error correction multicast/broadcast/dispersion codes. We further propose the (weakly, strongly) extended Singleton bounds for these new classes of codes, and define the optimal codes satisfying the corresponding Singleton bounds with equality, which are called multicast/broadcast/dispersion MDS codes r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4146","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":"1302.4146","created_at":"2026-05-18T03:33:23.986914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4146v1","created_at":"2026-05-18T03:33:23.986914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4146","created_at":"2026-05-18T03:33:23.986914+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6AKHCY3U6LE","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6AKHCY3U6LEECVU","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6AKHCY3","created_at":"2026-05-18T12:27:49.015174+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/K6AKHCY3U6LEECVUJLGBKJIWQW","json":"https://pith.science/pith/K6AKHCY3U6LEECVUJLGBKJIWQW.json","graph_json":"https://pith.science/api/pith-number/K6AKHCY3U6LEECVUJLGBKJIWQW/graph.json","events_json":"https://pith.science/api/pith-number/K6AKHCY3U6LEECVUJLGBKJIWQW/events.json","paper":"https://pith.science/paper/K6AKHCY3"},"agent_actions":{"view_html":"https://pith.science/pith/K6AKHCY3U6LEECVUJLGBKJIWQW","download_json":"https://pith.science/pith/K6AKHCY3U6LEECVUJLGBKJIWQW.json","view_paper":"https://pith.science/paper/K6AKHCY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4146&json=true","fetch_graph":"https://pith.science/api/pith-number/K6AKHCY3U6LEECVUJLGBKJIWQW/graph.json","fetch_events":"https://pith.science/api/pith-number/K6AKHCY3U6LEECVUJLGBKJIWQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6AKHCY3U6LEECVUJLGBKJIWQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6AKHCY3U6LEECVUJLGBKJIWQW/action/storage_attestation","attest_author":"https://pith.science/pith/K6AKHCY3U6LEECVUJLGBKJIWQW/action/author_attestation","sign_citation":"https://pith.science/pith/K6AKHCY3U6LEECVUJLGBKJIWQW/action/citation_signature","submit_replication":"https://pith.science/pith/K6AKHCY3U6LEECVUJLGBKJIWQW/action/replication_record"}},"created_at":"2026-05-18T03:33:23.986914+00:00","updated_at":"2026-05-18T03:33:23.986914+00:00"}