{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KTUBQYHQDQORVTL6XFFQ6ZTXQ4","short_pith_number":"pith:KTUBQYHQ","canonical_record":{"source":{"id":"1008.1372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-08-07T23:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"5584a61926ac73b9a329848d01c032d3d983d6d0c30b6951abea49d7da1f55fa","abstract_canon_sha256":"dc984b08f1c7b7bf03d57c5c3195ef66eb57030b78bf314bfed84184abd35a1a"},"schema_version":"1.0"},"canonical_sha256":"54e81860f01c1d1acd7eb94b0f6677872da1300658928a4b6f6634992065de01","source":{"kind":"arxiv","id":"1008.1372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1372","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1372v1","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1372","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"KTUBQYHQDQOR","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KTUBQYHQDQORVTL6","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KTUBQYHQ","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KTUBQYHQDQORVTL6XFFQ6ZTXQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1008.1372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-08-07T23:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"5584a61926ac73b9a329848d01c032d3d983d6d0c30b6951abea49d7da1f55fa","abstract_canon_sha256":"dc984b08f1c7b7bf03d57c5c3195ef66eb57030b78bf314bfed84184abd35a1a"},"schema_version":"1.0"},"canonical_sha256":"54e81860f01c1d1acd7eb94b0f6677872da1300658928a4b6f6634992065de01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:24.385380Z","signature_b64":"rey9Elas+Tbit7oOpVSFv2/UeiEJ0ijT+4Br7LL1/6THcBaWzX7N8IrNe0/xORaCGub5NwUj27VeLpgGehtbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54e81860f01c1d1acd7eb94b0f6677872da1300658928a4b6f6634992065de01","last_reissued_at":"2026-05-18T04:42:24.384980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:24.384980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.1372","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-18T04:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hY+h5LLbHgstn9/zsx5A8BDlmPfgcqS0qiMTxLPtv57Up0Xk6hpZo05v1BBukVh+a+Zg91E1l8k2VAapKu3wBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:50:24.384255Z"},"content_sha256":"45a1d10138af0e2ddc6ff7b3615750756f862d592074f5fd33720644259884ef","schema_version":"1.0","event_id":"sha256:45a1d10138af0e2ddc6ff7b3615750756f862d592074f5fd33720644259884ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KTUBQYHQDQORVTL6XFFQ6ZTXQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Max-Min Resource Allocation for Frequency Selective Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Amir Leshem, Ephi Zehavi, Ronny Levanda, Zhu Han","submitted_at":"2010-08-07T23:35:49Z","abstract_excerpt":"In this paper, we discuss the computation of weighted max-min rate allocation using joint TDM/FDM strategies under a PSD mask constraint. We show that the weighted max-min solution allocates the rates according to a predetermined rate ratio defined by the weights, a fact that is very valuable for telecommunication service providers. Furthermore, we show that the problem can be efficiently solved using linear programming. We also discuss the resource allocation problem in the mixed services scenario where certain users have a required rate, while the others have flexible rate requirements. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1372","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-18T04:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zc1FirOXlhmYJrgs3ijRMSF78uvRzEelupbA5Wzb4uMjKTeBbGC6hQWkkYlPhFIWShk4NWBmfC3cLWboQdHPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:50:24.384623Z"},"content_sha256":"32e7be8a89bba04081d20f37cce23ce5529f560c006e0a37eba3e53e669c322c","schema_version":"1.0","event_id":"sha256:32e7be8a89bba04081d20f37cce23ce5529f560c006e0a37eba3e53e669c322c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTUBQYHQDQORVTL6XFFQ6ZTXQ4/bundle.json","state_url":"https://pith.science/pith/KTUBQYHQDQORVTL6XFFQ6ZTXQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTUBQYHQDQORVTL6XFFQ6ZTXQ4/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-30T08:50:24Z","links":{"resolver":"https://pith.science/pith/KTUBQYHQDQORVTL6XFFQ6ZTXQ4","bundle":"https://pith.science/pith/KTUBQYHQDQORVTL6XFFQ6ZTXQ4/bundle.json","state":"https://pith.science/pith/KTUBQYHQDQORVTL6XFFQ6ZTXQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTUBQYHQDQORVTL6XFFQ6ZTXQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KTUBQYHQDQORVTL6XFFQ6ZTXQ4","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":"dc984b08f1c7b7bf03d57c5c3195ef66eb57030b78bf314bfed84184abd35a1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-08-07T23:35:49Z","title_canon_sha256":"5584a61926ac73b9a329848d01c032d3d983d6d0c30b6951abea49d7da1f55fa"},"schema_version":"1.0","source":{"id":"1008.1372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1372","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1372v1","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1372","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"KTUBQYHQDQOR","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KTUBQYHQDQORVTL6","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KTUBQYHQ","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:32e7be8a89bba04081d20f37cce23ce5529f560c006e0a37eba3e53e669c322c","target":"graph","created_at":"2026-05-18T04:42:24Z","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":"In this paper, we discuss the computation of weighted max-min rate allocation using joint TDM/FDM strategies under a PSD mask constraint. We show that the weighted max-min solution allocates the rates according to a predetermined rate ratio defined by the weights, a fact that is very valuable for telecommunication service providers. Furthermore, we show that the problem can be efficiently solved using linear programming. We also discuss the resource allocation problem in the mixed services scenario where certain users have a required rate, while the others have flexible rate requirements. The ","authors_text":"Amir Leshem, Ephi Zehavi, Ronny Levanda, Zhu Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-08-07T23:35:49Z","title":"Weighted Max-Min Resource Allocation for Frequency Selective Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1372","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:45a1d10138af0e2ddc6ff7b3615750756f862d592074f5fd33720644259884ef","target":"record","created_at":"2026-05-18T04:42:24Z","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":"dc984b08f1c7b7bf03d57c5c3195ef66eb57030b78bf314bfed84184abd35a1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-08-07T23:35:49Z","title_canon_sha256":"5584a61926ac73b9a329848d01c032d3d983d6d0c30b6951abea49d7da1f55fa"},"schema_version":"1.0","source":{"id":"1008.1372","kind":"arxiv","version":1}},"canonical_sha256":"54e81860f01c1d1acd7eb94b0f6677872da1300658928a4b6f6634992065de01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54e81860f01c1d1acd7eb94b0f6677872da1300658928a4b6f6634992065de01","first_computed_at":"2026-05-18T04:42:24.384980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:24.384980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rey9Elas+Tbit7oOpVSFv2/UeiEJ0ijT+4Br7LL1/6THcBaWzX7N8IrNe0/xORaCGub5NwUj27VeLpgGehtbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:24.385380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45a1d10138af0e2ddc6ff7b3615750756f862d592074f5fd33720644259884ef","sha256:32e7be8a89bba04081d20f37cce23ce5529f560c006e0a37eba3e53e669c322c"],"state_sha256":"4e6ab9592c409b33e92c015fab530928c09687f01556fa5cc9905281c7c82073"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLjX9HnP8ZAhnSyTiiiUH8MWwU6DusCqDnZqspsui4l64cpa5HP34GCKT+Ga8Q9kgk9JgEte6jlp+is8+nTQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:50:24.386587Z","bundle_sha256":"0051aa85398d4b83991170324b47a8dfbdd5d8d85676eb3e6661400df8f48897"}}