{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NPN7PN3DMOI7LNX3YRBC544K5L","short_pith_number":"pith:NPN7PN3D","canonical_record":{"source":{"id":"1710.07617","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T17:27:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5a9f5895a98d88b203c32c895003429742578c3e31f588dba0631a03e9a63d82","abstract_canon_sha256":"522e882935a5a4362f90f4402c509d495b602ef779a8b9e75e288ceb9bfee938"},"schema_version":"1.0"},"canonical_sha256":"6bdbf7b7636391f5b6fbc4422ef38aeae694bca99be3747320937cfbd70d76a2","source":{"kind":"arxiv","id":"1710.07617","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07617","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07617v3","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07617","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"NPN7PN3DMOI7","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NPN7PN3DMOI7LNX3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NPN7PN3D","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NPN7PN3DMOI7LNX3YRBC544K5L","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07617","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T17:27:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5a9f5895a98d88b203c32c895003429742578c3e31f588dba0631a03e9a63d82","abstract_canon_sha256":"522e882935a5a4362f90f4402c509d495b602ef779a8b9e75e288ceb9bfee938"},"schema_version":"1.0"},"canonical_sha256":"6bdbf7b7636391f5b6fbc4422ef38aeae694bca99be3747320937cfbd70d76a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:10.149713Z","signature_b64":"Ztqpf1r5ekpkl+GQNoGv4/SX3OewVCkcu796Z8ga84tIs+3HN919cv4LmLkhmFYTy+To2w8r09+cuHmXrPTJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bdbf7b7636391f5b6fbc4422ef38aeae694bca99be3747320937cfbd70d76a2","last_reissued_at":"2026-05-18T00:01:10.149076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:10.149076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07617","source_version":3,"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:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aoZ3fIdDDdAgNJoBorvfnWQiQPcy0dSPRcJS247GQODCjFWBtsbBTPlJqtSr0zR3P+UNJyxu6hrp035AVhWMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:05:40.766380Z"},"content_sha256":"f76f546d9a2429b43c717409b019abc69b457c2d228f716cb7067a8494119a99","schema_version":"1.0","event_id":"sha256:f76f546d9a2429b43c717409b019abc69b457c2d228f716cb7067a8494119a99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NPN7PN3DMOI7LNX3YRBC544K5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Resource Block Allocation With Limited Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Leshem, Ilai Bistritz","submitted_at":"2017-10-20T17:27:51Z","abstract_excerpt":"Consider a channel allocation problem over a frequency-selective channel.There are K channels (frequency bands) and N users such that K=bN for some positive integer b. We want to allocate b channels (or resource blocks) to each user. Due to the nature of the frequency-selective channel, each user considers some channels to be better than others. The optimal solution to this resource allocation problem can be computed using the Hungarian algorithm. However, this requires knowledge of the numerical value of all the channel gains, which makes this approach impractical for large networks. We sugge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07617","kind":"arxiv","version":3},"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:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/X9xnbT4CuWZhzSnomSt5k7OT0F2uI5T9NOD1Fxbh7XqfJbA5/swt1YhQCwrdPtOZ7HfRTh9+w/P0sORh1kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:05:40.766764Z"},"content_sha256":"862156d7d3d68798a258ec2260640576c6796df0a22b866c6213a45ede41db83","schema_version":"1.0","event_id":"sha256:862156d7d3d68798a258ec2260640576c6796df0a22b866c6213a45ede41db83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NPN7PN3DMOI7LNX3YRBC544K5L/bundle.json","state_url":"https://pith.science/pith/NPN7PN3DMOI7LNX3YRBC544K5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NPN7PN3DMOI7LNX3YRBC544K5L/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-05-31T08:05:40Z","links":{"resolver":"https://pith.science/pith/NPN7PN3DMOI7LNX3YRBC544K5L","bundle":"https://pith.science/pith/NPN7PN3DMOI7LNX3YRBC544K5L/bundle.json","state":"https://pith.science/pith/NPN7PN3DMOI7LNX3YRBC544K5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NPN7PN3DMOI7LNX3YRBC544K5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NPN7PN3DMOI7LNX3YRBC544K5L","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":"522e882935a5a4362f90f4402c509d495b602ef779a8b9e75e288ceb9bfee938","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T17:27:51Z","title_canon_sha256":"5a9f5895a98d88b203c32c895003429742578c3e31f588dba0631a03e9a63d82"},"schema_version":"1.0","source":{"id":"1710.07617","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07617","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07617v3","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07617","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"NPN7PN3DMOI7","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NPN7PN3DMOI7LNX3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NPN7PN3D","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:862156d7d3d68798a258ec2260640576c6796df0a22b866c6213a45ede41db83","target":"graph","created_at":"2026-05-18T00:01:10Z","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":"Consider a channel allocation problem over a frequency-selective channel.There are K channels (frequency bands) and N users such that K=bN for some positive integer b. We want to allocate b channels (or resource blocks) to each user. Due to the nature of the frequency-selective channel, each user considers some channels to be better than others. The optimal solution to this resource allocation problem can be computed using the Hungarian algorithm. However, this requires knowledge of the numerical value of all the channel gains, which makes this approach impractical for large networks. We sugge","authors_text":"Amir Leshem, Ilai Bistritz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T17:27:51Z","title":"Asymptotically Optimal Resource Block Allocation With Limited Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07617","kind":"arxiv","version":3},"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:f76f546d9a2429b43c717409b019abc69b457c2d228f716cb7067a8494119a99","target":"record","created_at":"2026-05-18T00:01:10Z","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":"522e882935a5a4362f90f4402c509d495b602ef779a8b9e75e288ceb9bfee938","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T17:27:51Z","title_canon_sha256":"5a9f5895a98d88b203c32c895003429742578c3e31f588dba0631a03e9a63d82"},"schema_version":"1.0","source":{"id":"1710.07617","kind":"arxiv","version":3}},"canonical_sha256":"6bdbf7b7636391f5b6fbc4422ef38aeae694bca99be3747320937cfbd70d76a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bdbf7b7636391f5b6fbc4422ef38aeae694bca99be3747320937cfbd70d76a2","first_computed_at":"2026-05-18T00:01:10.149076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:10.149076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ztqpf1r5ekpkl+GQNoGv4/SX3OewVCkcu796Z8ga84tIs+3HN919cv4LmLkhmFYTy+To2w8r09+cuHmXrPTJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:10.149713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07617","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f76f546d9a2429b43c717409b019abc69b457c2d228f716cb7067a8494119a99","sha256:862156d7d3d68798a258ec2260640576c6796df0a22b866c6213a45ede41db83"],"state_sha256":"70d96ac05b1a6001151d3e25ab00db94d91a1f6ac8bdd84ddfc1e07131066720"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eb3QbRZnbFQHFhtYTbEyL7mU6k97X8iALsrdpwZ/icnMunqV/7AEIw0B2HvH/zyMkzXjJ+oCxq92iILuURiyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:05:40.769458Z","bundle_sha256":"52c2823c40c914411be49ecb4ccbec0acd1bc0777a1ac0069c6478cae738b79f"}}