{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GAVQY6FVS35YZQPIYXNMXTUFBI","short_pith_number":"pith:GAVQY6FV","canonical_record":{"source":{"id":"1501.03307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-14T10:52:10Z","cross_cats_sorted":["cs.MM","cs.PF","math.IT"],"title_canon_sha256":"9290c25eb4976c8952099aac5f99e837ba13e656ee8b6745b4c81c9a0d9e17e4","abstract_canon_sha256":"63b961d1cbc6d5a8fc622826fcef348e3184b2999788c7ca62c222abe7f8b8a1"},"schema_version":"1.0"},"canonical_sha256":"302b0c78b596fb8cc1e8c5dacbce850a3999b382889f898821439f7a74f0a26e","source":{"kind":"arxiv","id":"1501.03307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03307","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03307v1","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03307","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"GAVQY6FVS35Y","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GAVQY6FVS35YZQPI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GAVQY6FV","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GAVQY6FVS35YZQPIYXNMXTUFBI","target":"record","payload":{"canonical_record":{"source":{"id":"1501.03307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-14T10:52:10Z","cross_cats_sorted":["cs.MM","cs.PF","math.IT"],"title_canon_sha256":"9290c25eb4976c8952099aac5f99e837ba13e656ee8b6745b4c81c9a0d9e17e4","abstract_canon_sha256":"63b961d1cbc6d5a8fc622826fcef348e3184b2999788c7ca62c222abe7f8b8a1"},"schema_version":"1.0"},"canonical_sha256":"302b0c78b596fb8cc1e8c5dacbce850a3999b382889f898821439f7a74f0a26e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:02.195251Z","signature_b64":"sy4VEoIlJGfOpWMQC8jjIeNYjxGs4RCzFj8tvChjv7B1LW55oPiQIW5PB7jNxa6uEadkoeKhP1P7v6VkLpcFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"302b0c78b596fb8cc1e8c5dacbce850a3999b382889f898821439f7a74f0a26e","last_reissued_at":"2026-05-18T00:59:02.194753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:02.194753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.03307","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-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WsHRPy5PSSzCnlaMMXt9+deApSLbxHj+akpb8guuT/Of1v4rIx9wMw88ITUt/Sv8qfueXur9VFQbGbWIs6FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:02:45.050772Z"},"content_sha256":"dbf8f20adcca9167af518b1ed8cb6e73b5be2df99ade71ef724bd8ca3c49e852","schema_version":"1.0","event_id":"sha256:dbf8f20adcca9167af518b1ed8cb6e73b5be2df99ade71ef724bd8ca3c49e852"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GAVQY6FVS35YZQPIYXNMXTUFBI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Systematic Network Coding for Progressive Packet Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Tassi, Andrew L. Jones, Ioannis Chatzigeorgiou","submitted_at":"2015-01-14T10:52:10Z","abstract_excerpt":"We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional network coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve the theoretical optimal performance. Furthermore, we demonstrate that systematic network codes equipped w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03307","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-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++Y/DO7L2KBooP3BHVUvdE2SNlToW2yT0JwuRGvKBtc799wPmlYhoS51F8Ei4UPeY8h7tPGnAQMBS9AjGgSVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:02:45.051106Z"},"content_sha256":"9d9e505b695ce035b9fbd8d5373da88949b1aa7fd8057a317bbc85ab14ebb84f","schema_version":"1.0","event_id":"sha256:9d9e505b695ce035b9fbd8d5373da88949b1aa7fd8057a317bbc85ab14ebb84f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAVQY6FVS35YZQPIYXNMXTUFBI/bundle.json","state_url":"https://pith.science/pith/GAVQY6FVS35YZQPIYXNMXTUFBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAVQY6FVS35YZQPIYXNMXTUFBI/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-06-25T18:02:45Z","links":{"resolver":"https://pith.science/pith/GAVQY6FVS35YZQPIYXNMXTUFBI","bundle":"https://pith.science/pith/GAVQY6FVS35YZQPIYXNMXTUFBI/bundle.json","state":"https://pith.science/pith/GAVQY6FVS35YZQPIYXNMXTUFBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAVQY6FVS35YZQPIYXNMXTUFBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GAVQY6FVS35YZQPIYXNMXTUFBI","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":"63b961d1cbc6d5a8fc622826fcef348e3184b2999788c7ca62c222abe7f8b8a1","cross_cats_sorted":["cs.MM","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-14T10:52:10Z","title_canon_sha256":"9290c25eb4976c8952099aac5f99e837ba13e656ee8b6745b4c81c9a0d9e17e4"},"schema_version":"1.0","source":{"id":"1501.03307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03307","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03307v1","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03307","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"GAVQY6FVS35Y","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GAVQY6FVS35YZQPI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GAVQY6FV","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:9d9e505b695ce035b9fbd8d5373da88949b1aa7fd8057a317bbc85ab14ebb84f","target":"graph","created_at":"2026-05-18T00:59:02Z","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":"We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional network coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve the theoretical optimal performance. Furthermore, we demonstrate that systematic network codes equipped w","authors_text":"Andrea Tassi, Andrew L. Jones, Ioannis Chatzigeorgiou","cross_cats":["cs.MM","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-14T10:52:10Z","title":"Binary Systematic Network Coding for Progressive Packet Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03307","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:dbf8f20adcca9167af518b1ed8cb6e73b5be2df99ade71ef724bd8ca3c49e852","target":"record","created_at":"2026-05-18T00:59:02Z","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":"63b961d1cbc6d5a8fc622826fcef348e3184b2999788c7ca62c222abe7f8b8a1","cross_cats_sorted":["cs.MM","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-14T10:52:10Z","title_canon_sha256":"9290c25eb4976c8952099aac5f99e837ba13e656ee8b6745b4c81c9a0d9e17e4"},"schema_version":"1.0","source":{"id":"1501.03307","kind":"arxiv","version":1}},"canonical_sha256":"302b0c78b596fb8cc1e8c5dacbce850a3999b382889f898821439f7a74f0a26e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"302b0c78b596fb8cc1e8c5dacbce850a3999b382889f898821439f7a74f0a26e","first_computed_at":"2026-05-18T00:59:02.194753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:02.194753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sy4VEoIlJGfOpWMQC8jjIeNYjxGs4RCzFj8tvChjv7B1LW55oPiQIW5PB7jNxa6uEadkoeKhP1P7v6VkLpcFDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:02.195251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbf8f20adcca9167af518b1ed8cb6e73b5be2df99ade71ef724bd8ca3c49e852","sha256:9d9e505b695ce035b9fbd8d5373da88949b1aa7fd8057a317bbc85ab14ebb84f"],"state_sha256":"1d317c0bed20adad404a1498a2b8955bfe9b202c97de78a7b008ae67dc37d5f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I83jc/t817K4FzSDDgmNGmSC4BFEEIHWRbMmzCIIwDL/IPNRcdS81IbIigWcJ/iUK+03IwukA6t+JaYUufkgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:02:45.053353Z","bundle_sha256":"5284f9ea08bd0ea8988c3aac3a99db8c4ede667c8ee5af9f5b6c9584c5d2493d"}}