{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:I44GHJFPOA77W3IXKVKBULI4DW","short_pith_number":"pith:I44GHJFP","canonical_record":{"source":{"id":"1511.05892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-18T17:41:26Z","cross_cats_sorted":["cs.MM","cs.NI","cs.PF","math.IT"],"title_canon_sha256":"0a002fc512f1399c54ba90e19c3e71c37c3adb2861d1559ec4e614e5a00e9e81","abstract_canon_sha256":"37f97dbb348dc811a1542efab05a25faa491fdec8d9f87c492c11e76ac34feaf"},"schema_version":"1.0"},"canonical_sha256":"473863a4af703ffb6d1755541a2d1c1dba8b0dc08a0931c195744a113233b56d","source":{"kind":"arxiv","id":"1511.05892","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05892","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05892v2","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05892","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"I44GHJFPOA77","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I44GHJFPOA77W3IX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I44GHJFP","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:I44GHJFPOA77W3IXKVKBULI4DW","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-18T17:41:26Z","cross_cats_sorted":["cs.MM","cs.NI","cs.PF","math.IT"],"title_canon_sha256":"0a002fc512f1399c54ba90e19c3e71c37c3adb2861d1559ec4e614e5a00e9e81","abstract_canon_sha256":"37f97dbb348dc811a1542efab05a25faa491fdec8d9f87c492c11e76ac34feaf"},"schema_version":"1.0"},"canonical_sha256":"473863a4af703ffb6d1755541a2d1c1dba8b0dc08a0931c195744a113233b56d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:34.537198Z","signature_b64":"XUaS5e47re1QgcyJN7H7F52KhoibcYJBMJqHwMFyi5UvOfgjXSOJXlZLTkUlcMROSr32zqq954310xr4cOuQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"473863a4af703ffb6d1755541a2d1c1dba8b0dc08a0931c195744a113233b56d","last_reissued_at":"2026-05-18T00:58:34.536561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:34.536561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05892","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-18T00:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgNc5FRh/KNZ8TkxdMrgzuyK8775sY5FvCV8zSCJbEgNoSYH5Mcw/gaNXwq/1TCGV9O1gZCxOyK6CiivqJaNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:55:29.088290Z"},"content_sha256":"f6172be54ee6663740787a7cc6e9a27f811db02100497ad1d299da43e13551d3","schema_version":"1.0","event_id":"sha256:f6172be54ee6663740787a7cc6e9a27f811db02100497ad1d299da43e13551d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:I44GHJFPOA77W3IXKVKBULI4DW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.NI","cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Tassi, Daniel E. Lucani, Ioannis Chatzigeorgiou","submitted_at":"2015-11-18T17:41:26Z","abstract_excerpt":"Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different Random Linear Network Coding (RLNC) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user's computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05892","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-18T00:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMQS4FZKNBDqiePFotZ513DR+OxohvDOEQTo3/L4jvqY9HFFkUTRO82qS9lTql9DUYdBn/NuZxY1x7PpP2IUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:55:29.088663Z"},"content_sha256":"3c88ce6c361faec94621e7849aa49c8799283c4eb68f989a813c0f14c8b258c6","schema_version":"1.0","event_id":"sha256:3c88ce6c361faec94621e7849aa49c8799283c4eb68f989a813c0f14c8b258c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I44GHJFPOA77W3IXKVKBULI4DW/bundle.json","state_url":"https://pith.science/pith/I44GHJFPOA77W3IXKVKBULI4DW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I44GHJFPOA77W3IXKVKBULI4DW/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-02T07:55:29Z","links":{"resolver":"https://pith.science/pith/I44GHJFPOA77W3IXKVKBULI4DW","bundle":"https://pith.science/pith/I44GHJFPOA77W3IXKVKBULI4DW/bundle.json","state":"https://pith.science/pith/I44GHJFPOA77W3IXKVKBULI4DW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I44GHJFPOA77W3IXKVKBULI4DW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:I44GHJFPOA77W3IXKVKBULI4DW","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":"37f97dbb348dc811a1542efab05a25faa491fdec8d9f87c492c11e76ac34feaf","cross_cats_sorted":["cs.MM","cs.NI","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-18T17:41:26Z","title_canon_sha256":"0a002fc512f1399c54ba90e19c3e71c37c3adb2861d1559ec4e614e5a00e9e81"},"schema_version":"1.0","source":{"id":"1511.05892","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05892","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05892v2","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05892","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"I44GHJFPOA77","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I44GHJFPOA77W3IX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I44GHJFP","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:3c88ce6c361faec94621e7849aa49c8799283c4eb68f989a813c0f14c8b258c6","target":"graph","created_at":"2026-05-18T00:58:34Z","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":"Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different Random Linear Network Coding (RLNC) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user's computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC","authors_text":"Andrea Tassi, Daniel E. Lucani, Ioannis Chatzigeorgiou","cross_cats":["cs.MM","cs.NI","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-18T17:41:26Z","title":"Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05892","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:f6172be54ee6663740787a7cc6e9a27f811db02100497ad1d299da43e13551d3","target":"record","created_at":"2026-05-18T00:58:34Z","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":"37f97dbb348dc811a1542efab05a25faa491fdec8d9f87c492c11e76ac34feaf","cross_cats_sorted":["cs.MM","cs.NI","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-18T17:41:26Z","title_canon_sha256":"0a002fc512f1399c54ba90e19c3e71c37c3adb2861d1559ec4e614e5a00e9e81"},"schema_version":"1.0","source":{"id":"1511.05892","kind":"arxiv","version":2}},"canonical_sha256":"473863a4af703ffb6d1755541a2d1c1dba8b0dc08a0931c195744a113233b56d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"473863a4af703ffb6d1755541a2d1c1dba8b0dc08a0931c195744a113233b56d","first_computed_at":"2026-05-18T00:58:34.536561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:34.536561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XUaS5e47re1QgcyJN7H7F52KhoibcYJBMJqHwMFyi5UvOfgjXSOJXlZLTkUlcMROSr32zqq954310xr4cOuQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:34.537198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05892","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6172be54ee6663740787a7cc6e9a27f811db02100497ad1d299da43e13551d3","sha256:3c88ce6c361faec94621e7849aa49c8799283c4eb68f989a813c0f14c8b258c6"],"state_sha256":"cfe570e25dd55af223814b1d6ed610567a15677ba045cc8389ebbe3129f02cf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nq2RFHKiQH+Z96XA0Qzx9w2oT4xJGSZkLBKb2E9sCEc+vDy8R8zoLe3RIAXMX3503R6swcUoxzXnWa9GRw02AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:55:29.090525Z","bundle_sha256":"c120d647becc0f92d4fd602f4d18459c946c8483f60e3fe5a114262b201a3a96"}}