{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IUXRYMWLBVSM65ZHIKJD3DCU3U","short_pith_number":"pith:IUXRYMWL","canonical_record":{"source":{"id":"1701.06033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T14:28:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"38557b5e35a6f433728fba1f25c43974a59c192613987461a3d949117a4054c2","abstract_canon_sha256":"8c0299220469f2dfcb97c9a1ee4961b02861153b0eedf568815ce112abf379b4"},"schema_version":"1.0"},"canonical_sha256":"452f1c32cb0d64cf772742923d8c54dd2d03547cfb7ff866cef395c8651acfb2","source":{"kind":"arxiv","id":"1701.06033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06033","created_at":"2026-05-18T00:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06033v1","created_at":"2026-05-18T00:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06033","created_at":"2026-05-18T00:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"IUXRYMWLBVSM","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IUXRYMWLBVSM65ZH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IUXRYMWL","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IUXRYMWLBVSM65ZHIKJD3DCU3U","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T14:28:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"38557b5e35a6f433728fba1f25c43974a59c192613987461a3d949117a4054c2","abstract_canon_sha256":"8c0299220469f2dfcb97c9a1ee4961b02861153b0eedf568815ce112abf379b4"},"schema_version":"1.0"},"canonical_sha256":"452f1c32cb0d64cf772742923d8c54dd2d03547cfb7ff866cef395c8651acfb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:19.558686Z","signature_b64":"yGSF9w+IKXb4ZyGEMUMgt/K3a50xapvosslx2NdGAILtF/tvL3x2/4Xf8I9Wv/QCQhpHxtBzW1hkB8Q/SVC2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"452f1c32cb0d64cf772742923d8c54dd2d03547cfb7ff866cef395c8651acfb2","last_reissued_at":"2026-05-18T00:52:19.557941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:19.557941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06033","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:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LecJei4KaMeoFUok/3YPjOj68zmIYIWgTRIJdWSQrcmoUquMhKK20D23WHc+oTW6/KGhbYUqzuRYJMHFBUE4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:12:57.683892Z"},"content_sha256":"95d479d89ea5c510c681607eeb1633cc870a28600f4c7a6f9c394c3ba32f1de3","schema_version":"1.0","event_id":"sha256:95d479d89ea5c510c681607eeb1633cc870a28600f4c7a6f9c394c3ba32f1de3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IUXRYMWLBVSM65ZHIKJD3DCU3U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity for Distributed Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fatemeh Arbabjolfaei, Parastoo Sadeghi, Young-Han Kim, Yucheng Liu","submitted_at":"2017-01-21T14:28:30Z","abstract_excerpt":"The distributed index coding problem is studied, whereby multiple messages are stored at different servers to be broadcast to receivers with side information. First, the existing composite coding scheme is enhanced for the centralized (single-server) index coding problem, which is then merged with fractional partitioning of servers to yield a new coding scheme for distributed index coding. New outer bounds on the capacity region are also established. For 213 out of 218 non-isomorphic distributed index coding problems with four messages the achievable sum-rate of the proposed distributed compos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06033","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:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrkB8C8DO0Dkhsyt4kcctPMR1dsK3gV0jTssc7rReEnF7k3K/dAwZj60FoaEHo5JvAI+SCwvDJxwob1RoCFmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:12:57.684367Z"},"content_sha256":"35934eb6c63ead1bcb7fe11a66a9623471a6ad61c734c61a49a8fbf09ef33316","schema_version":"1.0","event_id":"sha256:35934eb6c63ead1bcb7fe11a66a9623471a6ad61c734c61a49a8fbf09ef33316"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUXRYMWLBVSM65ZHIKJD3DCU3U/bundle.json","state_url":"https://pith.science/pith/IUXRYMWLBVSM65ZHIKJD3DCU3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUXRYMWLBVSM65ZHIKJD3DCU3U/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-02T23:12:57Z","links":{"resolver":"https://pith.science/pith/IUXRYMWLBVSM65ZHIKJD3DCU3U","bundle":"https://pith.science/pith/IUXRYMWLBVSM65ZHIKJD3DCU3U/bundle.json","state":"https://pith.science/pith/IUXRYMWLBVSM65ZHIKJD3DCU3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUXRYMWLBVSM65ZHIKJD3DCU3U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IUXRYMWLBVSM65ZHIKJD3DCU3U","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":"8c0299220469f2dfcb97c9a1ee4961b02861153b0eedf568815ce112abf379b4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T14:28:30Z","title_canon_sha256":"38557b5e35a6f433728fba1f25c43974a59c192613987461a3d949117a4054c2"},"schema_version":"1.0","source":{"id":"1701.06033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06033","created_at":"2026-05-18T00:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06033v1","created_at":"2026-05-18T00:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06033","created_at":"2026-05-18T00:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"IUXRYMWLBVSM","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IUXRYMWLBVSM65ZH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IUXRYMWL","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:35934eb6c63ead1bcb7fe11a66a9623471a6ad61c734c61a49a8fbf09ef33316","target":"graph","created_at":"2026-05-18T00:52:19Z","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":"The distributed index coding problem is studied, whereby multiple messages are stored at different servers to be broadcast to receivers with side information. First, the existing composite coding scheme is enhanced for the centralized (single-server) index coding problem, which is then merged with fractional partitioning of servers to yield a new coding scheme for distributed index coding. New outer bounds on the capacity region are also established. For 213 out of 218 non-isomorphic distributed index coding problems with four messages the achievable sum-rate of the proposed distributed compos","authors_text":"Fatemeh Arbabjolfaei, Parastoo Sadeghi, Young-Han Kim, Yucheng Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T14:28:30Z","title":"On the Capacity for Distributed Index Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06033","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:95d479d89ea5c510c681607eeb1633cc870a28600f4c7a6f9c394c3ba32f1de3","target":"record","created_at":"2026-05-18T00:52:19Z","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":"8c0299220469f2dfcb97c9a1ee4961b02861153b0eedf568815ce112abf379b4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T14:28:30Z","title_canon_sha256":"38557b5e35a6f433728fba1f25c43974a59c192613987461a3d949117a4054c2"},"schema_version":"1.0","source":{"id":"1701.06033","kind":"arxiv","version":1}},"canonical_sha256":"452f1c32cb0d64cf772742923d8c54dd2d03547cfb7ff866cef395c8651acfb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"452f1c32cb0d64cf772742923d8c54dd2d03547cfb7ff866cef395c8651acfb2","first_computed_at":"2026-05-18T00:52:19.557941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:19.557941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yGSF9w+IKXb4ZyGEMUMgt/K3a50xapvosslx2NdGAILtF/tvL3x2/4Xf8I9Wv/QCQhpHxtBzW1hkB8Q/SVC2Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:19.558686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95d479d89ea5c510c681607eeb1633cc870a28600f4c7a6f9c394c3ba32f1de3","sha256:35934eb6c63ead1bcb7fe11a66a9623471a6ad61c734c61a49a8fbf09ef33316"],"state_sha256":"81997d0ff7ecb73d8128844720c6f5aae87c1364e6092366500007db52016164"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rlGUzCF/BQAtLPxNUTZFHZXa+JasBTgyNn1IEDl7Y9G44p6f1NR9MnIgv3w/NPCP6Q7ooySHEZK0dQnkb0jmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:12:57.686353Z","bundle_sha256":"81309175db93bf8a9b31f07818c1c8c146c54d3882c9961d224d17a3b9348ec6"}}