{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VEYI2QDBL2QKZGTFYIEHSDXYQV","short_pith_number":"pith:VEYI2QDB","canonical_record":{"source":{"id":"1408.7019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-29T13:46:59Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"37736344e4b7e06dd3a2f1613b49de879cffc42e52917632814e0527c6707767","abstract_canon_sha256":"041a0d0958b916689a2b997d3aa2b17290b39010b066a0c15f81486fd0e8b81f"},"schema_version":"1.0"},"canonical_sha256":"a9308d40615ea0ac9a65c208790ef8854096707ff05fcd63a46d8250b7406a7b","source":{"kind":"arxiv","id":"1408.7019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.7019","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"arxiv_version","alias_value":"1408.7019v1","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.7019","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"pith_short_12","alias_value":"VEYI2QDBL2QK","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VEYI2QDBL2QKZGTF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VEYI2QDB","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VEYI2QDBL2QKZGTFYIEHSDXYQV","target":"record","payload":{"canonical_record":{"source":{"id":"1408.7019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-29T13:46:59Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"37736344e4b7e06dd3a2f1613b49de879cffc42e52917632814e0527c6707767","abstract_canon_sha256":"041a0d0958b916689a2b997d3aa2b17290b39010b066a0c15f81486fd0e8b81f"},"schema_version":"1.0"},"canonical_sha256":"a9308d40615ea0ac9a65c208790ef8854096707ff05fcd63a46d8250b7406a7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:59.812700Z","signature_b64":"jhiezZjBQ3S7xu/f5DeTzR+rWU/azV/zp0f0NKsKnZJFHp4gZUOYXSPtOvgB9EjCOeB8Q9ledTP+/k/t3YkLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9308d40615ea0ac9a65c208790ef8854096707ff05fcd63a46d8250b7406a7b","last_reissued_at":"2026-05-18T02:43:59.812333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:59.812333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.7019","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-18T02:43:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkdPpCYxYxYsQahKhYSU8OYCK5ggu51gO9P+b0bVI8qCfl++Ifjf9kw7NAFc0vnk2KO4QYmvRacsUquuNV6wCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:55:53.590819Z"},"content_sha256":"c93e4a24e76a3c68a8ebe23920bb3b02d56e325f90485c17a513023591de8893","schema_version":"1.0","event_id":"sha256:c93e4a24e76a3c68a8ebe23920bb3b02d56e325f90485c17a513023591de8893"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VEYI2QDBL2QKZGTFYIEHSDXYQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Index Coding and Graph Homomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Javad B. Ebrahimi, Mahdi Jafari Siavoshani","submitted_at":"2014-08-29T13:46:59Z","abstract_excerpt":"In this work, we study the problem of index coding from graph homomorphism perspective. We show that the minimum broadcast rate of an index coding problem for different variations of the problem such as non-linear, scalar, and vector index code, can be upper bounded by the minimum broadcast rate of another index coding problem when there exists a homomorphism from the complement of the side information graph of the first problem to that of the second problem. As a result, we show that several upper bounds on scalar and vector index code problem are special cases of one of our main theorems.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.7019","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-18T02:43:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjClplNhhku+OHRenBjKv8V0XnmBl8EJt3YyCMdk9g6s784wnpK8gFz4Qsm5+RksP6fh2Z9XGY4tEteOzp2NCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:55:53.591198Z"},"content_sha256":"3ac2817234cb16775791a247d42883ad44780fe1e51f5e41998a058134ad98e9","schema_version":"1.0","event_id":"sha256:3ac2817234cb16775791a247d42883ad44780fe1e51f5e41998a058134ad98e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEYI2QDBL2QKZGTFYIEHSDXYQV/bundle.json","state_url":"https://pith.science/pith/VEYI2QDBL2QKZGTFYIEHSDXYQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEYI2QDBL2QKZGTFYIEHSDXYQV/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-05T03:55:53Z","links":{"resolver":"https://pith.science/pith/VEYI2QDBL2QKZGTFYIEHSDXYQV","bundle":"https://pith.science/pith/VEYI2QDBL2QKZGTFYIEHSDXYQV/bundle.json","state":"https://pith.science/pith/VEYI2QDBL2QKZGTFYIEHSDXYQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEYI2QDBL2QKZGTFYIEHSDXYQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VEYI2QDBL2QKZGTFYIEHSDXYQV","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":"041a0d0958b916689a2b997d3aa2b17290b39010b066a0c15f81486fd0e8b81f","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-29T13:46:59Z","title_canon_sha256":"37736344e4b7e06dd3a2f1613b49de879cffc42e52917632814e0527c6707767"},"schema_version":"1.0","source":{"id":"1408.7019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.7019","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"arxiv_version","alias_value":"1408.7019v1","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.7019","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"pith_short_12","alias_value":"VEYI2QDBL2QK","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VEYI2QDBL2QKZGTF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VEYI2QDB","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:3ac2817234cb16775791a247d42883ad44780fe1e51f5e41998a058134ad98e9","target":"graph","created_at":"2026-05-18T02:43:59Z","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":"In this work, we study the problem of index coding from graph homomorphism perspective. We show that the minimum broadcast rate of an index coding problem for different variations of the problem such as non-linear, scalar, and vector index code, can be upper bounded by the minimum broadcast rate of another index coding problem when there exists a homomorphism from the complement of the side information graph of the first problem to that of the second problem. As a result, we show that several upper bounds on scalar and vector index code problem are special cases of one of our main theorems.\n  ","authors_text":"Javad B. Ebrahimi, Mahdi Jafari Siavoshani","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-29T13:46:59Z","title":"On Index Coding and Graph Homomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.7019","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:c93e4a24e76a3c68a8ebe23920bb3b02d56e325f90485c17a513023591de8893","target":"record","created_at":"2026-05-18T02:43:59Z","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":"041a0d0958b916689a2b997d3aa2b17290b39010b066a0c15f81486fd0e8b81f","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-29T13:46:59Z","title_canon_sha256":"37736344e4b7e06dd3a2f1613b49de879cffc42e52917632814e0527c6707767"},"schema_version":"1.0","source":{"id":"1408.7019","kind":"arxiv","version":1}},"canonical_sha256":"a9308d40615ea0ac9a65c208790ef8854096707ff05fcd63a46d8250b7406a7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9308d40615ea0ac9a65c208790ef8854096707ff05fcd63a46d8250b7406a7b","first_computed_at":"2026-05-18T02:43:59.812333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:59.812333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jhiezZjBQ3S7xu/f5DeTzR+rWU/azV/zp0f0NKsKnZJFHp4gZUOYXSPtOvgB9EjCOeB8Q9ledTP+/k/t3YkLCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:59.812700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.7019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c93e4a24e76a3c68a8ebe23920bb3b02d56e325f90485c17a513023591de8893","sha256:3ac2817234cb16775791a247d42883ad44780fe1e51f5e41998a058134ad98e9"],"state_sha256":"a68d3b7b8af87b375e23e6a4e8fa09393a7779260b522efb2e63d89b0c83b759"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"124yWbkXxGP3EqU0fNGrLHrwgaF8Eauf6GKwiHTYixrws9Hr5+LiZmGg5viWeyscNvHdD0dKxOsx4fRHw84aBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:55:53.594990Z","bundle_sha256":"a56ae22d307f28d108ae28906a64bf2039af96c654274f2f8a314d133352cdbc"}}