{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UXJZWBRLE63YSGIESOY257XHRX","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":"8f841a7bdfbc83f0b1e614c0febb41f284f7a296210d2c7c843d18321d35686a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-04T16:19:51Z","title_canon_sha256":"c0fffefeb3e0190fd28c7ecff9c57f20fa3386af01da005de33c0b18e8c3eea1"},"schema_version":"1.0","source":{"id":"1605.01331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01331","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01331v1","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01331","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"UXJZWBRLE63Y","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UXJZWBRLE63YSGIE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UXJZWBRL","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:a55a70b1079508bec3cf0e8a208ae53922a04c9711e86eb29c26c409bfe49ca1","target":"graph","created_at":"2026-05-18T01:15:37Z","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":"This work considers the smart repeater network where a single source $s$ wants to send two independent packet streams to destinations $\\{d_1,d_2\\}$ with the help of relay $r$. The transmission from $s$ or $r$ is modeled by packet erasure channels: For each time slot, a packet transmitted by $s$ may be received, with some probabilities, by a random subset of $\\{d_1,d_2,r\\}$; and those transmitted by $r$ will be received by a random subset of $\\{d_1,d_2\\}$. Interference is avoided by allowing at most one of $\\{s,r\\}$ to transmit in each time slot. One example of this model is any cellular networ","authors_text":"Chih-Chun Wang, Jaemin Han","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-04T16:19:51Z","title":"Linear Network Coding Capacity Region of The Smart Repeater with Broadcast Erasure Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01331","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:fe45ca5721adc610ece51966c7ba4bfc45529cfd3f74fccefc73129f3d4d645c","target":"record","created_at":"2026-05-18T01:15:37Z","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":"8f841a7bdfbc83f0b1e614c0febb41f284f7a296210d2c7c843d18321d35686a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-04T16:19:51Z","title_canon_sha256":"c0fffefeb3e0190fd28c7ecff9c57f20fa3386af01da005de33c0b18e8c3eea1"},"schema_version":"1.0","source":{"id":"1605.01331","kind":"arxiv","version":1}},"canonical_sha256":"a5d39b062b27b789190493b1aefee78dcf9db10c88d292f8b6ffe3780fbecdf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5d39b062b27b789190493b1aefee78dcf9db10c88d292f8b6ffe3780fbecdf8","first_computed_at":"2026-05-18T01:15:37.108354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:37.108354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NjVg0rjk1ABA/+fNRWQQWrSIqky7YxtVWtlZee1QN6C3oSsV5TrFXHVnDkc9aXSftE6s8+wy50TXm/ZMiEjeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:37.109052Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe45ca5721adc610ece51966c7ba4bfc45529cfd3f74fccefc73129f3d4d645c","sha256:a55a70b1079508bec3cf0e8a208ae53922a04c9711e86eb29c26c409bfe49ca1"],"state_sha256":"34dcd6d64102b036e5bd9436d80e3a3e98f3341dd7730254dfcc448a66dbe620"}