{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UXJZWBRLE63YSGIESOY257XHRX","short_pith_number":"pith:UXJZWBRL","schema_version":"1.0","canonical_sha256":"a5d39b062b27b789190493b1aefee78dcf9db10c88d292f8b6ffe3780fbecdf8","source":{"kind":"arxiv","id":"1605.01331","version":1},"attestation_state":"computed","paper":{"title":"Linear Network Coding Capacity Region of The Smart Repeater with Broadcast Erasure Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, Jaemin Han","submitted_at":"2016-05-04T16:19:51Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1605.01331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-04T16:19:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c0fffefeb3e0190fd28c7ecff9c57f20fa3386af01da005de33c0b18e8c3eea1","abstract_canon_sha256":"8f841a7bdfbc83f0b1e614c0febb41f284f7a296210d2c7c843d18321d35686a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:37.109052Z","signature_b64":"NjVg0rjk1ABA/+fNRWQQWrSIqky7YxtVWtlZee1QN6C3oSsV5TrFXHVnDkc9aXSftE6s8+wy50TXm/ZMiEjeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5d39b062b27b789190493b1aefee78dcf9db10c88d292f8b6ffe3780fbecdf8","last_reissued_at":"2026-05-18T01:15:37.108354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:37.108354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Network Coding Capacity Region of The Smart Repeater with Broadcast Erasure Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, Jaemin Han","submitted_at":"2016-05-04T16:19:51Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01331","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.01331","created_at":"2026-05-18T01:15:37.108470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01331v1","created_at":"2026-05-18T01:15:37.108470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01331","created_at":"2026-05-18T01:15:37.108470+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXJZWBRLE63Y","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXJZWBRLE63YSGIE","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXJZWBRL","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UXJZWBRLE63YSGIESOY257XHRX","json":"https://pith.science/pith/UXJZWBRLE63YSGIESOY257XHRX.json","graph_json":"https://pith.science/api/pith-number/UXJZWBRLE63YSGIESOY257XHRX/graph.json","events_json":"https://pith.science/api/pith-number/UXJZWBRLE63YSGIESOY257XHRX/events.json","paper":"https://pith.science/paper/UXJZWBRL"},"agent_actions":{"view_html":"https://pith.science/pith/UXJZWBRLE63YSGIESOY257XHRX","download_json":"https://pith.science/pith/UXJZWBRLE63YSGIESOY257XHRX.json","view_paper":"https://pith.science/paper/UXJZWBRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01331&json=true","fetch_graph":"https://pith.science/api/pith-number/UXJZWBRLE63YSGIESOY257XHRX/graph.json","fetch_events":"https://pith.science/api/pith-number/UXJZWBRLE63YSGIESOY257XHRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXJZWBRLE63YSGIESOY257XHRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXJZWBRLE63YSGIESOY257XHRX/action/storage_attestation","attest_author":"https://pith.science/pith/UXJZWBRLE63YSGIESOY257XHRX/action/author_attestation","sign_citation":"https://pith.science/pith/UXJZWBRLE63YSGIESOY257XHRX/action/citation_signature","submit_replication":"https://pith.science/pith/UXJZWBRLE63YSGIESOY257XHRX/action/replication_record"}},"created_at":"2026-05-18T01:15:37.108470+00:00","updated_at":"2026-05-18T01:15:37.108470+00:00"}