{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JLXSKG676ZTCNOXAB3RVDMGBI4","short_pith_number":"pith:JLXSKG67","canonical_record":{"source":{"id":"1412.1520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-03T23:37:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e2e0d94f0697f4de210c75e5f54d86d3edeab33098379680bcb249a713f35fe2","abstract_canon_sha256":"10ab3686276d580caf45e279b03d6ba49b05c42b34932b80b498dd9083b36ae5"},"schema_version":"1.0"},"canonical_sha256":"4aef251bdff66626bae00ee351b0c1471769ab3ce3e8ba034d03c68e84a9d37c","source":{"kind":"arxiv","id":"1412.1520","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1520","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1520v2","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1520","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"JLXSKG676ZTC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JLXSKG676ZTCNOXA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JLXSKG67","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JLXSKG676ZTCNOXAB3RVDMGBI4","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-03T23:37:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e2e0d94f0697f4de210c75e5f54d86d3edeab33098379680bcb249a713f35fe2","abstract_canon_sha256":"10ab3686276d580caf45e279b03d6ba49b05c42b34932b80b498dd9083b36ae5"},"schema_version":"1.0"},"canonical_sha256":"4aef251bdff66626bae00ee351b0c1471769ab3ce3e8ba034d03c68e84a9d37c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:16.942414Z","signature_b64":"+BZhAbblfk8Cloy151pIw3gr3s/whsEafl4UfmcjnRMVlwaJFNl3lIBQvMO71XJxEr/0sLbYSFXmULv4/nEFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aef251bdff66626bae00ee351b0c1471769ab3ce3e8ba034d03c68e84a9d37c","last_reissued_at":"2026-05-18T01:13:16.941831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:16.941831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1520","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-18T01:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7ELP7xoFoiW6BxjBNuMeAIIDnvsZRuGEDxmalPWwe84nrOZe+yr2pWw4T7ZOZTuYJYTamV+Y7oQVXuGiV6OCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:42:03.279974Z"},"content_sha256":"68f0f5ddcc45802bda31e2638146d466d240b2ea652911c5aeff877b29962a18","schema_version":"1.0","event_id":"sha256:68f0f5ddcc45802bda31e2638146d466d240b2ea652911c5aeff877b29962a18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JLXSKG676ZTCNOXAB3RVDMGBI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Single-Uniprior Index-Coding Problem: The Single-Sender Case and The Multi-Sender Extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chin Keong Ho, Fabian Lim, Lawrence Ong","submitted_at":"2014-12-03T23:37:24Z","abstract_excerpt":"Index coding studies multiterminal source-coding problems where a set of receivers are required to decode multiple (possibly different) messages from a common broadcast, and they each know some messages a priori. In this paper, at the receiver end, we consider a special setting where each receiver knows only one message a priori, and each message is known to only one receiver. At the broadcasting end, we consider a generalized setting where there could be multiple senders, and each sender knows a subset of the messages. The senders collaborate to transmit an index code. This work looks at mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1520","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-18T01:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vm9GBGzrhEnWPwyCCU5RiyqzSoB/h05RlddT4PY7dYKAbPWjfP5BzZKBpFIVJUCIakl9F/Gjo4ic6ShyLpqJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:42:03.280681Z"},"content_sha256":"75d5fedfe213912407720fb5465ffb075296fef1aa4be6962400a9044e5cbcf1","schema_version":"1.0","event_id":"sha256:75d5fedfe213912407720fb5465ffb075296fef1aa4be6962400a9044e5cbcf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/bundle.json","state_url":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/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-12T03:42:03Z","links":{"resolver":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4","bundle":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/bundle.json","state":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JLXSKG676ZTCNOXAB3RVDMGBI4","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":"10ab3686276d580caf45e279b03d6ba49b05c42b34932b80b498dd9083b36ae5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-03T23:37:24Z","title_canon_sha256":"e2e0d94f0697f4de210c75e5f54d86d3edeab33098379680bcb249a713f35fe2"},"schema_version":"1.0","source":{"id":"1412.1520","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1520","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1520v2","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1520","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"JLXSKG676ZTC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JLXSKG676ZTCNOXA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JLXSKG67","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:75d5fedfe213912407720fb5465ffb075296fef1aa4be6962400a9044e5cbcf1","target":"graph","created_at":"2026-05-18T01:13:16Z","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":"Index coding studies multiterminal source-coding problems where a set of receivers are required to decode multiple (possibly different) messages from a common broadcast, and they each know some messages a priori. In this paper, at the receiver end, we consider a special setting where each receiver knows only one message a priori, and each message is known to only one receiver. At the broadcasting end, we consider a generalized setting where there could be multiple senders, and each sender knows a subset of the messages. The senders collaborate to transmit an index code. This work looks at mini","authors_text":"Chin Keong Ho, Fabian Lim, Lawrence Ong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-03T23:37:24Z","title":"The Single-Uniprior Index-Coding Problem: The Single-Sender Case and The Multi-Sender Extension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1520","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:68f0f5ddcc45802bda31e2638146d466d240b2ea652911c5aeff877b29962a18","target":"record","created_at":"2026-05-18T01:13:16Z","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":"10ab3686276d580caf45e279b03d6ba49b05c42b34932b80b498dd9083b36ae5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-03T23:37:24Z","title_canon_sha256":"e2e0d94f0697f4de210c75e5f54d86d3edeab33098379680bcb249a713f35fe2"},"schema_version":"1.0","source":{"id":"1412.1520","kind":"arxiv","version":2}},"canonical_sha256":"4aef251bdff66626bae00ee351b0c1471769ab3ce3e8ba034d03c68e84a9d37c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4aef251bdff66626bae00ee351b0c1471769ab3ce3e8ba034d03c68e84a9d37c","first_computed_at":"2026-05-18T01:13:16.941831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:16.941831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+BZhAbblfk8Cloy151pIw3gr3s/whsEafl4UfmcjnRMVlwaJFNl3lIBQvMO71XJxEr/0sLbYSFXmULv4/nEFDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:16.942414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1520","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68f0f5ddcc45802bda31e2638146d466d240b2ea652911c5aeff877b29962a18","sha256:75d5fedfe213912407720fb5465ffb075296fef1aa4be6962400a9044e5cbcf1"],"state_sha256":"8114495aed432c4c0467f287fa99a879cb60dbfbfee04b6b252b3ac6b4696aad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uh6tQfaSMnFlE1mH221K3o+mbZ3/sfPDHfweicxhO1b/Zdps/Zjx19yMGimJZy6gtJpUxurQODuArHdI/PQZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:42:03.285379Z","bundle_sha256":"3a32430a61810a6252d23cb06f7e7964803a226b3922cef939f2478dfdab8413"}}