{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KC5SJAB23OH7QZNHU5HVF75UY2","short_pith_number":"pith:KC5SJAB2","schema_version":"1.0","canonical_sha256":"50bb24803adb8ff865a7a74f52ffb4c68648fe74671587539b47099af7f72318","source":{"kind":"arxiv","id":"1701.06814","version":1},"attestation_state":"computed","paper":{"title":"Rate $\\frac{1}{3}$ Index Coding: Forbidden and Feasible Configurations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Prasad Krishnan, V. Lalitha","submitted_at":"2017-01-24T11:17:28Z","abstract_excerpt":"Linear index coding can be formulated as an interference alignment problem, in which precoding vectors of the minimum possible length are to be assigned to the messages in such a way that the precoding vector of a demand (at some receiver) is independent of the space of the interference (non side-information) precoding vectors. An index code has rate $\\frac{1}{l}$ if the assigned vectors are of length $l$. In this paper, we introduce the notion of strictly rate $\\frac{1}{L}$ message subsets which must necessarily be allocated precoding vectors from a strictly $L$-dimensional space ($L=1,2,3$) "},"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":"1701.06814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T11:17:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a6dfc4319be8d4cceee94cd9bc1293a10b4394b241da9a43f4b3ed578fc45219","abstract_canon_sha256":"25369e49d36aec34ae9fbcf9d8f07c72460e8bc327bf38e73df4e6938654e0bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:12.142943Z","signature_b64":"ZgFBlXqswtVKg/fEPoOKgitENswIahxSHDgt2Z07VpXw4ZagW6hz+EyXQHEQ7kWnkqXYEQEwgjGWmR2TaHKaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50bb24803adb8ff865a7a74f52ffb4c68648fe74671587539b47099af7f72318","last_reissued_at":"2026-05-18T00:52:12.142382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:12.142382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate $\\frac{1}{3}$ Index Coding: Forbidden and Feasible Configurations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Prasad Krishnan, V. Lalitha","submitted_at":"2017-01-24T11:17:28Z","abstract_excerpt":"Linear index coding can be formulated as an interference alignment problem, in which precoding vectors of the minimum possible length are to be assigned to the messages in such a way that the precoding vector of a demand (at some receiver) is independent of the space of the interference (non side-information) precoding vectors. An index code has rate $\\frac{1}{l}$ if the assigned vectors are of length $l$. In this paper, we introduce the notion of strictly rate $\\frac{1}{L}$ message subsets which must necessarily be allocated precoding vectors from a strictly $L$-dimensional space ($L=1,2,3$) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06814","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.06814","created_at":"2026-05-18T00:52:12.142471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06814v1","created_at":"2026-05-18T00:52:12.142471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06814","created_at":"2026-05-18T00:52:12.142471+00:00"},{"alias_kind":"pith_short_12","alias_value":"KC5SJAB23OH7","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KC5SJAB23OH7QZNH","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KC5SJAB2","created_at":"2026-05-18T12:31:24.725408+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/KC5SJAB23OH7QZNHU5HVF75UY2","json":"https://pith.science/pith/KC5SJAB23OH7QZNHU5HVF75UY2.json","graph_json":"https://pith.science/api/pith-number/KC5SJAB23OH7QZNHU5HVF75UY2/graph.json","events_json":"https://pith.science/api/pith-number/KC5SJAB23OH7QZNHU5HVF75UY2/events.json","paper":"https://pith.science/paper/KC5SJAB2"},"agent_actions":{"view_html":"https://pith.science/pith/KC5SJAB23OH7QZNHU5HVF75UY2","download_json":"https://pith.science/pith/KC5SJAB23OH7QZNHU5HVF75UY2.json","view_paper":"https://pith.science/paper/KC5SJAB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06814&json=true","fetch_graph":"https://pith.science/api/pith-number/KC5SJAB23OH7QZNHU5HVF75UY2/graph.json","fetch_events":"https://pith.science/api/pith-number/KC5SJAB23OH7QZNHU5HVF75UY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KC5SJAB23OH7QZNHU5HVF75UY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KC5SJAB23OH7QZNHU5HVF75UY2/action/storage_attestation","attest_author":"https://pith.science/pith/KC5SJAB23OH7QZNHU5HVF75UY2/action/author_attestation","sign_citation":"https://pith.science/pith/KC5SJAB23OH7QZNHU5HVF75UY2/action/citation_signature","submit_replication":"https://pith.science/pith/KC5SJAB23OH7QZNHU5HVF75UY2/action/replication_record"}},"created_at":"2026-05-18T00:52:12.142471+00:00","updated_at":"2026-05-18T00:52:12.142471+00:00"}