{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KC3IO7KT5NN3Y4SSEZKNFXZ7M2","short_pith_number":"pith:KC3IO7KT","canonical_record":{"source":{"id":"1212.5284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-20T22:12:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dc429cb507d7b6413491e2f0a72fbaf2a62f62ed127595ce50acea96f9429459","abstract_canon_sha256":"5fa9d40ae7805d20d85511aa97a00a9e98bda0e5a648ee078365ff640fb80e5d"},"schema_version":"1.0"},"canonical_sha256":"50b6877d53eb5bbc72522654d2df3f66bbce4c2924a2ec33590eccbd5c5d8691","source":{"kind":"arxiv","id":"1212.5284","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5284","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5284v1","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5284","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"KC3IO7KT5NN3","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KC3IO7KT5NN3Y4SS","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KC3IO7KT","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KC3IO7KT5NN3Y4SSEZKNFXZ7M2","target":"record","payload":{"canonical_record":{"source":{"id":"1212.5284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-20T22:12:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dc429cb507d7b6413491e2f0a72fbaf2a62f62ed127595ce50acea96f9429459","abstract_canon_sha256":"5fa9d40ae7805d20d85511aa97a00a9e98bda0e5a648ee078365ff640fb80e5d"},"schema_version":"1.0"},"canonical_sha256":"50b6877d53eb5bbc72522654d2df3f66bbce4c2924a2ec33590eccbd5c5d8691","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:13.607471Z","signature_b64":"lv+sfc9Ygc/AOIWzPmWeExabIC89/YvoIrhWFBfNapa6NAndMc8s2K5f9u0LarOpT85Uw+geTYmKQhFnDie6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50b6877d53eb5bbc72522654d2df3f66bbce4c2924a2ec33590eccbd5c5d8691","last_reissued_at":"2026-05-18T03:06:13.607078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:13.607078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.5284","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-18T03:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1TsX7UHOt4qaC6KSXLcxSHmO1+RZBvPAG8mRsctTCUNlzUEgXRUAnwk7fSmTP5OyWIKGTszbFB69emg9uxq5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:06:53.286126Z"},"content_sha256":"6119e2b30053d0f48e4897ebbb5ea7699c5f9b7fc6e352894907ed5b758669d5","schema_version":"1.0","event_id":"sha256:6119e2b30053d0f48e4897ebbb5ea7699c5f9b7fc6e352894907ed5b758669d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KC3IO7KT5NN3Y4SSEZKNFXZ7M2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual-Based Bounds for Resource Allocation in Zero-forcing Beamforming OFDMA-SDMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andre Girard, Diego Perea-Vega, Jean-Francois Frigon","submitted_at":"2012-12-20T22:12:15Z","abstract_excerpt":"We consider multi-antenna base stations using orthogonal frequency division multiple access and space division multiple access techniques to serve single-antenna users. Some users, called real-time users, have minimum rate requirements and must be served in the current time slot while others, called non real-time users, do not have strict timing constraints and are served on a best-effort basis. The resource allocation problem is to find the assignment of users to subcarriers and the transmit beamforming vectors that maximize the total user rates subject to power and minimum rate constraints. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5284","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-18T03:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WiBp/rACAMnPI0aYuxENcYJzfMOZUYfmY1zKjg5r+5rWbrdT9qXOSWrCK45aR/jg6hYhyR18q5O5wL0XM//9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:06:53.286696Z"},"content_sha256":"574aaad32672610f63dd7244a6ff2ec4b513c359e5bd4d432a94fba736eac47b","schema_version":"1.0","event_id":"sha256:574aaad32672610f63dd7244a6ff2ec4b513c359e5bd4d432a94fba736eac47b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KC3IO7KT5NN3Y4SSEZKNFXZ7M2/bundle.json","state_url":"https://pith.science/pith/KC3IO7KT5NN3Y4SSEZKNFXZ7M2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KC3IO7KT5NN3Y4SSEZKNFXZ7M2/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-02T11:06:53Z","links":{"resolver":"https://pith.science/pith/KC3IO7KT5NN3Y4SSEZKNFXZ7M2","bundle":"https://pith.science/pith/KC3IO7KT5NN3Y4SSEZKNFXZ7M2/bundle.json","state":"https://pith.science/pith/KC3IO7KT5NN3Y4SSEZKNFXZ7M2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KC3IO7KT5NN3Y4SSEZKNFXZ7M2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KC3IO7KT5NN3Y4SSEZKNFXZ7M2","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":"5fa9d40ae7805d20d85511aa97a00a9e98bda0e5a648ee078365ff640fb80e5d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-20T22:12:15Z","title_canon_sha256":"dc429cb507d7b6413491e2f0a72fbaf2a62f62ed127595ce50acea96f9429459"},"schema_version":"1.0","source":{"id":"1212.5284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5284","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5284v1","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5284","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"KC3IO7KT5NN3","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KC3IO7KT5NN3Y4SS","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KC3IO7KT","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:574aaad32672610f63dd7244a6ff2ec4b513c359e5bd4d432a94fba736eac47b","target":"graph","created_at":"2026-05-18T03:06:13Z","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":"We consider multi-antenna base stations using orthogonal frequency division multiple access and space division multiple access techniques to serve single-antenna users. Some users, called real-time users, have minimum rate requirements and must be served in the current time slot while others, called non real-time users, do not have strict timing constraints and are served on a best-effort basis. The resource allocation problem is to find the assignment of users to subcarriers and the transmit beamforming vectors that maximize the total user rates subject to power and minimum rate constraints. ","authors_text":"Andre Girard, Diego Perea-Vega, Jean-Francois Frigon","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-20T22:12:15Z","title":"Dual-Based Bounds for Resource Allocation in Zero-forcing Beamforming OFDMA-SDMA Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5284","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:6119e2b30053d0f48e4897ebbb5ea7699c5f9b7fc6e352894907ed5b758669d5","target":"record","created_at":"2026-05-18T03:06:13Z","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":"5fa9d40ae7805d20d85511aa97a00a9e98bda0e5a648ee078365ff640fb80e5d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-20T22:12:15Z","title_canon_sha256":"dc429cb507d7b6413491e2f0a72fbaf2a62f62ed127595ce50acea96f9429459"},"schema_version":"1.0","source":{"id":"1212.5284","kind":"arxiv","version":1}},"canonical_sha256":"50b6877d53eb5bbc72522654d2df3f66bbce4c2924a2ec33590eccbd5c5d8691","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50b6877d53eb5bbc72522654d2df3f66bbce4c2924a2ec33590eccbd5c5d8691","first_computed_at":"2026-05-18T03:06:13.607078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:13.607078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lv+sfc9Ygc/AOIWzPmWeExabIC89/YvoIrhWFBfNapa6NAndMc8s2K5f9u0LarOpT85Uw+geTYmKQhFnDie6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:13.607471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.5284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6119e2b30053d0f48e4897ebbb5ea7699c5f9b7fc6e352894907ed5b758669d5","sha256:574aaad32672610f63dd7244a6ff2ec4b513c359e5bd4d432a94fba736eac47b"],"state_sha256":"577bb21b56959042f90a91a261724e8d22e412adc798870c663f1cd57c2faad2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KM/CJmtD9ibpvu2qm2BNyF7N5K9H/Ce0UX9R+maUkwvjUrPl9ZqbuhiP80PIZegoTeNURs/VEnKDB7WKaTC6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:06:53.289443Z","bundle_sha256":"23ec795b5c9d0a33311055656f51e641684a2e511d07d85f766ac5556e277f07"}}