{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RQ6MPWGP7IU2ZMM36LL2GD7MPP","short_pith_number":"pith:RQ6MPWGP","canonical_record":{"source":{"id":"1705.09473","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-26T08:21:00Z","cross_cats_sorted":["cs.PF","math.IT"],"title_canon_sha256":"0bf19c278ec563a034748ed68b52e184986b61603eb5a7b9d807ce322e44ad2e","abstract_canon_sha256":"c19e4cb14422330b923ca0958dd08993553051305fa9ff737c3d3ecf1a069975"},"schema_version":"1.0"},"canonical_sha256":"8c3cc7d8cffa29acb19bf2d7a30fec7bd3ec661df6d9f6128ec10c0f752f2f8d","source":{"kind":"arxiv","id":"1705.09473","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09473","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09473v4","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09473","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"RQ6MPWGP7IU2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQ6MPWGP7IU2ZMM3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQ6MPWGP","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RQ6MPWGP7IU2ZMM36LL2GD7MPP","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09473","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-26T08:21:00Z","cross_cats_sorted":["cs.PF","math.IT"],"title_canon_sha256":"0bf19c278ec563a034748ed68b52e184986b61603eb5a7b9d807ce322e44ad2e","abstract_canon_sha256":"c19e4cb14422330b923ca0958dd08993553051305fa9ff737c3d3ecf1a069975"},"schema_version":"1.0"},"canonical_sha256":"8c3cc7d8cffa29acb19bf2d7a30fec7bd3ec661df6d9f6128ec10c0f752f2f8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:23.328662Z","signature_b64":"2gJWjBYGTiK2AF2W2OANY5GCqeoENRXYpH3dsk8ODbb4c8qC1rHEJfk9LoFrU9I+nWJfoMEKxKxKz87aVOQnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c3cc7d8cffa29acb19bf2d7a30fec7bd3ec661df6d9f6128ec10c0f752f2f8d","last_reissued_at":"2026-05-17T23:55:23.328270Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:23.328270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09473","source_version":4,"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-17T23:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LPv4nRZwTRUjhk/NNY7Ipy0fajGjsFsX3ch0RYUtRS/zKF2d4+y9Jb6/LsHBD+FN1qU10FzcIyGn9uCf3TwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:14:12.906960Z"},"content_sha256":"db1e5e2029a63c3bb205c49872719000c9504721e415cc074b15163df8820d43","schema_version":"1.0","event_id":"sha256:db1e5e2029a63c3bb205c49872719000c9504721e415cc074b15163df8820d43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RQ6MPWGP7IU2ZMM36LL2GD7MPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliability of Broadcast Communications Under Sparse Random Linear Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Tassi, Oliver Johnson, Suzie Brown","submitted_at":"2017-05-26T08:21:00Z","abstract_excerpt":"Ultra-reliable Point-to-Multipoint (PtM) communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse Random Linear Network Coding (RLNC) techniques have been widely employed to provide an efficient way to improve the reliability of broadcast and multicast data streams. This paper addresses the pressing concern of providing a tight approximation to the probability of a user recovering a data stream protected by this kind of coding technique. In particular, by exploiting the Stein--Chen method, we provide a novel and gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09473","kind":"arxiv","version":4},"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-17T23:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yTcldiYNTAH1XNaMRzQKHSmPtZBEatmLPr1FQ8ktcuirBE4b3/B3p+jA33AU6sbaHPBDV0yhns/QLICnIS9XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:14:12.907713Z"},"content_sha256":"86777d2b2f8a1e809c9c25ef0dd57a4296be090bc8ebbfc8f287893e006d83e8","schema_version":"1.0","event_id":"sha256:86777d2b2f8a1e809c9c25ef0dd57a4296be090bc8ebbfc8f287893e006d83e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQ6MPWGP7IU2ZMM36LL2GD7MPP/bundle.json","state_url":"https://pith.science/pith/RQ6MPWGP7IU2ZMM36LL2GD7MPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQ6MPWGP7IU2ZMM36LL2GD7MPP/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-06T12:14:12Z","links":{"resolver":"https://pith.science/pith/RQ6MPWGP7IU2ZMM36LL2GD7MPP","bundle":"https://pith.science/pith/RQ6MPWGP7IU2ZMM36LL2GD7MPP/bundle.json","state":"https://pith.science/pith/RQ6MPWGP7IU2ZMM36LL2GD7MPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQ6MPWGP7IU2ZMM36LL2GD7MPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RQ6MPWGP7IU2ZMM36LL2GD7MPP","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":"c19e4cb14422330b923ca0958dd08993553051305fa9ff737c3d3ecf1a069975","cross_cats_sorted":["cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-26T08:21:00Z","title_canon_sha256":"0bf19c278ec563a034748ed68b52e184986b61603eb5a7b9d807ce322e44ad2e"},"schema_version":"1.0","source":{"id":"1705.09473","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09473","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09473v4","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09473","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"RQ6MPWGP7IU2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQ6MPWGP7IU2ZMM3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQ6MPWGP","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:86777d2b2f8a1e809c9c25ef0dd57a4296be090bc8ebbfc8f287893e006d83e8","target":"graph","created_at":"2026-05-17T23:55:23Z","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":"Ultra-reliable Point-to-Multipoint (PtM) communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse Random Linear Network Coding (RLNC) techniques have been widely employed to provide an efficient way to improve the reliability of broadcast and multicast data streams. This paper addresses the pressing concern of providing a tight approximation to the probability of a user recovering a data stream protected by this kind of coding technique. In particular, by exploiting the Stein--Chen method, we provide a novel and gene","authors_text":"Andrea Tassi, Oliver Johnson, Suzie Brown","cross_cats":["cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-26T08:21:00Z","title":"Reliability of Broadcast Communications Under Sparse Random Linear Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09473","kind":"arxiv","version":4},"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:db1e5e2029a63c3bb205c49872719000c9504721e415cc074b15163df8820d43","target":"record","created_at":"2026-05-17T23:55:23Z","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":"c19e4cb14422330b923ca0958dd08993553051305fa9ff737c3d3ecf1a069975","cross_cats_sorted":["cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-26T08:21:00Z","title_canon_sha256":"0bf19c278ec563a034748ed68b52e184986b61603eb5a7b9d807ce322e44ad2e"},"schema_version":"1.0","source":{"id":"1705.09473","kind":"arxiv","version":4}},"canonical_sha256":"8c3cc7d8cffa29acb19bf2d7a30fec7bd3ec661df6d9f6128ec10c0f752f2f8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c3cc7d8cffa29acb19bf2d7a30fec7bd3ec661df6d9f6128ec10c0f752f2f8d","first_computed_at":"2026-05-17T23:55:23.328270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:23.328270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2gJWjBYGTiK2AF2W2OANY5GCqeoENRXYpH3dsk8ODbb4c8qC1rHEJfk9LoFrU9I+nWJfoMEKxKxKz87aVOQnCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:23.328662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09473","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db1e5e2029a63c3bb205c49872719000c9504721e415cc074b15163df8820d43","sha256:86777d2b2f8a1e809c9c25ef0dd57a4296be090bc8ebbfc8f287893e006d83e8"],"state_sha256":"3a3030fa2555668cc7e39beb91fc41237de1b5f94e03fa6ce481146f803ca9d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ipd0FlQ0Icw3wB3FrzotIT7gKU/BNQlXDjg9F8p6QZi9qzVvXH9mT0HvZUoZSQUKMC1q7I12Fc3C2+VgIN3ODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:14:12.911699Z","bundle_sha256":"711927c83e0263552d647ad05eec9d429f49e28de498885c4cf7d3eb0cf04c41"}}