{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PCQQRAACHFA2DQV4VUN7MBFJDE","short_pith_number":"pith:PCQQRAAC","canonical_record":{"source":{"id":"1608.03689","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T06:45:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6152f4cab861552364fd24d4732d08dcab5e1f7506a91aca03b52f66ff11e959","abstract_canon_sha256":"83ce48953c9a56fbcb8ea5fdc1dcb39a4dab25850507215fa77b4a4b8c14a3df"},"schema_version":"1.0"},"canonical_sha256":"78a10880023941a1c2bcad1bf604a91937f7dcb22168c5d96ad7d5b66b541399","source":{"kind":"arxiv","id":"1608.03689","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03689","created_at":"2026-05-18T00:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03689v2","created_at":"2026-05-18T00:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03689","created_at":"2026-05-18T00:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"PCQQRAACHFA2","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCQQRAACHFA2DQV4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCQQRAAC","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PCQQRAACHFA2DQV4VUN7MBFJDE","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03689","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T06:45:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6152f4cab861552364fd24d4732d08dcab5e1f7506a91aca03b52f66ff11e959","abstract_canon_sha256":"83ce48953c9a56fbcb8ea5fdc1dcb39a4dab25850507215fa77b4a4b8c14a3df"},"schema_version":"1.0"},"canonical_sha256":"78a10880023941a1c2bcad1bf604a91937f7dcb22168c5d96ad7d5b66b541399","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:32.764371Z","signature_b64":"xKoXzFdT4CzeeDNMzGku6WXQ/HQKWIHsIG4JNYzZV3ygNq+jTsJ/3alWc/QjDwsKto+dfCRHH8V8fqJrp2r/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78a10880023941a1c2bcad1bf604a91937f7dcb22168c5d96ad7d5b66b541399","last_reissued_at":"2026-05-18T00:04:32.763922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:32.763922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03689","source_version":2,"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:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MuZKbCRpktwOJmgiwBjGPV+GHuHZnZaNqSqBq9s3Aq8ASCcJQhlH7YuJgxvSSsKVPBkkcIhcx2rx4xZnJnqHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:33:42.229431Z"},"content_sha256":"9eb29c7aca36d8fea58337225131a04d1ec43eb8813a11da63edb6995e52ab70","schema_version":"1.0","event_id":"sha256:9eb29c7aca36d8fea58337225131a04d1ec43eb8813a11da63edb6995e52ab70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PCQQRAACHFA2DQV4VUN7MBFJDE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Lexicographic Products and the Index Coding Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fatemeh Arbabjolfaei, Young-Han Kim","submitted_at":"2016-08-12T06:45:31Z","abstract_excerpt":"The index coding problem studies the fundamental limit on broadcasting multiple messages to their respective receivers with different sets of side information that are represented by a directed graph. The generalized lexicographic product structure in the side information graph is introduced as a natural condition under which the corresponding index coding problem can be decomposed into multiple interacting subproblems. The capacity region is characterized in terms of the subproblem capacity regions combined in the same product structure. The proof is based on dual uses of random coding---one "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03689","kind":"arxiv","version":2},"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:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HUDvL1kYaVaScPGq/Suv5syPm7gPLRXew/VmzlWp97wFFR3ymvQDHPaodNN0FDRY80EFhcyGl01Gvtx4a/9XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:33:42.229774Z"},"content_sha256":"4d31c700e5ba7d957867147efc970af506feae4ef2fd7532fc672f197c829ebc","schema_version":"1.0","event_id":"sha256:4d31c700e5ba7d957867147efc970af506feae4ef2fd7532fc672f197c829ebc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCQQRAACHFA2DQV4VUN7MBFJDE/bundle.json","state_url":"https://pith.science/pith/PCQQRAACHFA2DQV4VUN7MBFJDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCQQRAACHFA2DQV4VUN7MBFJDE/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-03T07:33:42Z","links":{"resolver":"https://pith.science/pith/PCQQRAACHFA2DQV4VUN7MBFJDE","bundle":"https://pith.science/pith/PCQQRAACHFA2DQV4VUN7MBFJDE/bundle.json","state":"https://pith.science/pith/PCQQRAACHFA2DQV4VUN7MBFJDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCQQRAACHFA2DQV4VUN7MBFJDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PCQQRAACHFA2DQV4VUN7MBFJDE","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":"83ce48953c9a56fbcb8ea5fdc1dcb39a4dab25850507215fa77b4a4b8c14a3df","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T06:45:31Z","title_canon_sha256":"6152f4cab861552364fd24d4732d08dcab5e1f7506a91aca03b52f66ff11e959"},"schema_version":"1.0","source":{"id":"1608.03689","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03689","created_at":"2026-05-18T00:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03689v2","created_at":"2026-05-18T00:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03689","created_at":"2026-05-18T00:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"PCQQRAACHFA2","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCQQRAACHFA2DQV4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCQQRAAC","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:4d31c700e5ba7d957867147efc970af506feae4ef2fd7532fc672f197c829ebc","target":"graph","created_at":"2026-05-18T00:04:32Z","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 index coding problem studies the fundamental limit on broadcasting multiple messages to their respective receivers with different sets of side information that are represented by a directed graph. The generalized lexicographic product structure in the side information graph is introduced as a natural condition under which the corresponding index coding problem can be decomposed into multiple interacting subproblems. The capacity region is characterized in terms of the subproblem capacity regions combined in the same product structure. The proof is based on dual uses of random coding---one ","authors_text":"Fatemeh Arbabjolfaei, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T06:45:31Z","title":"Generalized Lexicographic Products and the Index Coding Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03689","kind":"arxiv","version":2},"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:9eb29c7aca36d8fea58337225131a04d1ec43eb8813a11da63edb6995e52ab70","target":"record","created_at":"2026-05-18T00:04:32Z","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":"83ce48953c9a56fbcb8ea5fdc1dcb39a4dab25850507215fa77b4a4b8c14a3df","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T06:45:31Z","title_canon_sha256":"6152f4cab861552364fd24d4732d08dcab5e1f7506a91aca03b52f66ff11e959"},"schema_version":"1.0","source":{"id":"1608.03689","kind":"arxiv","version":2}},"canonical_sha256":"78a10880023941a1c2bcad1bf604a91937f7dcb22168c5d96ad7d5b66b541399","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78a10880023941a1c2bcad1bf604a91937f7dcb22168c5d96ad7d5b66b541399","first_computed_at":"2026-05-18T00:04:32.763922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:32.763922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xKoXzFdT4CzeeDNMzGku6WXQ/HQKWIHsIG4JNYzZV3ygNq+jTsJ/3alWc/QjDwsKto+dfCRHH8V8fqJrp2r/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:32.764371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03689","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9eb29c7aca36d8fea58337225131a04d1ec43eb8813a11da63edb6995e52ab70","sha256:4d31c700e5ba7d957867147efc970af506feae4ef2fd7532fc672f197c829ebc"],"state_sha256":"7ae69e99765ebee1af5b7cd05c7c56c4aac269eee7458ed9fbcdd169263a6112"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7w2ZquvSK+i3YPP5oU8RQjCKsvSwU6wi1wNI1ySnxN4HHwaZbbeAwPMzvzEguJN/EliONo5j+mIyz8J9VKOLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:33:42.231732Z","bundle_sha256":"ebe097aab0d92ded67a755c4edc3cf8c5a5bd8548cc194ea9da44888d2a0397b"}}