{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DFAFFYTIMP2TIOCQEZISGRM6RC","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":"40e6de566d5d71455db2e85fc2332d8e04ad7d1e2cc943334adfbb28a197c690","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-20T06:28:57Z","title_canon_sha256":"5330d89a5dfda0c69ad60d0033c3efc2b5c8f9c7d8d884b1c1ee7d2bc694a972"},"schema_version":"1.0","source":{"id":"1606.05982","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05982","created_at":"2026-05-18T00:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05982v2","created_at":"2026-05-18T00:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05982","created_at":"2026-05-18T00:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"DFAFFYTIMP2T","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DFAFFYTIMP2TIOCQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DFAFFYTI","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:f2e2b615486c28fe3fd3a5387250725d8a16ff2aa93cd0db8410b046a2848f58","target":"graph","created_at":"2026-05-18T00:36:09Z","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 models broadcast networks in which a sender sends different messages to different receivers simultaneously, where each receiver may know some of the messages a priori. The aim is to find the minimum (normalised) index codelength that the sender sends. This paper considers unicast index coding, where each receiver requests exactly one message, and each message is requested by exactly one receiver. Each unicast index-coding instances can be fully described by a directed graph and vice versa, where each vertex corresponds to one receiver. For any directed graph representing a unicast","authors_text":"Lawrence Ong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-20T06:28:57Z","title":"Optimal Finite-Length and Asymptotic Index Codes for Five or Fewer Receivers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05982","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:a3ea95b3ea6434c9a3771981144e673f6b8dd3ee391fe2615913d63722370c43","target":"record","created_at":"2026-05-18T00:36:09Z","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":"40e6de566d5d71455db2e85fc2332d8e04ad7d1e2cc943334adfbb28a197c690","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-20T06:28:57Z","title_canon_sha256":"5330d89a5dfda0c69ad60d0033c3efc2b5c8f9c7d8d884b1c1ee7d2bc694a972"},"schema_version":"1.0","source":{"id":"1606.05982","kind":"arxiv","version":2}},"canonical_sha256":"194052e26863f5343850265123459e888abe90cce12ba09da1fc1907e3c1e28e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"194052e26863f5343850265123459e888abe90cce12ba09da1fc1907e3c1e28e","first_computed_at":"2026-05-18T00:36:09.752415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:09.752415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g/2jewxrDkL5yWZ9wfs9NgizSH5D/hgPB+NI9YkkaqdxgQ8gOHPANSF5TDE3j6Lc7nlTd4iZoTxE6hjUPan0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:09.753131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05982","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3ea95b3ea6434c9a3771981144e673f6b8dd3ee391fe2615913d63722370c43","sha256:f2e2b615486c28fe3fd3a5387250725d8a16ff2aa93cd0db8410b046a2848f58"],"state_sha256":"29b9b75dc5af9d373b739fb8f92a521467a2aa0e0c910d71fcfb102c79cb4924"}