{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JLXSKG676ZTCNOXAB3RVDMGBI4","short_pith_number":"pith:JLXSKG67","schema_version":"1.0","canonical_sha256":"4aef251bdff66626bae00ee351b0c1471769ab3ce3e8ba034d03c68e84a9d37c","source":{"kind":"arxiv","id":"1412.1520","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.1520","created_at":"2026-05-18T01:13:16.941907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1520v2","created_at":"2026-05-18T01:13:16.941907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1520","created_at":"2026-05-18T01:13:16.941907+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLXSKG676ZTC","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLXSKG676ZTCNOXA","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLXSKG67","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4","json":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4.json","graph_json":"https://pith.science/api/pith-number/JLXSKG676ZTCNOXAB3RVDMGBI4/graph.json","events_json":"https://pith.science/api/pith-number/JLXSKG676ZTCNOXAB3RVDMGBI4/events.json","paper":"https://pith.science/paper/JLXSKG67"},"agent_actions":{"view_html":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4","download_json":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4.json","view_paper":"https://pith.science/paper/JLXSKG67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1520&json=true","fetch_graph":"https://pith.science/api/pith-number/JLXSKG676ZTCNOXAB3RVDMGBI4/graph.json","fetch_events":"https://pith.science/api/pith-number/JLXSKG676ZTCNOXAB3RVDMGBI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/action/storage_attestation","attest_author":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/action/author_attestation","sign_citation":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/action/citation_signature","submit_replication":"https://pith.science/pith/JLXSKG676ZTCNOXAB3RVDMGBI4/action/replication_record"}},"created_at":"2026-05-18T01:13:16.941907+00:00","updated_at":"2026-05-18T01:13:16.941907+00:00"}