{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ATW6TXEQZVUZK6H2KWRYRM252N","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":"da31aa0d08599ac4b96a9b14c2e8eb4cf711faee81b2da47c32fb474d3a03cc8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-11T18:45:48Z","title_canon_sha256":"c2285da719415f710252ec40acb06e14fcd23093345838e50fd54a74d503b872"},"schema_version":"1.0","source":{"id":"1408.3046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3046","created_at":"2026-05-18T02:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3046v1","created_at":"2026-05-18T02:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3046","created_at":"2026-05-18T02:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"ATW6TXEQZVUZ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ATW6TXEQZVUZK6H2","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ATW6TXEQ","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:2635d876f2ac74572860fe2e35d8ab0a36ec3681b76816ae07851199bc51affe","target":"graph","created_at":"2026-05-18T02:45:15Z","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 paper, a general algorithm is proposed for rate analysis and code design of linear index coding problems. Specifically a solution for minimum rank matrix completion problem over finite fields representing the linear index coding problem is devised in order to find the optimum transmission rate given vector length and size of the field. The new approach can be applied to both scalar and vector linear index coding.","authors_text":"Babak Hassibi, Farshad Lahouti, Homa Esfahanizadeh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-11T18:45:48Z","title":"A Matrix Completion Approach to Linear Index Coding Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3046","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:2a4021c1f2157bbc18ef6568e9c5fd6e08f67c48044673e2845aee8053f998c6","target":"record","created_at":"2026-05-18T02:45:15Z","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":"da31aa0d08599ac4b96a9b14c2e8eb4cf711faee81b2da47c32fb474d3a03cc8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-11T18:45:48Z","title_canon_sha256":"c2285da719415f710252ec40acb06e14fcd23093345838e50fd54a74d503b872"},"schema_version":"1.0","source":{"id":"1408.3046","kind":"arxiv","version":1}},"canonical_sha256":"04ede9dc90cd699578fa55a388b35dd36640ef34e8501fd2cd84cb3291bcc8e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04ede9dc90cd699578fa55a388b35dd36640ef34e8501fd2cd84cb3291bcc8e7","first_computed_at":"2026-05-18T02:45:15.169327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:15.169327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4hsiWdP48KycNoypq8rTC1Vh5VJmOb3tyml8Gv3evS3aKXvFqN7CYmT6xCN1OGQ0paIWGRIV5f5ehESUoDNEBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:15.169883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a4021c1f2157bbc18ef6568e9c5fd6e08f67c48044673e2845aee8053f998c6","sha256:2635d876f2ac74572860fe2e35d8ab0a36ec3681b76816ae07851199bc51affe"],"state_sha256":"be162da91e344d6314263e33ed87c6f1172891987f16e10930db079acb756d7d"}