{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BEXD3I3IXZOGUIQZXTWVKDWXJM","short_pith_number":"pith:BEXD3I3I","schema_version":"1.0","canonical_sha256":"092e3da368be5c6a2219bced550ed74b27323e76df77f4bf29975e285835bc5d","source":{"kind":"arxiv","id":"1601.07285","version":1},"attestation_state":"computed","paper":{"title":"Fairness in Communication for Omniscience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chung Chan, Ni Ding, Parastoo Sadeghi, Qiaoqiao Zhou, Rodney A. Kennedy","submitted_at":"2016-01-27T08:25:21Z","abstract_excerpt":"We consider the problem of how to fairly distribute the minimum sum-rate among the users in communication for omniscience (CO). We formulate a problem of minimizing a weighted quadratic function over a submodular base polyhedron which contains all achievable rate vectors, or transmission strategies, for CO that have the same sum-rate. By solving it, we can determine the rate vector that optimizes the Jain's fairness measure, a more commonly used fairness index than the Shapley value in communications engineering. We show that the optimizer is a lexicographically optimal (lex-optimal) base and "},"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":"1601.07285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-27T08:25:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"10534ae4bf5bdb23ca103511568bd6c063ca714d01f3724aad5d4fedf2f8baee","abstract_canon_sha256":"3c87a1b133632bcb26d0e9f31fff64ebe63db2146a49af49f0db46c284deb7f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:46.195759Z","signature_b64":"vKJ4Oc/pAyGbToBsF10gICTccuVesIiR6o/pMxVkXh35ToHm1nSY11G7rRQY8f265H3qSnS53pN6jX6lVAwyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"092e3da368be5c6a2219bced550ed74b27323e76df77f4bf29975e285835bc5d","last_reissued_at":"2026-05-18T01:21:46.195108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:46.195108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fairness in Communication for Omniscience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chung Chan, Ni Ding, Parastoo Sadeghi, Qiaoqiao Zhou, Rodney A. Kennedy","submitted_at":"2016-01-27T08:25:21Z","abstract_excerpt":"We consider the problem of how to fairly distribute the minimum sum-rate among the users in communication for omniscience (CO). We formulate a problem of minimizing a weighted quadratic function over a submodular base polyhedron which contains all achievable rate vectors, or transmission strategies, for CO that have the same sum-rate. By solving it, we can determine the rate vector that optimizes the Jain's fairness measure, a more commonly used fairness index than the Shapley value in communications engineering. We show that the optimizer is a lexicographically optimal (lex-optimal) base and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07285","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":"1601.07285","created_at":"2026-05-18T01:21:46.195196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07285v1","created_at":"2026-05-18T01:21:46.195196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07285","created_at":"2026-05-18T01:21:46.195196+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEXD3I3IXZOG","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEXD3I3IXZOGUIQZ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEXD3I3I","created_at":"2026-05-18T12:30:07.202191+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/BEXD3I3IXZOGUIQZXTWVKDWXJM","json":"https://pith.science/pith/BEXD3I3IXZOGUIQZXTWVKDWXJM.json","graph_json":"https://pith.science/api/pith-number/BEXD3I3IXZOGUIQZXTWVKDWXJM/graph.json","events_json":"https://pith.science/api/pith-number/BEXD3I3IXZOGUIQZXTWVKDWXJM/events.json","paper":"https://pith.science/paper/BEXD3I3I"},"agent_actions":{"view_html":"https://pith.science/pith/BEXD3I3IXZOGUIQZXTWVKDWXJM","download_json":"https://pith.science/pith/BEXD3I3IXZOGUIQZXTWVKDWXJM.json","view_paper":"https://pith.science/paper/BEXD3I3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07285&json=true","fetch_graph":"https://pith.science/api/pith-number/BEXD3I3IXZOGUIQZXTWVKDWXJM/graph.json","fetch_events":"https://pith.science/api/pith-number/BEXD3I3IXZOGUIQZXTWVKDWXJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEXD3I3IXZOGUIQZXTWVKDWXJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEXD3I3IXZOGUIQZXTWVKDWXJM/action/storage_attestation","attest_author":"https://pith.science/pith/BEXD3I3IXZOGUIQZXTWVKDWXJM/action/author_attestation","sign_citation":"https://pith.science/pith/BEXD3I3IXZOGUIQZXTWVKDWXJM/action/citation_signature","submit_replication":"https://pith.science/pith/BEXD3I3IXZOGUIQZXTWVKDWXJM/action/replication_record"}},"created_at":"2026-05-18T01:21:46.195196+00:00","updated_at":"2026-05-18T01:21:46.195196+00:00"}