{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MJELPZGYV4JEQEHVO33KTWX4VL","short_pith_number":"pith:MJELPZGY","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"},"canonical_sha256":"6248b7e4d8af124810f576f6a9dafcaaf8ea9c917a3d3e385c559290a9fbcfff","source":{"kind":"arxiv","id":"1608.03664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03664","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03664v1","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03664","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"MJELPZGYV4JE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MJELPZGYV4JEQEHV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MJELPZGY","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MJELPZGYV4JEQEHVO33KTWX4VL","target":"record","payload":{"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"},"canonical_sha256":"6248b7e4d8af124810f576f6a9dafcaaf8ea9c917a3d3e385c559290a9fbcfff","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"},"source_kind":"arxiv","source_id":"1608.03664","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-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkGkpJmCvpv/6cNvHhaBMJ73inkIBvwSLP15eAMJMAIzJK7KxOgFKE6JZbtTPwcrwe6cfVi5Zp/DceQBPNeLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:57:37.686494Z"},"content_sha256":"1d69610c07682a500598140aa4027d02e59e69dc501e9d812908b0d9802fcdf1","schema_version":"1.0","event_id":"sha256:1d69610c07682a500598140aa4027d02e59e69dc501e9d812908b0d9802fcdf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MJELPZGYV4JEQEHVO33KTWX4VL","target":"graph","payload":{"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"},"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-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wnn4YTRT7EA9sUEGdUVJo0TcRxAdlntp7cZnKHMKjobFg87wXWWBxwpuZWvwLPrEhO3EenQg5NDjg4LLPMZQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:57:37.686843Z"},"content_sha256":"806864e293868da5dc9a550e806238f54296cdae033807fb486df32b3c9f11be","schema_version":"1.0","event_id":"sha256:806864e293868da5dc9a550e806238f54296cdae033807fb486df32b3c9f11be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL/bundle.json","state_url":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJELPZGYV4JEQEHVO33KTWX4VL/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-03T22:57:37Z","links":{"resolver":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL","bundle":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL/bundle.json","state":"https://pith.science/pith/MJELPZGYV4JEQEHVO33KTWX4VL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJELPZGYV4JEQEHVO33KTWX4VL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MJELPZGYV4JEQEHVO33KTWX4VL","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":"c886c00afafa44dc3f734c526fb104b9b19ddfc4e16c3787ba38119790412079","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T03:10:15Z","title_canon_sha256":"33aed447a690e6d21fe1de9eb39350a3bfa52d8e47480c8178493b7f743926e5"},"schema_version":"1.0","source":{"id":"1608.03664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03664","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03664v1","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03664","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"MJELPZGYV4JE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MJELPZGYV4JEQEHV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MJELPZGY","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:806864e293868da5dc9a550e806238f54296cdae033807fb486df32b3c9f11be","target":"graph","created_at":"2026-05-18T01:09:12Z","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":"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","authors_text":"Huifang Chen, Peiliang Qiu, Xiaomao Mao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T03:10:15Z","title":"To Prolong the Lifetime of Wireless Sensor Networks: The Min-max Fair Scheduling in a Multi-access Contra-Polymatroid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03664","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:1d69610c07682a500598140aa4027d02e59e69dc501e9d812908b0d9802fcdf1","target":"record","created_at":"2026-05-18T01:09:12Z","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":"c886c00afafa44dc3f734c526fb104b9b19ddfc4e16c3787ba38119790412079","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T03:10:15Z","title_canon_sha256":"33aed447a690e6d21fe1de9eb39350a3bfa52d8e47480c8178493b7f743926e5"},"schema_version":"1.0","source":{"id":"1608.03664","kind":"arxiv","version":1}},"canonical_sha256":"6248b7e4d8af124810f576f6a9dafcaaf8ea9c917a3d3e385c559290a9fbcfff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6248b7e4d8af124810f576f6a9dafcaaf8ea9c917a3d3e385c559290a9fbcfff","first_computed_at":"2026-05-18T01:09:12.170224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:12.170224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZbFfZ7UiJioLRnuY7a0rsJsYEHxZd4ddAas5C2fAuOZTUBjCS8+x5FU0nVh2H6uLA7miSQ3W/7/KGJjuuSYLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:12.170762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d69610c07682a500598140aa4027d02e59e69dc501e9d812908b0d9802fcdf1","sha256:806864e293868da5dc9a550e806238f54296cdae033807fb486df32b3c9f11be"],"state_sha256":"2eee3792f3927acd28dd40379b96608d8e4e46408d137306fb08d40dfdd2edb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Bj0XMOeCxy93DFXSnKfNYaDaJljtQxEwtD8kPUtAwhSI2bsVCt8VjB4jLMUpxmbeiWQXUBzv0Nmf7yW5AVjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:57:37.689160Z","bundle_sha256":"4bf2c8d86e3f6c89a3cb4fb5dfc61d66e75de47820e12ac24ccc9713c0a8639f"}}