{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QD6E4FGZV6EQGE6F6QP5TRRRRP","short_pith_number":"pith:QD6E4FGZ","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"},"canonical_sha256":"80fc4e14d9af890313c5f41fd9c6318bf5a9f424ab1f538c435d847041d4176b","source":{"kind":"arxiv","id":"1612.04005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04005","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04005v1","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04005","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"QD6E4FGZV6EQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QD6E4FGZV6EQGE6F","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QD6E4FGZ","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QD6E4FGZV6EQGE6F6QP5TRRRRP","target":"record","payload":{"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"},"canonical_sha256":"80fc4e14d9af890313c5f41fd9c6318bf5a9f424ab1f538c435d847041d4176b","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"},"source_kind":"arxiv","source_id":"1612.04005","source_version":1,"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:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEtuk3WrMQhGySL0hqSTq1He4v2EAcviWGTjHY222jD5XF0Hk3QuvMmexk0wKjQ+WMJSpQycI8UduJT41gBxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:36:23.792035Z"},"content_sha256":"384f5d8cbfd3c40d1f0f38c074dc8060e6bf04cc715770b24133c9d831b10010","schema_version":"1.0","event_id":"sha256:384f5d8cbfd3c40d1f0f38c074dc8060e6bf04cc715770b24133c9d831b10010"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QD6E4FGZV6EQGE6F6QP5TRRRRP","target":"graph","payload":{"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"},"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:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vy2G31INquWnMmZ+EjAQQHdasJHKG6Od4U9Rk3DQjkoiIV7bouOjbJWggr9yRSsBo7xLz/NpZJNNEi0TGkEBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:36:23.792661Z"},"content_sha256":"de12fe78bd7283d7d9a3d16cc070c4d4ca35450f050ce0d8de60b50b19c215f4","schema_version":"1.0","event_id":"sha256:de12fe78bd7283d7d9a3d16cc070c4d4ca35450f050ce0d8de60b50b19c215f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/bundle.json","state_url":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/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-01T03:36:23Z","links":{"resolver":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP","bundle":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/bundle.json","state":"https://pith.science/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QD6E4FGZV6EQGE6F6QP5TRRRRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QD6E4FGZV6EQGE6F6QP5TRRRRP","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":"2ec63ff825752964104b44e4149548364f8e0df791a8d4ad48f2543f80c4e533","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-13T03:07:43Z","title_canon_sha256":"e807e6ba739f479b0e1cfbe52255c138706b9e83903fbcb6a193e65dda6b1f44"},"schema_version":"1.0","source":{"id":"1612.04005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04005","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04005v1","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04005","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"QD6E4FGZV6EQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QD6E4FGZV6EQGE6F","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QD6E4FGZ","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:de12fe78bd7283d7d9a3d16cc070c4d4ca35450f050ce0d8de60b50b19c215f4","target":"graph","created_at":"2026-05-18T00:55:05Z","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 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","authors_text":"Rodney A. Kennedy, Xiangyun Zhou, Yirui Cong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-13T03:07:43Z","title":"Rate-Achieving Policy in Finite-Horizon Throughput Region for Multi-User Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04005","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:384f5d8cbfd3c40d1f0f38c074dc8060e6bf04cc715770b24133c9d831b10010","target":"record","created_at":"2026-05-18T00:55:05Z","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":"2ec63ff825752964104b44e4149548364f8e0df791a8d4ad48f2543f80c4e533","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-13T03:07:43Z","title_canon_sha256":"e807e6ba739f479b0e1cfbe52255c138706b9e83903fbcb6a193e65dda6b1f44"},"schema_version":"1.0","source":{"id":"1612.04005","kind":"arxiv","version":1}},"canonical_sha256":"80fc4e14d9af890313c5f41fd9c6318bf5a9f424ab1f538c435d847041d4176b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80fc4e14d9af890313c5f41fd9c6318bf5a9f424ab1f538c435d847041d4176b","first_computed_at":"2026-05-18T00:55:05.864282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:05.864282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"whiPAYRKrsE1iN+2VF1Q3ux2NeUqwaDwsHeW7BcqHmKiD62GBrtLDhkqJhyMYWakcOpCkH6qdtXnoUawVlc8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:05.864897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:384f5d8cbfd3c40d1f0f38c074dc8060e6bf04cc715770b24133c9d831b10010","sha256:de12fe78bd7283d7d9a3d16cc070c4d4ca35450f050ce0d8de60b50b19c215f4"],"state_sha256":"6fbdf85cbefd9267f9ceb8f4c991c74f39ff0cbade4b14cee2b813feec54c48a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lfTlED5n7G2PXZ7ilPkZh1Ml4rVU3BAx1g05YA1DiGCawbUOH0yL3TPeWC9K9RtMBnp9XPxRww+A2ol9w/jJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:36:23.796329Z","bundle_sha256":"2f70fc152a1e33d0411fb62400a6ea675f7ad00d53e82a5f5e413abe058cd0b3"}}