{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WVZPODAYCZ6ZESLCNI2TLSHCXQ","short_pith_number":"pith:WVZPODAY","schema_version":"1.0","canonical_sha256":"b572f70c18167d9249626a3535c8e2bc10ca7a0304ed323d016264b43de8ee2d","source":{"kind":"arxiv","id":"1302.4147","version":2},"attestation_state":"computed","paper":{"title":"The Failure Probability of Random Linear Network Coding for Networks","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-18T02:05:22Z","abstract_excerpt":"In practice, since many communication networks are huge in scale, or complicated in structure, or even dynamic, the predesigned linear network codes based on the network topology is impossible even if the topological structure is known. Therefore, random linear network coding has been proposed as an acceptable coding technique for the case that the network topology cannot be utilized completely. Motivated by the fact that different network topological information can be obtained for different practical applications, we study the performance analysis of random linear network coding by analyzing"},"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.4147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-18T02:05:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1130db1417f1b415b5f32dcb2fc9d4b38ca9cdb75d08c4040a75db7e1cd6dd02","abstract_canon_sha256":"38eff5e4ddb94a607dbd1395a5887b51ee49d6916ff5de89cc5f0414215182ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:44.279121Z","signature_b64":"crxSLSlBxK7/e5kvcYeNnZMifbqt3tjqR8x97dA53rju3yuuts1j6Z61CpSB8QT62bVjF0DEGwxXlrGSjC23BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b572f70c18167d9249626a3535c8e2bc10ca7a0304ed323d016264b43de8ee2d","last_reissued_at":"2026-05-18T03:32:44.278553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:44.278553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Failure Probability of Random Linear Network Coding for Networks","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-18T02:05:22Z","abstract_excerpt":"In practice, since many communication networks are huge in scale, or complicated in structure, or even dynamic, the predesigned linear network codes based on the network topology is impossible even if the topological structure is known. Therefore, random linear network coding has been proposed as an acceptable coding technique for the case that the network topology cannot be utilized completely. Motivated by the fact that different network topological information can be obtained for different practical applications, we study the performance analysis of random linear network coding by analyzing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4147","kind":"arxiv","version":2},"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.4147","created_at":"2026-05-18T03:32:44.278637+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4147v2","created_at":"2026-05-18T03:32:44.278637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4147","created_at":"2026-05-18T03:32:44.278637+00:00"},{"alias_kind":"pith_short_12","alias_value":"WVZPODAYCZ6Z","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"WVZPODAYCZ6ZESLC","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"WVZPODAY","created_at":"2026-05-18T12:28:06.772260+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/WVZPODAYCZ6ZESLCNI2TLSHCXQ","json":"https://pith.science/pith/WVZPODAYCZ6ZESLCNI2TLSHCXQ.json","graph_json":"https://pith.science/api/pith-number/WVZPODAYCZ6ZESLCNI2TLSHCXQ/graph.json","events_json":"https://pith.science/api/pith-number/WVZPODAYCZ6ZESLCNI2TLSHCXQ/events.json","paper":"https://pith.science/paper/WVZPODAY"},"agent_actions":{"view_html":"https://pith.science/pith/WVZPODAYCZ6ZESLCNI2TLSHCXQ","download_json":"https://pith.science/pith/WVZPODAYCZ6ZESLCNI2TLSHCXQ.json","view_paper":"https://pith.science/paper/WVZPODAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4147&json=true","fetch_graph":"https://pith.science/api/pith-number/WVZPODAYCZ6ZESLCNI2TLSHCXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WVZPODAYCZ6ZESLCNI2TLSHCXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WVZPODAYCZ6ZESLCNI2TLSHCXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WVZPODAYCZ6ZESLCNI2TLSHCXQ/action/storage_attestation","attest_author":"https://pith.science/pith/WVZPODAYCZ6ZESLCNI2TLSHCXQ/action/author_attestation","sign_citation":"https://pith.science/pith/WVZPODAYCZ6ZESLCNI2TLSHCXQ/action/citation_signature","submit_replication":"https://pith.science/pith/WVZPODAYCZ6ZESLCNI2TLSHCXQ/action/replication_record"}},"created_at":"2026-05-18T03:32:44.278637+00:00","updated_at":"2026-05-18T03:32:44.278637+00:00"}