{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PHCLCDKOFIADR2O4MXRUED26QN","short_pith_number":"pith:PHCLCDKO","canonical_record":{"source":{"id":"1805.01583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-04T01:27:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5afab478c5f5206cfd1cb7b2b2f35a98febb513fa9732afec425c581fdcb85bd","abstract_canon_sha256":"e6131b22efe39358635a1faf4b897729f5d883be390d0a329d60c079eb00a4f8"},"schema_version":"1.0"},"canonical_sha256":"79c4b10d4e2a0038e9dc65e3420f5e83775cf2d4716f28b33e8d22913be1d89c","source":{"kind":"arxiv","id":"1805.01583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01583","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01583v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01583","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"PHCLCDKOFIAD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PHCLCDKOFIADR2O4","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PHCLCDKO","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PHCLCDKOFIADR2O4MXRUED26QN","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-04T01:27:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5afab478c5f5206cfd1cb7b2b2f35a98febb513fa9732afec425c581fdcb85bd","abstract_canon_sha256":"e6131b22efe39358635a1faf4b897729f5d883be390d0a329d60c079eb00a4f8"},"schema_version":"1.0"},"canonical_sha256":"79c4b10d4e2a0038e9dc65e3420f5e83775cf2d4716f28b33e8d22913be1d89c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:47.395918Z","signature_b64":"C2m3UmxVfCS7bRKwcCnVnlxleVVeQCHq89N80UexISTLxTRKCD+Lwf1bLOoErNBgjEV7YPCEmhm+DszRIDitAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79c4b10d4e2a0038e9dc65e3420f5e83775cf2d4716f28b33e8d22913be1d89c","last_reissued_at":"2026-05-18T00:16:47.395364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:47.395364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01583","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-18T00:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLNgRZt4rScbAGAz4liwq7P2QptsF6/lAmYg1Ans+D9hY4bkxQuUPoJh3NvFzYteHw+QLPssqDOyIHpdtEedDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T20:48:23.906420Z"},"content_sha256":"cde2e877c511c62776107cc7f858c8975adc3e85ddb9b957c12e030c8a33da93","schema_version":"1.0","event_id":"sha256:cde2e877c511c62776107cc7f858c8975adc3e85ddb9b957c12e030c8a33da93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PHCLCDKOFIADR2O4MXRUED26QN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fairness in Multiterminal Data Compression: A Splitting Method for The Egalitarian Solution","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-05-04T01:27:38Z","abstract_excerpt":"This paper proposes a novel splitting (SPLIT) algorithm to achieve fairness in the multiterminal lossless data compression problem. It finds the egalitarian solution in the Slepian-Wolf region and completes in strongly polynomial time. We show that the SPLIT algorithm adaptively updates the source coding rates to the optimal solution, while recursively splitting the terminal set, enabling parallel and distributed computation. The result of an experiment demonstrates a significant reduction in computation time by the parallel implementation when the number of terminals becomes large. The achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01583","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-18T00:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQhVVJpw277ZkthfqMgKtRR7sWfbWQvy8/WH8SxmyZDIAKn2fqd9QxI10QopbrQA7HqRj3zMX3RJNXQN+J/vAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T20:48:23.906775Z"},"content_sha256":"3a7041dc12933998ca8e6d2ed6e7768f0dd11f74935e5085fbb802001e2aa4bd","schema_version":"1.0","event_id":"sha256:3a7041dc12933998ca8e6d2ed6e7768f0dd11f74935e5085fbb802001e2aa4bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHCLCDKOFIADR2O4MXRUED26QN/bundle.json","state_url":"https://pith.science/pith/PHCLCDKOFIADR2O4MXRUED26QN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHCLCDKOFIADR2O4MXRUED26QN/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-19T20:48:23Z","links":{"resolver":"https://pith.science/pith/PHCLCDKOFIADR2O4MXRUED26QN","bundle":"https://pith.science/pith/PHCLCDKOFIADR2O4MXRUED26QN/bundle.json","state":"https://pith.science/pith/PHCLCDKOFIADR2O4MXRUED26QN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHCLCDKOFIADR2O4MXRUED26QN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PHCLCDKOFIADR2O4MXRUED26QN","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":"e6131b22efe39358635a1faf4b897729f5d883be390d0a329d60c079eb00a4f8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-04T01:27:38Z","title_canon_sha256":"5afab478c5f5206cfd1cb7b2b2f35a98febb513fa9732afec425c581fdcb85bd"},"schema_version":"1.0","source":{"id":"1805.01583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01583","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01583v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01583","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"PHCLCDKOFIAD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PHCLCDKOFIADR2O4","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PHCLCDKO","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:3a7041dc12933998ca8e6d2ed6e7768f0dd11f74935e5085fbb802001e2aa4bd","target":"graph","created_at":"2026-05-18T00:16:47Z","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 paper proposes a novel splitting (SPLIT) algorithm to achieve fairness in the multiterminal lossless data compression problem. It finds the egalitarian solution in the Slepian-Wolf region and completes in strongly polynomial time. We show that the SPLIT algorithm adaptively updates the source coding rates to the optimal solution, while recursively splitting the terminal set, enabling parallel and distributed computation. The result of an experiment demonstrates a significant reduction in computation time by the parallel implementation when the number of terminals becomes large. The achiev","authors_text":"David Smith, Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-04T01:27:38Z","title":"Fairness in Multiterminal Data Compression: A Splitting Method for The Egalitarian Solution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01583","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:cde2e877c511c62776107cc7f858c8975adc3e85ddb9b957c12e030c8a33da93","target":"record","created_at":"2026-05-18T00:16:47Z","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":"e6131b22efe39358635a1faf4b897729f5d883be390d0a329d60c079eb00a4f8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-04T01:27:38Z","title_canon_sha256":"5afab478c5f5206cfd1cb7b2b2f35a98febb513fa9732afec425c581fdcb85bd"},"schema_version":"1.0","source":{"id":"1805.01583","kind":"arxiv","version":1}},"canonical_sha256":"79c4b10d4e2a0038e9dc65e3420f5e83775cf2d4716f28b33e8d22913be1d89c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79c4b10d4e2a0038e9dc65e3420f5e83775cf2d4716f28b33e8d22913be1d89c","first_computed_at":"2026-05-18T00:16:47.395364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:47.395364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C2m3UmxVfCS7bRKwcCnVnlxleVVeQCHq89N80UexISTLxTRKCD+Lwf1bLOoErNBgjEV7YPCEmhm+DszRIDitAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:47.395918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cde2e877c511c62776107cc7f858c8975adc3e85ddb9b957c12e030c8a33da93","sha256:3a7041dc12933998ca8e6d2ed6e7768f0dd11f74935e5085fbb802001e2aa4bd"],"state_sha256":"eec2abbbb1a2bd9b54ea9e2d672f1a8fe52c1831fab8437e5f8c43e3234a9b55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Eh8HfXY+k8zNDeruX4MFHafXpW853+W9Ci5SlIQ2hUveNRwA3SPNLfTiLaA39agljAO2USA0xfFucmr/qxHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T20:48:23.908700Z","bundle_sha256":"ea7966848a6e53fdca71d6bcf31fae03f32ae638bf55fb59a8734df4f32c83bb"}}