{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MIFIMYLRRUCHNHRK77UVJJK7WU","short_pith_number":"pith:MIFIMYLR","canonical_record":{"source":{"id":"1312.4091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-14T21:40:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c9448e59e9c04efe8492b808974ffd984abae9c9a3e1f1bfedfa0fed1f75edd9","abstract_canon_sha256":"5e14532fc681d8b18e9d5ea34cb35cd982044eb8f2ee33f5b6c88a22a66b1433"},"schema_version":"1.0"},"canonical_sha256":"620a8661718d04769e2affe954a55fb539ac66c400ba2229a2296af56c968abe","source":{"kind":"arxiv","id":"1312.4091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4091","created_at":"2026-05-18T02:55:13Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4091v2","created_at":"2026-05-18T02:55:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4091","created_at":"2026-05-18T02:55:13Z"},{"alias_kind":"pith_short_12","alias_value":"MIFIMYLRRUCH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MIFIMYLRRUCHNHRK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MIFIMYLR","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MIFIMYLRRUCHNHRK77UVJJK7WU","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-14T21:40:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c9448e59e9c04efe8492b808974ffd984abae9c9a3e1f1bfedfa0fed1f75edd9","abstract_canon_sha256":"5e14532fc681d8b18e9d5ea34cb35cd982044eb8f2ee33f5b6c88a22a66b1433"},"schema_version":"1.0"},"canonical_sha256":"620a8661718d04769e2affe954a55fb539ac66c400ba2229a2296af56c968abe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:13.111759Z","signature_b64":"KvkQEpAznDx0yDCvsDQER/U9FqhZs+C1Qp9FWoBeD7VzkgBMx2/aieOoEkV9m4TgZRdJOH78okLp4eBR96CXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"620a8661718d04769e2affe954a55fb539ac66c400ba2229a2296af56c968abe","last_reissued_at":"2026-05-18T02:55:13.111383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:13.111383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4091","source_version":2,"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-18T02:55:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/A8lh5ErMXB1v446cgIQRDLpPr+R/FoTg8Wm1KuYZ6YUtpkk6JmoTWdgicJD2YDNOR5JaSn9nZVaHNI9CF1xBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:37:23.371003Z"},"content_sha256":"158d06c062bc4ee038c8b297e44d281a1e82b3dbcad7e0e6e5ecf74290208019","schema_version":"1.0","event_id":"sha256:158d06c062bc4ee038c8b297e44d281a1e82b3dbcad7e0e6e5ecf74290208019"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MIFIMYLRRUCHNHRK77UVJJK7WU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Dissemination Time of Random Linear Network Coding in Ad-hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamed Firooz, Shwan Ashrafi, Sumit Roy","submitted_at":"2013-12-14T21:40:25Z","abstract_excerpt":"Random linear network coding (RLNC) unicast protocol is analyzed over a rapidly-changing network topology. We model the probability mass function (pmf) of the dissemination time as a sequence of independent geometric random variables whose success probability changes with every successful reception of an innovative packet. We derive a tight approximation of the average networked innovation probability conditioned on network dimension increase. We show through simulations that our approximations for the average dissemination time and its pmf are tight. We then propose to use a RLNC-based broadc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4091","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"},"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-18T02:55:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7BmUEneSyzqhcFvnsVjTMLu3+dyLijlAi0bUF3Wazxn6FwuJCmQlTvwqQ9ML31W5KfiPpJOF1PhkmLHdzVA7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:37:23.371434Z"},"content_sha256":"afb0b91d74093e5af0d0a79f7ee37525f8e4fd811ac621dbc815a5ba33d7d3ee","schema_version":"1.0","event_id":"sha256:afb0b91d74093e5af0d0a79f7ee37525f8e4fd811ac621dbc815a5ba33d7d3ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIFIMYLRRUCHNHRK77UVJJK7WU/bundle.json","state_url":"https://pith.science/pith/MIFIMYLRRUCHNHRK77UVJJK7WU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIFIMYLRRUCHNHRK77UVJJK7WU/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-28T22:37:23Z","links":{"resolver":"https://pith.science/pith/MIFIMYLRRUCHNHRK77UVJJK7WU","bundle":"https://pith.science/pith/MIFIMYLRRUCHNHRK77UVJJK7WU/bundle.json","state":"https://pith.science/pith/MIFIMYLRRUCHNHRK77UVJJK7WU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIFIMYLRRUCHNHRK77UVJJK7WU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MIFIMYLRRUCHNHRK77UVJJK7WU","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":"5e14532fc681d8b18e9d5ea34cb35cd982044eb8f2ee33f5b6c88a22a66b1433","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-14T21:40:25Z","title_canon_sha256":"c9448e59e9c04efe8492b808974ffd984abae9c9a3e1f1bfedfa0fed1f75edd9"},"schema_version":"1.0","source":{"id":"1312.4091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4091","created_at":"2026-05-18T02:55:13Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4091v2","created_at":"2026-05-18T02:55:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4091","created_at":"2026-05-18T02:55:13Z"},{"alias_kind":"pith_short_12","alias_value":"MIFIMYLRRUCH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MIFIMYLRRUCHNHRK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MIFIMYLR","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:afb0b91d74093e5af0d0a79f7ee37525f8e4fd811ac621dbc815a5ba33d7d3ee","target":"graph","created_at":"2026-05-18T02:55:13Z","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":"Random linear network coding (RLNC) unicast protocol is analyzed over a rapidly-changing network topology. We model the probability mass function (pmf) of the dissemination time as a sequence of independent geometric random variables whose success probability changes with every successful reception of an innovative packet. We derive a tight approximation of the average networked innovation probability conditioned on network dimension increase. We show through simulations that our approximations for the average dissemination time and its pmf are tight. We then propose to use a RLNC-based broadc","authors_text":"Hamed Firooz, Shwan Ashrafi, Sumit Roy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-14T21:40:25Z","title":"On Dissemination Time of Random Linear Network Coding in Ad-hoc Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4091","kind":"arxiv","version":2},"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:158d06c062bc4ee038c8b297e44d281a1e82b3dbcad7e0e6e5ecf74290208019","target":"record","created_at":"2026-05-18T02:55:13Z","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":"5e14532fc681d8b18e9d5ea34cb35cd982044eb8f2ee33f5b6c88a22a66b1433","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-14T21:40:25Z","title_canon_sha256":"c9448e59e9c04efe8492b808974ffd984abae9c9a3e1f1bfedfa0fed1f75edd9"},"schema_version":"1.0","source":{"id":"1312.4091","kind":"arxiv","version":2}},"canonical_sha256":"620a8661718d04769e2affe954a55fb539ac66c400ba2229a2296af56c968abe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"620a8661718d04769e2affe954a55fb539ac66c400ba2229a2296af56c968abe","first_computed_at":"2026-05-18T02:55:13.111383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:13.111383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KvkQEpAznDx0yDCvsDQER/U9FqhZs+C1Qp9FWoBeD7VzkgBMx2/aieOoEkV9m4TgZRdJOH78okLp4eBR96CXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:13.111759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:158d06c062bc4ee038c8b297e44d281a1e82b3dbcad7e0e6e5ecf74290208019","sha256:afb0b91d74093e5af0d0a79f7ee37525f8e4fd811ac621dbc815a5ba33d7d3ee"],"state_sha256":"36126c906cbf28d0f084c4b839854611b6aa2585b746357cdc604ba9cda3785b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/J2p96nWuRjATCO6jaPmkC1akT/YhdLOkYCBXUp9WrY7msQ6//Atvxz4nps838A1WF6az34QPEXBIIPyhOd+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:37:23.374735Z","bundle_sha256":"af58828de57b59f2944fa64baa59b678441ac78d243672a21ae9d11d82d83c6f"}}