{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MDTS4NCPXMHIRLRYY6ECNOAILL","short_pith_number":"pith:MDTS4NCP","schema_version":"1.0","canonical_sha256":"60e72e344fbb0e88ae38c78826b8085af5bf76b72532e009358991d066d99299","source":{"kind":"arxiv","id":"1804.01785","version":1},"attestation_state":"computed","paper":{"title":"Fairness in Multiterminal Data Compression: Decomposition of Shapley Value","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Smith, Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo","submitted_at":"2018-04-05T11:20:52Z","abstract_excerpt":"We consider the problem of how to determine a fair source coding rate allocation method for the lossless data compression problem in multiterminal networks, e.g, the wireless sensor network where there are a large number of sources to be encoded. We model this problem by a game-theoretic approach and present a decomposition method for obtaining the Shapley value, a fair source coding rate vector in the Slepian-Wolf achievable region. We formulate a coalitional game model where the entropy function quantifies the cost incurred due to the source coding rates in each coalition. In the typical cas"},"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":"1804.01785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-05T11:20:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6e34162b8e26d118b31c4f46b77146fe3bcd0f0a1aca0894ee19aa080921779d","abstract_canon_sha256":"436c65a57edaf506d932f88df422b7e307dd1ad226c11d9873725a247bae6635"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:09.972625Z","signature_b64":"fnEe1T/OpRsqfnjt+wqrOZfzYCsBlhUzq8EP0ak+TiLA7lRK6ZfZEsT/lybgHqm3ve11vhRlyfljjesaX/i/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60e72e344fbb0e88ae38c78826b8085af5bf76b72532e009358991d066d99299","last_reissued_at":"2026-05-18T00:19:09.972140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:09.972140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fairness in Multiterminal Data Compression: Decomposition of Shapley Value","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Smith, Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo","submitted_at":"2018-04-05T11:20:52Z","abstract_excerpt":"We consider the problem of how to determine a fair source coding rate allocation method for the lossless data compression problem in multiterminal networks, e.g, the wireless sensor network where there are a large number of sources to be encoded. We model this problem by a game-theoretic approach and present a decomposition method for obtaining the Shapley value, a fair source coding rate vector in the Slepian-Wolf achievable region. We formulate a coalitional game model where the entropy function quantifies the cost incurred due to the source coding rates in each coalition. In the typical cas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01785","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":"1804.01785","created_at":"2026-05-18T00:19:09.972210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01785v1","created_at":"2026-05-18T00:19:09.972210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01785","created_at":"2026-05-18T00:19:09.972210+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDTS4NCPXMHI","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDTS4NCPXMHIRLRY","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDTS4NCP","created_at":"2026-05-18T12:32:37.024351+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/MDTS4NCPXMHIRLRYY6ECNOAILL","json":"https://pith.science/pith/MDTS4NCPXMHIRLRYY6ECNOAILL.json","graph_json":"https://pith.science/api/pith-number/MDTS4NCPXMHIRLRYY6ECNOAILL/graph.json","events_json":"https://pith.science/api/pith-number/MDTS4NCPXMHIRLRYY6ECNOAILL/events.json","paper":"https://pith.science/paper/MDTS4NCP"},"agent_actions":{"view_html":"https://pith.science/pith/MDTS4NCPXMHIRLRYY6ECNOAILL","download_json":"https://pith.science/pith/MDTS4NCPXMHIRLRYY6ECNOAILL.json","view_paper":"https://pith.science/paper/MDTS4NCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01785&json=true","fetch_graph":"https://pith.science/api/pith-number/MDTS4NCPXMHIRLRYY6ECNOAILL/graph.json","fetch_events":"https://pith.science/api/pith-number/MDTS4NCPXMHIRLRYY6ECNOAILL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDTS4NCPXMHIRLRYY6ECNOAILL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDTS4NCPXMHIRLRYY6ECNOAILL/action/storage_attestation","attest_author":"https://pith.science/pith/MDTS4NCPXMHIRLRYY6ECNOAILL/action/author_attestation","sign_citation":"https://pith.science/pith/MDTS4NCPXMHIRLRYY6ECNOAILL/action/citation_signature","submit_replication":"https://pith.science/pith/MDTS4NCPXMHIRLRYY6ECNOAILL/action/replication_record"}},"created_at":"2026-05-18T00:19:09.972210+00:00","updated_at":"2026-05-18T00:19:09.972210+00:00"}