{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:N4LDZ5ABWGH7WXSKYXDLWLDDC2","short_pith_number":"pith:N4LDZ5AB","canonical_record":{"source":{"id":"1311.2123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-09T01:31:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1aaef4bb547f84f4602799ee476cc62489d4cdeacddb7f389811051e65237e8f","abstract_canon_sha256":"dc609129e772a100ed2a4563961e93c6fb655054b8ea3509ee05e20eb4b2ed43"},"schema_version":"1.0"},"canonical_sha256":"6f163cf401b18ffb5e4ac5c6bb2c6316a99f9bd81f11065b67419b0f491ff813","source":{"kind":"arxiv","id":"1311.2123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2123","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2123v1","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2123","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"N4LDZ5ABWGH7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N4LDZ5ABWGH7WXSK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N4LDZ5AB","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:N4LDZ5ABWGH7WXSKYXDLWLDDC2","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-09T01:31:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1aaef4bb547f84f4602799ee476cc62489d4cdeacddb7f389811051e65237e8f","abstract_canon_sha256":"dc609129e772a100ed2a4563961e93c6fb655054b8ea3509ee05e20eb4b2ed43"},"schema_version":"1.0"},"canonical_sha256":"6f163cf401b18ffb5e4ac5c6bb2c6316a99f9bd81f11065b67419b0f491ff813","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:33.481646Z","signature_b64":"fTB9Lj48L3CAFEm8eIJy+fDaXIxCxiGUfJPrD6hMEPoZqkPY3fNCMzcYmrFmDpuvgEiOOqt+eg+KHVwgBU9XDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f163cf401b18ffb5e4ac5c6bb2c6316a99f9bd81f11065b67419b0f491ff813","last_reissued_at":"2026-05-18T03:07:33.481251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:33.481251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2123","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-18T03:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBgcjl0atscjwEsOs7SsWeusiHsTC+m3BRLcLOOM6oJGw8iBKbJ/eYWZZsHRmf8EqBKFfHHhvPZ3HRo569VFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:35:06.271975Z"},"content_sha256":"27a2fa0d380397d7134d5f94a16d185fde472fa389d489e703768006166082b3","schema_version":"1.0","event_id":"sha256:27a2fa0d380397d7134d5f94a16d185fde472fa389d489e703768006166082b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:N4LDZ5ABWGH7WXSKYXDLWLDDC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-Complexity Overhead-Optimized Random Linear Network Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kaveh Mahdaviani, Masoud Ardakani, Raman Yazdani","submitted_at":"2013-11-09T01:31:48Z","abstract_excerpt":"Sparse random linear network coding (SRLNC) is an attractive technique proposed in the literature to reduce the decoding complexity of random linear network coding. Recognizing the fact that the existing SRLNC schemes are not efficient in terms of the required reception overhead, we consider the problem of designing overhead-optimized SRLNC schemes. To this end, we introduce a new design of SRLNC scheme that enjoys very small reception overhead while maintaining the main benefit of SRLNC, i.e., its linear encoding/decoding complexity. We also provide a mathematical framework for the asymptotic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2123","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-18T03:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E7jtCRRj/HS9aDy8rQUDqx6Xb4HikdxhIzAOjwkX8n+IVKTZ3KIvVckz6RubsHgl1ynf5wecHpmKiR3Zg1BoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:35:06.272705Z"},"content_sha256":"17f646b52cd2ad8683398a8566f5a3bcdf6e56624cdc76304236d040bc84d323","schema_version":"1.0","event_id":"sha256:17f646b52cd2ad8683398a8566f5a3bcdf6e56624cdc76304236d040bc84d323"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4LDZ5ABWGH7WXSKYXDLWLDDC2/bundle.json","state_url":"https://pith.science/pith/N4LDZ5ABWGH7WXSKYXDLWLDDC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4LDZ5ABWGH7WXSKYXDLWLDDC2/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-05-26T00:35:06Z","links":{"resolver":"https://pith.science/pith/N4LDZ5ABWGH7WXSKYXDLWLDDC2","bundle":"https://pith.science/pith/N4LDZ5ABWGH7WXSKYXDLWLDDC2/bundle.json","state":"https://pith.science/pith/N4LDZ5ABWGH7WXSKYXDLWLDDC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4LDZ5ABWGH7WXSKYXDLWLDDC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:N4LDZ5ABWGH7WXSKYXDLWLDDC2","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":"dc609129e772a100ed2a4563961e93c6fb655054b8ea3509ee05e20eb4b2ed43","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-09T01:31:48Z","title_canon_sha256":"1aaef4bb547f84f4602799ee476cc62489d4cdeacddb7f389811051e65237e8f"},"schema_version":"1.0","source":{"id":"1311.2123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2123","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2123v1","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2123","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"N4LDZ5ABWGH7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N4LDZ5ABWGH7WXSK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N4LDZ5AB","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:17f646b52cd2ad8683398a8566f5a3bcdf6e56624cdc76304236d040bc84d323","target":"graph","created_at":"2026-05-18T03:07:33Z","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":"Sparse random linear network coding (SRLNC) is an attractive technique proposed in the literature to reduce the decoding complexity of random linear network coding. Recognizing the fact that the existing SRLNC schemes are not efficient in terms of the required reception overhead, we consider the problem of designing overhead-optimized SRLNC schemes. To this end, we introduce a new design of SRLNC scheme that enjoys very small reception overhead while maintaining the main benefit of SRLNC, i.e., its linear encoding/decoding complexity. We also provide a mathematical framework for the asymptotic","authors_text":"Kaveh Mahdaviani, Masoud Ardakani, Raman Yazdani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-09T01:31:48Z","title":"Linear-Complexity Overhead-Optimized Random Linear Network Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2123","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:27a2fa0d380397d7134d5f94a16d185fde472fa389d489e703768006166082b3","target":"record","created_at":"2026-05-18T03:07:33Z","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":"dc609129e772a100ed2a4563961e93c6fb655054b8ea3509ee05e20eb4b2ed43","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-09T01:31:48Z","title_canon_sha256":"1aaef4bb547f84f4602799ee476cc62489d4cdeacddb7f389811051e65237e8f"},"schema_version":"1.0","source":{"id":"1311.2123","kind":"arxiv","version":1}},"canonical_sha256":"6f163cf401b18ffb5e4ac5c6bb2c6316a99f9bd81f11065b67419b0f491ff813","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f163cf401b18ffb5e4ac5c6bb2c6316a99f9bd81f11065b67419b0f491ff813","first_computed_at":"2026-05-18T03:07:33.481251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:33.481251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fTB9Lj48L3CAFEm8eIJy+fDaXIxCxiGUfJPrD6hMEPoZqkPY3fNCMzcYmrFmDpuvgEiOOqt+eg+KHVwgBU9XDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:33.481646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27a2fa0d380397d7134d5f94a16d185fde472fa389d489e703768006166082b3","sha256:17f646b52cd2ad8683398a8566f5a3bcdf6e56624cdc76304236d040bc84d323"],"state_sha256":"f5f62d8e7f880fa71951fb1ae9d63a333141cb49de00c927c93f84e74ab48fc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/hF4ze7CI1q2S0AYro0bES9oO/WO4ADardBJVlI3WQzz/ePFkn8HEaogAqP2qngczynkJPK0IgKLwrkYl8KDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:35:06.276612Z","bundle_sha256":"01dd5c2f123ab3a2cb375aefeebbddf2c6bc86421af973bff60cff9c58d5a6a7"}}