{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TYNB7IAPVYX6PQVWD7CZQZEOGK","short_pith_number":"pith:TYNB7IAP","canonical_record":{"source":{"id":"1309.7881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-30T15:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"aa8f25b396aec4b346f94adccd90e9eb37d337d164ab12bedc5465db53b441e1","abstract_canon_sha256":"900c3e5b73cb5c1518a717a13f2f48288a8c2fc8bc35bd160760bdc4b08266da"},"schema_version":"1.0"},"canonical_sha256":"9e1a1fa00fae2fe7c2b61fc598648e329dbaf2cfb1e19c881a7d8b718ec43f34","source":{"kind":"arxiv","id":"1309.7881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7881","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7881v1","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7881","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"pith_short_12","alias_value":"TYNB7IAPVYX6","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TYNB7IAPVYX6PQVW","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TYNB7IAP","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TYNB7IAPVYX6PQVWD7CZQZEOGK","target":"record","payload":{"canonical_record":{"source":{"id":"1309.7881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-30T15:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"aa8f25b396aec4b346f94adccd90e9eb37d337d164ab12bedc5465db53b441e1","abstract_canon_sha256":"900c3e5b73cb5c1518a717a13f2f48288a8c2fc8bc35bd160760bdc4b08266da"},"schema_version":"1.0"},"canonical_sha256":"9e1a1fa00fae2fe7c2b61fc598648e329dbaf2cfb1e19c881a7d8b718ec43f34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:47.950728Z","signature_b64":"oNU1le/pxmVv+8S+rRoLCDdhPCVUBeWZ0zioyirOFwuCjSHv+sc2HOG7h+BXgxMWJMSB7eS+YQFBFvqFHk1OAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e1a1fa00fae2fe7c2b61fc598648e329dbaf2cfb1e19c881a7d8b718ec43f34","last_reissued_at":"2026-05-18T03:11:47.949973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:47.949973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.7881","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:11:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g077SnVnQ8fQGoeCBYjqluVlX587IK4MbOL2v/Tyk/tHh/q0CBN3aJ8FMkT+twys9oBJ2sNLcFP7iQW8mTZ5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:00:19.631867Z"},"content_sha256":"26160b805ab87a602faf4b1f2c61d1d5281e2bfd7234cf8d78662e8eb58a2e92","schema_version":"1.0","event_id":"sha256:26160b805ab87a602faf4b1f2c61d1d5281e2bfd7234cf8d78662e8eb58a2e92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TYNB7IAPVYX6PQVWD7CZQZEOGK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Performance of Network Coding and Forwarding Schemes with Different Degrees of Redundancy for Wireless Mesh Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Apostolos Traganitis, Manolis Ploumidis, Nikolaos Pappas, Vasilios A. Siris","submitted_at":"2013-09-30T15:32:33Z","abstract_excerpt":"This study explores the throughput and delay that can be achieved by various forwarding schemes employing multiple paths and different degrees of redundancy focusing on linear network coding. The key contribution of the study is an analytical framework for modeling the throughput and delay for various schemes considering wireless mesh networks where, unicast traffic is forwarded and hop-by-hop retransmissions are employed for achieving reliability. The analytical framework is generalized for an arbitrary number of paths and hops per path. Another key contribution of the study is the evaluation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7881","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:11:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJeH+Rr4C1FKOwL8BzTLwU4FpKG/xVdJUbOp7i9ReXsi8SM+0u7Tgkj+URnjkmE4uBwv9H3yy4Vyn8eUiOY6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:00:19.632545Z"},"content_sha256":"a2ec5503c4c045922e5530dd8370220d558668a7cf1f2be476159f677b59cc45","schema_version":"1.0","event_id":"sha256:a2ec5503c4c045922e5530dd8370220d558668a7cf1f2be476159f677b59cc45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYNB7IAPVYX6PQVWD7CZQZEOGK/bundle.json","state_url":"https://pith.science/pith/TYNB7IAPVYX6PQVWD7CZQZEOGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYNB7IAPVYX6PQVWD7CZQZEOGK/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-05T20:00:19Z","links":{"resolver":"https://pith.science/pith/TYNB7IAPVYX6PQVWD7CZQZEOGK","bundle":"https://pith.science/pith/TYNB7IAPVYX6PQVWD7CZQZEOGK/bundle.json","state":"https://pith.science/pith/TYNB7IAPVYX6PQVWD7CZQZEOGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYNB7IAPVYX6PQVWD7CZQZEOGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TYNB7IAPVYX6PQVWD7CZQZEOGK","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":"900c3e5b73cb5c1518a717a13f2f48288a8c2fc8bc35bd160760bdc4b08266da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-30T15:32:33Z","title_canon_sha256":"aa8f25b396aec4b346f94adccd90e9eb37d337d164ab12bedc5465db53b441e1"},"schema_version":"1.0","source":{"id":"1309.7881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7881","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7881v1","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7881","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"pith_short_12","alias_value":"TYNB7IAPVYX6","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TYNB7IAPVYX6PQVW","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TYNB7IAP","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:a2ec5503c4c045922e5530dd8370220d558668a7cf1f2be476159f677b59cc45","target":"graph","created_at":"2026-05-18T03:11:47Z","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":"This study explores the throughput and delay that can be achieved by various forwarding schemes employing multiple paths and different degrees of redundancy focusing on linear network coding. The key contribution of the study is an analytical framework for modeling the throughput and delay for various schemes considering wireless mesh networks where, unicast traffic is forwarded and hop-by-hop retransmissions are employed for achieving reliability. The analytical framework is generalized for an arbitrary number of paths and hops per path. Another key contribution of the study is the evaluation","authors_text":"Apostolos Traganitis, Manolis Ploumidis, Nikolaos Pappas, Vasilios A. Siris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-30T15:32:33Z","title":"On the Performance of Network Coding and Forwarding Schemes with Different Degrees of Redundancy for Wireless Mesh Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7881","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:26160b805ab87a602faf4b1f2c61d1d5281e2bfd7234cf8d78662e8eb58a2e92","target":"record","created_at":"2026-05-18T03:11:47Z","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":"900c3e5b73cb5c1518a717a13f2f48288a8c2fc8bc35bd160760bdc4b08266da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-30T15:32:33Z","title_canon_sha256":"aa8f25b396aec4b346f94adccd90e9eb37d337d164ab12bedc5465db53b441e1"},"schema_version":"1.0","source":{"id":"1309.7881","kind":"arxiv","version":1}},"canonical_sha256":"9e1a1fa00fae2fe7c2b61fc598648e329dbaf2cfb1e19c881a7d8b718ec43f34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e1a1fa00fae2fe7c2b61fc598648e329dbaf2cfb1e19c881a7d8b718ec43f34","first_computed_at":"2026-05-18T03:11:47.949973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:47.949973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oNU1le/pxmVv+8S+rRoLCDdhPCVUBeWZ0zioyirOFwuCjSHv+sc2HOG7h+BXgxMWJMSB7eS+YQFBFvqFHk1OAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:47.950728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26160b805ab87a602faf4b1f2c61d1d5281e2bfd7234cf8d78662e8eb58a2e92","sha256:a2ec5503c4c045922e5530dd8370220d558668a7cf1f2be476159f677b59cc45"],"state_sha256":"f0256141e5eb1e14a90fa7ead34a606f884fb993309c291e63f7ab78bafbdcdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHXoZ24IJNYAct/6UCYEkcaLgjcAiY2SAphmXYEp1navsr6cKFQwEam0tHxG0cRUwr7Ka2Q7hSUVgWlNxxt2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:00:19.636762Z","bundle_sha256":"d6ba2eba3f2bb3a10c6c65850b02f7fdcb370f6fde48163dec499a44002b43c1"}}