{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:24J2W2K77HBQYTKB6BGUQNAPWU","short_pith_number":"pith:24J2W2K7","schema_version":"1.0","canonical_sha256":"d713ab695ff9c30c4d41f04d48340fb53e87e879b01af22ba697c32ee466ca3c","source":{"kind":"arxiv","id":"1601.06689","version":1},"attestation_state":"computed","paper":{"title":"A class of index coding problems with rate 1/3","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":"2016-01-25T17:36:00Z","abstract_excerpt":"An index coding problem with $n$ messages has symmetric rate $R$ if all $n$ messages can be conveyed at rate $R$. In a recent work, a class of index coding problems for which symmetric rate $\\frac{1}{3}$ is achievable was characterised using special properties of the side-information available at the receivers. In this paper, we show a larger class of index coding problems (which includes the previous class of problems) for which symmetric rate $\\frac{1}{3}$ is achievable. In the process, we also obtain a stricter necessary condition for rate $\\frac{1}{3}$ feasibility than what is known in lit"},"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":"1601.06689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-25T17:36:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c032acfa5f8e35f0978d3ed667c00553997f9982d253a015d2174ddb5922820","abstract_canon_sha256":"8e0e8ab43f6971709f33819646e7bac567bf4c3e15195a11aca1611ca08f354c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:03.935687Z","signature_b64":"IVZZWK3PRSvYP+NETwc8uBBNaWDpWYbj2kMUOyKxhscbmDWTPe7QPuwg5jUx3qsH6DPU40dZGCsTeesr1LPWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d713ab695ff9c30c4d41f04d48340fb53e87e879b01af22ba697c32ee466ca3c","last_reissued_at":"2026-05-18T01:22:03.935169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:03.935169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A class of index coding problems with rate 1/3","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":"2016-01-25T17:36:00Z","abstract_excerpt":"An index coding problem with $n$ messages has symmetric rate $R$ if all $n$ messages can be conveyed at rate $R$. In a recent work, a class of index coding problems for which symmetric rate $\\frac{1}{3}$ is achievable was characterised using special properties of the side-information available at the receivers. In this paper, we show a larger class of index coding problems (which includes the previous class of problems) for which symmetric rate $\\frac{1}{3}$ is achievable. In the process, we also obtain a stricter necessary condition for rate $\\frac{1}{3}$ feasibility than what is known in lit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06689","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":"1601.06689","created_at":"2026-05-18T01:22:03.935241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06689v1","created_at":"2026-05-18T01:22:03.935241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06689","created_at":"2026-05-18T01:22:03.935241+00:00"},{"alias_kind":"pith_short_12","alias_value":"24J2W2K77HBQ","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"24J2W2K77HBQYTKB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"24J2W2K7","created_at":"2026-05-18T12:29:52.810259+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/24J2W2K77HBQYTKB6BGUQNAPWU","json":"https://pith.science/pith/24J2W2K77HBQYTKB6BGUQNAPWU.json","graph_json":"https://pith.science/api/pith-number/24J2W2K77HBQYTKB6BGUQNAPWU/graph.json","events_json":"https://pith.science/api/pith-number/24J2W2K77HBQYTKB6BGUQNAPWU/events.json","paper":"https://pith.science/paper/24J2W2K7"},"agent_actions":{"view_html":"https://pith.science/pith/24J2W2K77HBQYTKB6BGUQNAPWU","download_json":"https://pith.science/pith/24J2W2K77HBQYTKB6BGUQNAPWU.json","view_paper":"https://pith.science/paper/24J2W2K7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06689&json=true","fetch_graph":"https://pith.science/api/pith-number/24J2W2K77HBQYTKB6BGUQNAPWU/graph.json","fetch_events":"https://pith.science/api/pith-number/24J2W2K77HBQYTKB6BGUQNAPWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24J2W2K77HBQYTKB6BGUQNAPWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24J2W2K77HBQYTKB6BGUQNAPWU/action/storage_attestation","attest_author":"https://pith.science/pith/24J2W2K77HBQYTKB6BGUQNAPWU/action/author_attestation","sign_citation":"https://pith.science/pith/24J2W2K77HBQYTKB6BGUQNAPWU/action/citation_signature","submit_replication":"https://pith.science/pith/24J2W2K77HBQYTKB6BGUQNAPWU/action/replication_record"}},"created_at":"2026-05-18T01:22:03.935241+00:00","updated_at":"2026-05-18T01:22:03.935241+00:00"}