{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YOT2OIL2YJNNGIZKEZA4DIMEGE","short_pith_number":"pith:YOT2OIL2","canonical_record":{"source":{"id":"1506.05819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-18T21:05:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"80cfc82848c349a05cc083a72426cbb8d4c94e6ff105bef51ff40f27ac4c8800","abstract_canon_sha256":"4b73e2f8066f113b6d6b30c1a76f79cef7e1535257a2bb2681071eada868cadb"},"schema_version":"1.0"},"canonical_sha256":"c3a7a7217ac25ad3232a2641c1a184312a4f310df1273ba4580fc6f530931e3f","source":{"kind":"arxiv","id":"1506.05819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05819","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05819v1","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05819","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"YOT2OIL2YJNN","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YOT2OIL2YJNNGIZK","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YOT2OIL2","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YOT2OIL2YJNNGIZKEZA4DIMEGE","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-18T21:05:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"80cfc82848c349a05cc083a72426cbb8d4c94e6ff105bef51ff40f27ac4c8800","abstract_canon_sha256":"4b73e2f8066f113b6d6b30c1a76f79cef7e1535257a2bb2681071eada868cadb"},"schema_version":"1.0"},"canonical_sha256":"c3a7a7217ac25ad3232a2641c1a184312a4f310df1273ba4580fc6f530931e3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:47.210614Z","signature_b64":"15hvvlpPj5nvJvf9Rhq+Qw5f4khpPsE/VzHosumNotp634Gq/77CSHZUAMLhYLmEyZDCETf77ZlCAtqqTCEmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3a7a7217ac25ad3232a2641c1a184312a4f310df1273ba4580fc6f530931e3f","last_reissued_at":"2026-05-18T01:42:47.209833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:47.209833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05819","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-18T01:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhww22MyRRESBDVF6+wXWN18I4n7yFkqahubcAL2KQ9eera43IqCLEK6wCMm04OYScKb/mvqvzXxJDCI9gWFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:14:35.330636Z"},"content_sha256":"a065a6589b90bd8c714c76cc2dd94e163fc2e46ad765826b192fcae1a6bf7ab7","schema_version":"1.0","event_id":"sha256:a065a6589b90bd8c714c76cc2dd94e163fc2e46ad765826b192fcae1a6bf7ab7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YOT2OIL2YJNNGIZKEZA4DIMEGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Analysis for Reliable Data Dissemination in Shared loss Multicast Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Asaf Cohen, Omer Gurewitz, Ron Yadgar","submitted_at":"2015-06-18T21:05:53Z","abstract_excerpt":"The completion time for the dissemination (or alternatively, aggregation) of information from all nodes in a network plays a critical role in the design and analysis of communication systems, especially in real time applications for which delay is critical. In this work, we analyse the completion time of data dissemination in a shared loss (i.e., unreliable links) multicast tree, at the limit of large number of nodes. Specifically, analytic expressions for upper and lower bounds on the expected completion time are provided, and, in particular, it is shown that both these bounds scale as $\\alph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05819","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-18T01:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgWhfcWcWOcZisRUDXuTPR+AbpY1BIvTRwnyQtv5XYHj9WPXujGknf2RsXITDNx9dWgnR9DmNbB2VI09pQqbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:14:35.330970Z"},"content_sha256":"e34a72bd62ea155a6d18c320c11c9e47e5ea8b8394632806edaba46e317e8dac","schema_version":"1.0","event_id":"sha256:e34a72bd62ea155a6d18c320c11c9e47e5ea8b8394632806edaba46e317e8dac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOT2OIL2YJNNGIZKEZA4DIMEGE/bundle.json","state_url":"https://pith.science/pith/YOT2OIL2YJNNGIZKEZA4DIMEGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOT2OIL2YJNNGIZKEZA4DIMEGE/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-29T03:14:35Z","links":{"resolver":"https://pith.science/pith/YOT2OIL2YJNNGIZKEZA4DIMEGE","bundle":"https://pith.science/pith/YOT2OIL2YJNNGIZKEZA4DIMEGE/bundle.json","state":"https://pith.science/pith/YOT2OIL2YJNNGIZKEZA4DIMEGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOT2OIL2YJNNGIZKEZA4DIMEGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YOT2OIL2YJNNGIZKEZA4DIMEGE","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":"4b73e2f8066f113b6d6b30c1a76f79cef7e1535257a2bb2681071eada868cadb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-18T21:05:53Z","title_canon_sha256":"80cfc82848c349a05cc083a72426cbb8d4c94e6ff105bef51ff40f27ac4c8800"},"schema_version":"1.0","source":{"id":"1506.05819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05819","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05819v1","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05819","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"YOT2OIL2YJNN","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YOT2OIL2YJNNGIZK","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YOT2OIL2","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:e34a72bd62ea155a6d18c320c11c9e47e5ea8b8394632806edaba46e317e8dac","target":"graph","created_at":"2026-05-18T01:42: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":"The completion time for the dissemination (or alternatively, aggregation) of information from all nodes in a network plays a critical role in the design and analysis of communication systems, especially in real time applications for which delay is critical. In this work, we analyse the completion time of data dissemination in a shared loss (i.e., unreliable links) multicast tree, at the limit of large number of nodes. Specifically, analytic expressions for upper and lower bounds on the expected completion time are provided, and, in particular, it is shown that both these bounds scale as $\\alph","authors_text":"Asaf Cohen, Omer Gurewitz, Ron Yadgar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-18T21:05:53Z","title":"Asymptotic Analysis for Reliable Data Dissemination in Shared loss Multicast Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05819","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:a065a6589b90bd8c714c76cc2dd94e163fc2e46ad765826b192fcae1a6bf7ab7","target":"record","created_at":"2026-05-18T01:42: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":"4b73e2f8066f113b6d6b30c1a76f79cef7e1535257a2bb2681071eada868cadb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-18T21:05:53Z","title_canon_sha256":"80cfc82848c349a05cc083a72426cbb8d4c94e6ff105bef51ff40f27ac4c8800"},"schema_version":"1.0","source":{"id":"1506.05819","kind":"arxiv","version":1}},"canonical_sha256":"c3a7a7217ac25ad3232a2641c1a184312a4f310df1273ba4580fc6f530931e3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3a7a7217ac25ad3232a2641c1a184312a4f310df1273ba4580fc6f530931e3f","first_computed_at":"2026-05-18T01:42:47.209833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:47.209833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"15hvvlpPj5nvJvf9Rhq+Qw5f4khpPsE/VzHosumNotp634Gq/77CSHZUAMLhYLmEyZDCETf77ZlCAtqqTCEmBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:47.210614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a065a6589b90bd8c714c76cc2dd94e163fc2e46ad765826b192fcae1a6bf7ab7","sha256:e34a72bd62ea155a6d18c320c11c9e47e5ea8b8394632806edaba46e317e8dac"],"state_sha256":"c7a7b3f7c48532382a42f05ec42f0862b407ea41dc08caefc47f3c1380b083f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHiuz2nCtQCn/QpKzPobu/u7FeFeNDMFFN7wGsogcdi4L+YjTTp9nWe8cMceF7Ylv+cYyOE1THSakVi9Ur1FDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T03:14:35.332879Z","bundle_sha256":"9034d55e9e3a09b8d9e079cbc8e1a46c0a45809ec0d555f755e03879c3107b63"}}