{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NFQUOQRXOUHTBSW343CSF22RSU","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":"cc0c3ff54a338267358f88c2384b346ae72ca1225d23012d053a4a3cf5337129","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-11T13:55:14Z","title_canon_sha256":"6af7b509af76eb05a2585a1bd26b43a2619c9373fc739e55fefab416bb5f5aad"},"schema_version":"1.0","source":{"id":"1505.02619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02619","created_at":"2026-05-18T02:16:12Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02619v1","created_at":"2026-05-18T02:16:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02619","created_at":"2026-05-18T02:16:12Z"},{"alias_kind":"pith_short_12","alias_value":"NFQUOQRXOUHT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NFQUOQRXOUHTBSW3","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NFQUOQRX","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:fc08b06389754bd37a6a7aa1b0405b6906c4bc15b5ec2270443bd56b1ba26e9e","target":"graph","created_at":"2026-05-18T02:16:12Z","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":"Recent advancements in graph-based analysis and solutions of instantly decodable network coding (IDNC) trigger the interest to extend them to more complicated opportunistic network coding (ONC) scenarios, with limited increase in complexity. In this paper, we design a simple IDNC-like graph model for a specific subclass of ONC, by introducing a more generalized definition of its vertices and the notion of vertex aggregation in order to represent the storage of non-instantly-decodable packets in ONC. Based on this representation, we determine the set of pairwise vertex adjacency conditions that","authors_text":"Mohamed-Slim Alouini, Neda Aboutorab, Parastoo Sadeghi, Sameh Sorour, Tareq Y. Al-Naffouri","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-11T13:55:14Z","title":"A Graph Model for Opportunistic Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02619","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:2de33094064d2165d9c5500fae30b8ba78ffc1f896e23217bce8bf65f00160e7","target":"record","created_at":"2026-05-18T02:16:12Z","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":"cc0c3ff54a338267358f88c2384b346ae72ca1225d23012d053a4a3cf5337129","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-11T13:55:14Z","title_canon_sha256":"6af7b509af76eb05a2585a1bd26b43a2619c9373fc739e55fefab416bb5f5aad"},"schema_version":"1.0","source":{"id":"1505.02619","kind":"arxiv","version":1}},"canonical_sha256":"6961474237750f30cadbe6c522eb51951cdf7c0ffa995c4ae59d96c143d072ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6961474237750f30cadbe6c522eb51951cdf7c0ffa995c4ae59d96c143d072ef","first_computed_at":"2026-05-18T02:16:12.065735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:12.065735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wMfPqnMq6pPJnyeLHCjKdx+LqKOkTfD+om6RjWB2g21IGFoIGbNQXhlZpCIdq29JpQx+HVilYandZez0yqrKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:12.066251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2de33094064d2165d9c5500fae30b8ba78ffc1f896e23217bce8bf65f00160e7","sha256:fc08b06389754bd37a6a7aa1b0405b6906c4bc15b5ec2270443bd56b1ba26e9e"],"state_sha256":"b3735d0e83db577b5cbfec125c11d72d303887efde8823d0c71cbe3b4ab41081"}