{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KBDLMYTC6QI35FOMWC2CID2G6H","short_pith_number":"pith:KBDLMYTC","canonical_record":{"source":{"id":"1201.6453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-31T06:11:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb74989151b1e450741a1ab494620135860fad58f4572f33abcf62ab279ed866","abstract_canon_sha256":"addd27ad19cb1328f60127fa449896811cf88231b0a3c03f6ac7604e7eff3b93"},"schema_version":"1.0"},"canonical_sha256":"5046b66262f411be95ccb0b4240f46f1e1296f736fd696a0ac723dfb21c3cbd2","source":{"kind":"arxiv","id":"1201.6453","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6453","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6453v3","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6453","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"KBDLMYTC6QI3","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KBDLMYTC6QI35FOM","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KBDLMYTC","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KBDLMYTC6QI35FOMWC2CID2G6H","target":"record","payload":{"canonical_record":{"source":{"id":"1201.6453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-31T06:11:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb74989151b1e450741a1ab494620135860fad58f4572f33abcf62ab279ed866","abstract_canon_sha256":"addd27ad19cb1328f60127fa449896811cf88231b0a3c03f6ac7604e7eff3b93"},"schema_version":"1.0"},"canonical_sha256":"5046b66262f411be95ccb0b4240f46f1e1296f736fd696a0ac723dfb21c3cbd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:14.234259Z","signature_b64":"vfhOeYKJ513vlb3LuzJ2MxZr2VPXkmG2TmoEcgyqsDr1SP4TlQVd742eheALC+OpR2q6V0nCS0vhyP8iZLuuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5046b66262f411be95ccb0b4240f46f1e1296f736fd696a0ac723dfb21c3cbd2","last_reissued_at":"2026-05-18T03:51:14.233806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:14.233806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.6453","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-18T03:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FItq2Ktu/np/K/NobLMp3XKYF5VRDgsfXPZCC2B6KCICTuR6xr7+DiMlHqb7ySeKHyvbmM0Ti5o6FVzJekHXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:18:12.483652Z"},"content_sha256":"d4c259c7b798d9822bf43e7c08dbc01a5320477a2aff78e82e827c1db384c69a","schema_version":"1.0","event_id":"sha256:d4c259c7b798d9822bf43e7c08dbc01a5320477a2aff78e82e827c1db384c69a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KBDLMYTC6QI35FOMWC2CID2G6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Greedy Algorithm of Data-Dependent User Selection for Fast Fading Gaussian Vector Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Keigo Takeuchi, Tsutomu Kawabata","submitted_at":"2012-01-31T06:11:15Z","abstract_excerpt":"User selection (US) with Zero-forcing beamforming is considered in fast fading Gaussian vector broadcast channels with perfect channel state information (CSI) at the transmitter. A novel criterion for US is proposed, which depends on both CSI and the data symbols, while conventional criteria only depend on CSI. Since the optimization of US based on the proposed criterion is infeasible, a greedy algorithm of data-dependent US is proposed to perform the optimization approximately. An overhead issue arises in fast fading channels: On every update of US, the transmitter might inform each user whet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6453","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-18T03:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7/ndQZ6RZ/MEgmL1lppUzkqJP0fkzuENQPxryK7tH6jAgj2gKbmBGx0Dt4v/RbjEWKKUQtvcqeM4rZmsg0eCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:18:12.484424Z"},"content_sha256":"b16497ac1b41d428f7c1dfa3514105b133fbb04b88bfe149e20e1dc003ab3648","schema_version":"1.0","event_id":"sha256:b16497ac1b41d428f7c1dfa3514105b133fbb04b88bfe149e20e1dc003ab3648"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBDLMYTC6QI35FOMWC2CID2G6H/bundle.json","state_url":"https://pith.science/pith/KBDLMYTC6QI35FOMWC2CID2G6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBDLMYTC6QI35FOMWC2CID2G6H/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-11T17:18:12Z","links":{"resolver":"https://pith.science/pith/KBDLMYTC6QI35FOMWC2CID2G6H","bundle":"https://pith.science/pith/KBDLMYTC6QI35FOMWC2CID2G6H/bundle.json","state":"https://pith.science/pith/KBDLMYTC6QI35FOMWC2CID2G6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBDLMYTC6QI35FOMWC2CID2G6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KBDLMYTC6QI35FOMWC2CID2G6H","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":"addd27ad19cb1328f60127fa449896811cf88231b0a3c03f6ac7604e7eff3b93","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-31T06:11:15Z","title_canon_sha256":"bb74989151b1e450741a1ab494620135860fad58f4572f33abcf62ab279ed866"},"schema_version":"1.0","source":{"id":"1201.6453","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6453","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6453v3","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6453","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"KBDLMYTC6QI3","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KBDLMYTC6QI35FOM","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KBDLMYTC","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:b16497ac1b41d428f7c1dfa3514105b133fbb04b88bfe149e20e1dc003ab3648","target":"graph","created_at":"2026-05-18T03:51:14Z","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":"User selection (US) with Zero-forcing beamforming is considered in fast fading Gaussian vector broadcast channels with perfect channel state information (CSI) at the transmitter. A novel criterion for US is proposed, which depends on both CSI and the data symbols, while conventional criteria only depend on CSI. Since the optimization of US based on the proposed criterion is infeasible, a greedy algorithm of data-dependent US is proposed to perform the optimization approximately. An overhead issue arises in fast fading channels: On every update of US, the transmitter might inform each user whet","authors_text":"Keigo Takeuchi, Tsutomu Kawabata","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-31T06:11:15Z","title":"A Greedy Algorithm of Data-Dependent User Selection for Fast Fading Gaussian Vector Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6453","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:d4c259c7b798d9822bf43e7c08dbc01a5320477a2aff78e82e827c1db384c69a","target":"record","created_at":"2026-05-18T03:51:14Z","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":"addd27ad19cb1328f60127fa449896811cf88231b0a3c03f6ac7604e7eff3b93","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-31T06:11:15Z","title_canon_sha256":"bb74989151b1e450741a1ab494620135860fad58f4572f33abcf62ab279ed866"},"schema_version":"1.0","source":{"id":"1201.6453","kind":"arxiv","version":3}},"canonical_sha256":"5046b66262f411be95ccb0b4240f46f1e1296f736fd696a0ac723dfb21c3cbd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5046b66262f411be95ccb0b4240f46f1e1296f736fd696a0ac723dfb21c3cbd2","first_computed_at":"2026-05-18T03:51:14.233806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:14.233806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vfhOeYKJ513vlb3LuzJ2MxZr2VPXkmG2TmoEcgyqsDr1SP4TlQVd742eheALC+OpR2q6V0nCS0vhyP8iZLuuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:14.234259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6453","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4c259c7b798d9822bf43e7c08dbc01a5320477a2aff78e82e827c1db384c69a","sha256:b16497ac1b41d428f7c1dfa3514105b133fbb04b88bfe149e20e1dc003ab3648"],"state_sha256":"45db43b5e6cd98498ba85cc2aeba978bb6ae4eba62fc5dbd1c1b34060e328dac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uu8MvjvardWR9oNFClnp4270jEeuxIqIBvow7Y8qkl8+w1dMH5QIU3T/oDEUkDdbTUHjwT+SmMI4gZv7n617BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:18:12.488456Z","bundle_sha256":"934de9cf0a929cbe3f45f02902c8d12a12255c2ba8137c9b4c9ee325e8315344"}}