{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WODOCZTVYUGQR2PK46LPC7KH5F","short_pith_number":"pith:WODOCZTV","canonical_record":{"source":{"id":"1802.10197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-27T22:41:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"475924e02ebcde5851f45515b82b1cf29a0e3aabac028b15516d8b14eb5561bb","abstract_canon_sha256":"1600be0b3f131e0a7ac6e6b17b1f417d5434b9491f185e098167fc6593f1ceeb"},"schema_version":"1.0"},"canonical_sha256":"b386e16675c50d08e9eae796f17d47e971fd82f8a5b1d2598034196480f0c4b8","source":{"kind":"arxiv","id":"1802.10197","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10197","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10197v2","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10197","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"pith_short_12","alias_value":"WODOCZTVYUGQ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WODOCZTVYUGQR2PK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WODOCZTV","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WODOCZTVYUGQR2PK46LPC7KH5F","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-27T22:41:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"475924e02ebcde5851f45515b82b1cf29a0e3aabac028b15516d8b14eb5561bb","abstract_canon_sha256":"1600be0b3f131e0a7ac6e6b17b1f417d5434b9491f185e098167fc6593f1ceeb"},"schema_version":"1.0"},"canonical_sha256":"b386e16675c50d08e9eae796f17d47e971fd82f8a5b1d2598034196480f0c4b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:25.534274Z","signature_b64":"TeTCNEd6mJp40Z08E3dElvHFz+sYoyCWOJwnvwjzi1Kpg9kOpSJ2RQ7b1WFizue4DSXNi5cMHrZpBoURzRbDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b386e16675c50d08e9eae796f17d47e971fd82f8a5b1d2598034196480f0c4b8","last_reissued_at":"2026-05-18T00:16:25.533858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:25.533858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10197","source_version":2,"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:16:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVEbaYu0PcjXrHBmChPHZoKIs6a5tse6YrckTGJ62VhpVMjtY+ghuKFQzlnKKbs6y6OXretyRYibaqoqHtpMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:06:40.370766Z"},"content_sha256":"48fb6b1e13f3790f90555f597c0e56b7b99d7bbd0bfdd1f927b5d432610fe45a","schema_version":"1.0","event_id":"sha256:48fb6b1e13f3790f90555f597c0e56b7b99d7bbd0bfdd1f927b5d432610fe45a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WODOCZTVYUGQR2PK46LPC7KH5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fractional Programming for Communication Systems--Part II: Uplink Scheduling via Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kaiming Shen, Wei Yu","submitted_at":"2018-02-27T22:41:27Z","abstract_excerpt":"This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the disc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10197","kind":"arxiv","version":2},"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:16:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpOzapUTkUCBM/6fu4qhvKtmwlpjSCi603//3WW9gPOmzHERRHmP2aqZSoeGK+8iMpGXsU+kKBdRoiSMJ5t6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:06:40.371406Z"},"content_sha256":"4855ac1f7c9ae6ec638713704d6e23dc24529dc33472c47640175d415952fa00","schema_version":"1.0","event_id":"sha256:4855ac1f7c9ae6ec638713704d6e23dc24529dc33472c47640175d415952fa00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WODOCZTVYUGQR2PK46LPC7KH5F/bundle.json","state_url":"https://pith.science/pith/WODOCZTVYUGQR2PK46LPC7KH5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WODOCZTVYUGQR2PK46LPC7KH5F/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-31T21:06:40Z","links":{"resolver":"https://pith.science/pith/WODOCZTVYUGQR2PK46LPC7KH5F","bundle":"https://pith.science/pith/WODOCZTVYUGQR2PK46LPC7KH5F/bundle.json","state":"https://pith.science/pith/WODOCZTVYUGQR2PK46LPC7KH5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WODOCZTVYUGQR2PK46LPC7KH5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WODOCZTVYUGQR2PK46LPC7KH5F","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":"1600be0b3f131e0a7ac6e6b17b1f417d5434b9491f185e098167fc6593f1ceeb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-27T22:41:27Z","title_canon_sha256":"475924e02ebcde5851f45515b82b1cf29a0e3aabac028b15516d8b14eb5561bb"},"schema_version":"1.0","source":{"id":"1802.10197","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10197","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10197v2","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10197","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"pith_short_12","alias_value":"WODOCZTVYUGQ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WODOCZTVYUGQR2PK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WODOCZTV","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:4855ac1f7c9ae6ec638713704d6e23dc24529dc33472c47640175d415952fa00","target":"graph","created_at":"2026-05-18T00:16:25Z","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 two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the disc","authors_text":"Kaiming Shen, Wei Yu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-27T22:41:27Z","title":"Fractional Programming for Communication Systems--Part II: Uplink Scheduling via Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10197","kind":"arxiv","version":2},"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:48fb6b1e13f3790f90555f597c0e56b7b99d7bbd0bfdd1f927b5d432610fe45a","target":"record","created_at":"2026-05-18T00:16:25Z","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":"1600be0b3f131e0a7ac6e6b17b1f417d5434b9491f185e098167fc6593f1ceeb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-27T22:41:27Z","title_canon_sha256":"475924e02ebcde5851f45515b82b1cf29a0e3aabac028b15516d8b14eb5561bb"},"schema_version":"1.0","source":{"id":"1802.10197","kind":"arxiv","version":2}},"canonical_sha256":"b386e16675c50d08e9eae796f17d47e971fd82f8a5b1d2598034196480f0c4b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b386e16675c50d08e9eae796f17d47e971fd82f8a5b1d2598034196480f0c4b8","first_computed_at":"2026-05-18T00:16:25.533858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:25.533858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TeTCNEd6mJp40Z08E3dElvHFz+sYoyCWOJwnvwjzi1Kpg9kOpSJ2RQ7b1WFizue4DSXNi5cMHrZpBoURzRbDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:25.534274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10197","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48fb6b1e13f3790f90555f597c0e56b7b99d7bbd0bfdd1f927b5d432610fe45a","sha256:4855ac1f7c9ae6ec638713704d6e23dc24529dc33472c47640175d415952fa00"],"state_sha256":"5c2ac6cee5f53793b8d37778c30dbb6647d409edfc98998decf03b1783f685a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S0ncKJ1AkIjt+aIF7YcDsk2P+H+kbFi1WDz8ZUWYWls+OL+iHglCfDsBpcak3zdOP8B1IFRsoBX4QHgCyU5yCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:06:40.375743Z","bundle_sha256":"1bd9296032ec1c2a8e13ba26269fef58a3d17573182da8d4f561ef5890c3bf95"}}