{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OL2XM3VL67E2DRCD7WIMTRD5OH","short_pith_number":"pith:OL2XM3VL","canonical_record":{"source":{"id":"1401.7369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T23:30:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b70788a5a82ff62a8e4fa816b7da6633fd8f935ea3d654e09a3bef1406820565","abstract_canon_sha256":"830ad7787504537837163166e00872cfddc5931f663f92ed29bc13d1d1d55e53"},"schema_version":"1.0"},"canonical_sha256":"72f5766eabf7c9a1c443fd90c9c47d71d507a61f4870f5c8ac5d1e4a49fb95ea","source":{"kind":"arxiv","id":"1401.7369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7369","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7369v1","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7369","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"OL2XM3VL67E2","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OL2XM3VL67E2DRCD","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OL2XM3VL","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OL2XM3VL67E2DRCD7WIMTRD5OH","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T23:30:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b70788a5a82ff62a8e4fa816b7da6633fd8f935ea3d654e09a3bef1406820565","abstract_canon_sha256":"830ad7787504537837163166e00872cfddc5931f663f92ed29bc13d1d1d55e53"},"schema_version":"1.0"},"canonical_sha256":"72f5766eabf7c9a1c443fd90c9c47d71d507a61f4870f5c8ac5d1e4a49fb95ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:45.342492Z","signature_b64":"T91h6YXXoDBsE+ph48nE2cjlQQXul2YEHdTw0lZ0Tz6bLlI7AuC4S5+ESFvje+vPGTjdOUwNhBQcXW5WuA4/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72f5766eabf7c9a1c443fd90c9c47d71d507a61f4870f5c8ac5d1e4a49fb95ea","last_reissued_at":"2026-05-18T02:43:45.341960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:45.341960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7369","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HD0XglTj7se6EBjpvaPBCUzeCDuiVURtkoO+L9DIIUSCUQMZ7jK3qDbM9v3HM9/UamkN1mu5oGGPmsX6pyBeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:36:00.358442Z"},"content_sha256":"1eb18f58bf1cd3ce938d69ae531067c009c50cd7fcb1a279c9af02494fd2f86e","schema_version":"1.0","event_id":"sha256:1eb18f58bf1cd3ce938d69ae531067c009c50cd7fcb1a279c9af02494fd2f86e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OL2XM3VL67E2DRCD7WIMTRD5OH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Codes are Optimal for Index-Coding Instances with Five or Fewer Receivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong","submitted_at":"2014-01-28T23:30:56Z","abstract_excerpt":"We study zero-error unicast index-coding instances, where each receiver must perfectly decode its requested message set, and the message sets requested by any two receivers do not overlap. We show that for all these instances with up to five receivers, linear index codes are optimal. Although this class contains 9847 non-isomorphic instances, by using our recent results and by properly categorizing the instances based on their graphical representations, we need to consider only 13 non-trivial instances to solve the entire class. This work complements the result by Arbabjolfaei et al. (ISIT 201"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7369","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32zV0VPdBO72X8j78AbYgdHibnWkNxHB4RkUuUJkLTKU5uPe6EhyLWvHdAT0+a5ReGawvNYPQSGIfLsvBSy6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:36:00.358795Z"},"content_sha256":"4ce676274d065ab011a82d53822d16878cc45396b10b5b93a3762e474de1f3ed","schema_version":"1.0","event_id":"sha256:4ce676274d065ab011a82d53822d16878cc45396b10b5b93a3762e474de1f3ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OL2XM3VL67E2DRCD7WIMTRD5OH/bundle.json","state_url":"https://pith.science/pith/OL2XM3VL67E2DRCD7WIMTRD5OH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OL2XM3VL67E2DRCD7WIMTRD5OH/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-23T04:36:00Z","links":{"resolver":"https://pith.science/pith/OL2XM3VL67E2DRCD7WIMTRD5OH","bundle":"https://pith.science/pith/OL2XM3VL67E2DRCD7WIMTRD5OH/bundle.json","state":"https://pith.science/pith/OL2XM3VL67E2DRCD7WIMTRD5OH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OL2XM3VL67E2DRCD7WIMTRD5OH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OL2XM3VL67E2DRCD7WIMTRD5OH","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":"830ad7787504537837163166e00872cfddc5931f663f92ed29bc13d1d1d55e53","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T23:30:56Z","title_canon_sha256":"b70788a5a82ff62a8e4fa816b7da6633fd8f935ea3d654e09a3bef1406820565"},"schema_version":"1.0","source":{"id":"1401.7369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7369","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7369v1","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7369","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"OL2XM3VL67E2","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OL2XM3VL67E2DRCD","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OL2XM3VL","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:4ce676274d065ab011a82d53822d16878cc45396b10b5b93a3762e474de1f3ed","target":"graph","created_at":"2026-05-18T02:43:45Z","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":"We study zero-error unicast index-coding instances, where each receiver must perfectly decode its requested message set, and the message sets requested by any two receivers do not overlap. We show that for all these instances with up to five receivers, linear index codes are optimal. Although this class contains 9847 non-isomorphic instances, by using our recent results and by properly categorizing the instances based on their graphical representations, we need to consider only 13 non-trivial instances to solve the entire class. This work complements the result by Arbabjolfaei et al. (ISIT 201","authors_text":"Lawrence Ong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T23:30:56Z","title":"Linear Codes are Optimal for Index-Coding Instances with Five or Fewer Receivers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7369","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:1eb18f58bf1cd3ce938d69ae531067c009c50cd7fcb1a279c9af02494fd2f86e","target":"record","created_at":"2026-05-18T02:43:45Z","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":"830ad7787504537837163166e00872cfddc5931f663f92ed29bc13d1d1d55e53","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T23:30:56Z","title_canon_sha256":"b70788a5a82ff62a8e4fa816b7da6633fd8f935ea3d654e09a3bef1406820565"},"schema_version":"1.0","source":{"id":"1401.7369","kind":"arxiv","version":1}},"canonical_sha256":"72f5766eabf7c9a1c443fd90c9c47d71d507a61f4870f5c8ac5d1e4a49fb95ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72f5766eabf7c9a1c443fd90c9c47d71d507a61f4870f5c8ac5d1e4a49fb95ea","first_computed_at":"2026-05-18T02:43:45.341960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:45.341960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T91h6YXXoDBsE+ph48nE2cjlQQXul2YEHdTw0lZ0Tz6bLlI7AuC4S5+ESFvje+vPGTjdOUwNhBQcXW5WuA4/CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:45.342492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1eb18f58bf1cd3ce938d69ae531067c009c50cd7fcb1a279c9af02494fd2f86e","sha256:4ce676274d065ab011a82d53822d16878cc45396b10b5b93a3762e474de1f3ed"],"state_sha256":"391137a7bf75fa6f6d65434204798f38b33e6444c9ea702a98469ce2a9612b67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJ6IYshSfozcGjrfTXi4bj3Ylt3VVFlxxiJqMWUW/EdAg+aT/H8eSXUwHXc9qD2i9VXQkSARuNJPm7pD6XmrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:36:00.361129Z","bundle_sha256":"5378b94c70efb23f08f4f941accb4622044d04e4f123b63ed2b63e3c1de34df0"}}