{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MJELPZGYV4JEQEHVO33KTWX4VL","short_pith_number":"pith:MJELPZGY","schema_version":"1.0","canonical_sha256":"6248b7e4d8af124810f576f6a9dafcaaf8ea9c917a3d3e385c559290a9fbcfff","source":{"kind":"arxiv","id":"1608.03664","version":1},"attestation_state":"computed","paper":{"title":"To Prolong the Lifetime of Wireless Sensor Networks: The Min-max Fair Scheduling in a Multi-access Contra-Polymatroid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Huifang Chen, Peiliang Qiu, Xiaomao Mao","submitted_at":"2016-08-12T03:10:15Z","abstract_excerpt":"From an information-theoretic point of view, we investigate the min-max power scheduling problem in multi-access transmission. We prove that the min-max optimal vector in a contrapolymatroid is the base with the minimal distance to the equal allocation vector. Because we can realize any base of the contra-polymatroid by time sharing among the vertices, the problem searching for the min-max optimal vector is converted to a convex optimization problem solving the time sharing coefficients. Different from the traditional algorithms exploiting bottleneck link or waterfilling, the proposed method s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1608.03664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T03:10:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"33aed447a690e6d21fe1de9eb39350a3bfa52d8e47480c8178493b7f743926e5","abstract_canon_sha256":"c886c00afafa44dc3f734c526fb104b9b19ddfc4e16c3787ba38119790412079"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:12.170762Z","signature_b64":"ZbFfZ7UiJioLRnuY7a0rsJsYEHxZd4ddAas5C2fAuOZTUBjCS8+x5FU0nVh2H6uLA7miSQ3W/7/KGJjuuSYLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6248b7e4d8af124810f576f6a9dafcaaf8ea9c917a3d3e385c559290a9fbcfff","last_reissued_at":"2026-05-18T01:09:12.170224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:12.170224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"To Prolong the Lifetime of Wireless Sensor Networks: The Min-max Fair Scheduling in a Multi-access Contra-Polymatroid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Huifang Chen, Peiliang Qiu, Xiaomao Mao","submitted_at":"2016-08-12T03:10:15Z","abstract_excerpt":"From an information-theoretic point of view, we investigate the min-max power scheduling problem in multi-access transmission. We prove that the min-max optimal vector in a contrapolymatroid is the base with the minimal distance to the equal allocation vector. Because we can realize any base of the contra-polymatroid by time sharing among the vertices, the problem searching for the min-max optimal vector is converted to a convex optimization problem solving the time sharing coefficients. Different from the traditional algorithms exploiting bottleneck link or waterfilling, the proposed method s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03664","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.03664","created_at":"2026-05-18T01:09:12.170331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03664v1","created_at":"2026-05-18T01:09:12.170331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03664","created_at":"2026-05-18T01:09:12.170331+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJELPZGYV4JE","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJELPZGYV4JEQEHV","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJELPZGY","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL","json":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL.json","graph_json":"https://pith.science/api/pith-number/MJELPZGYV4JEQEHVO33KTWX4VL/graph.json","events_json":"https://pith.science/api/pith-number/MJELPZGYV4JEQEHVO33KTWX4VL/events.json","paper":"https://pith.science/paper/MJELPZGY"},"agent_actions":{"view_html":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL","download_json":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL.json","view_paper":"https://pith.science/paper/MJELPZGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03664&json=true","fetch_graph":"https://pith.science/api/pith-number/MJELPZGYV4JEQEHVO33KTWX4VL/graph.json","fetch_events":"https://pith.science/api/pith-number/MJELPZGYV4JEQEHVO33KTWX4VL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL/action/storage_attestation","attest_author":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL/action/author_attestation","sign_citation":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL/action/citation_signature","submit_replication":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL/action/replication_record"}},"created_at":"2026-05-18T01:09:12.170331+00:00","updated_at":"2026-05-18T01:09:12.170331+00:00"}