{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QD6E4FGZV6EQGE6F6QP5TRRRRP","short_pith_number":"pith:QD6E4FGZ","schema_version":"1.0","canonical_sha256":"80fc4e14d9af890313c5f41fd9c6318bf5a9f424ab1f538c435d847041d4176b","source":{"kind":"arxiv","id":"1612.04005","version":1},"attestation_state":"computed","paper":{"title":"Rate-Achieving Policy in Finite-Horizon Throughput Region for Multi-User Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rodney A. Kennedy, Xiangyun Zhou, Yirui Cong","submitted_at":"2016-12-13T03:07:43Z","abstract_excerpt":"This paper studies a wireless network consisting of multiple transmitter-receiver pairs sharing the same spectrum where interference is regarded as noise. Previously, the throughput region of such a network was characterized for either one time slot or an infinite time horizon. This work aims to close the gap by investigating the throughput region for transmissions over a finite time horizon. We derive an efficient algorithm to examine the achievability of any given rate in the finite-horizon throughput region and provide the rate-achieving policy. The computational efficiency of our algorithm"},"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":"1612.04005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-13T03:07:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e807e6ba739f479b0e1cfbe52255c138706b9e83903fbcb6a193e65dda6b1f44","abstract_canon_sha256":"2ec63ff825752964104b44e4149548364f8e0df791a8d4ad48f2543f80c4e533"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:05.864897Z","signature_b64":"whiPAYRKrsE1iN+2VF1Q3ux2NeUqwaDwsHeW7BcqHmKiD62GBrtLDhkqJhyMYWakcOpCkH6qdtXnoUawVlc8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80fc4e14d9af890313c5f41fd9c6318bf5a9f424ab1f538c435d847041d4176b","last_reissued_at":"2026-05-18T00:55:05.864282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:05.864282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Achieving Policy in Finite-Horizon Throughput Region for Multi-User Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rodney A. Kennedy, Xiangyun Zhou, Yirui Cong","submitted_at":"2016-12-13T03:07:43Z","abstract_excerpt":"This paper studies a wireless network consisting of multiple transmitter-receiver pairs sharing the same spectrum where interference is regarded as noise. Previously, the throughput region of such a network was characterized for either one time slot or an infinite time horizon. This work aims to close the gap by investigating the throughput region for transmissions over a finite time horizon. We derive an efficient algorithm to examine the achievability of any given rate in the finite-horizon throughput region and provide the rate-achieving policy. The computational efficiency of our algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04005","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":"1612.04005","created_at":"2026-05-18T00:55:05.864379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04005v1","created_at":"2026-05-18T00:55:05.864379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04005","created_at":"2026-05-18T00:55:05.864379+00:00"},{"alias_kind":"pith_short_12","alias_value":"QD6E4FGZV6EQ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QD6E4FGZV6EQGE6F","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QD6E4FGZ","created_at":"2026-05-18T12:30:39.010887+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/QD6E4FGZV6EQGE6F6QP5TRRRRP","json":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP.json","graph_json":"https://pith.science/api/pith-number/QD6E4FGZV6EQGE6F6QP5TRRRRP/graph.json","events_json":"https://pith.science/api/pith-number/QD6E4FGZV6EQGE6F6QP5TRRRRP/events.json","paper":"https://pith.science/paper/QD6E4FGZ"},"agent_actions":{"view_html":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP","download_json":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP.json","view_paper":"https://pith.science/paper/QD6E4FGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04005&json=true","fetch_graph":"https://pith.science/api/pith-number/QD6E4FGZV6EQGE6F6QP5TRRRRP/graph.json","fetch_events":"https://pith.science/api/pith-number/QD6E4FGZV6EQGE6F6QP5TRRRRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/action/storage_attestation","attest_author":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/action/author_attestation","sign_citation":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/action/citation_signature","submit_replication":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/action/replication_record"}},"created_at":"2026-05-18T00:55:05.864379+00:00","updated_at":"2026-05-18T00:55:05.864379+00:00"}