{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X3UAO3TU2FGPOWB7DM777L5QVX","short_pith_number":"pith:X3UAO3TU","schema_version":"1.0","canonical_sha256":"bee8076e74d14cf7583f1b3fffafb0addc3247e1766444d64af1111c0497b57b","source":{"kind":"arxiv","id":"1901.05908","version":1},"attestation_state":"computed","paper":{"title":"Locality in Index Coding for Large Min-Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hoang Dau, Lakshmi Natarajan, Prasad Krishnan, V. Lalitha","submitted_at":"2019-01-17T17:17:25Z","abstract_excerpt":"An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols instead of observing the entire codeword. Local decodability can be a beneficial feature in some communication scenarios, such as when the receivers can afford to listen to only a part of the transmissions because of limited availability of power. The locality of an index code is the ratio of the maximum number of codeword symbols queried by a receiver to the message length. In this paper we analyze the optimum localit"},"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":"1901.05908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T17:17:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"76a4b17ffe2a565f263f3a21d1eee44bd00a17445097f579a5362111a75541eb","abstract_canon_sha256":"03da53ad7f79959288ea0aa9bf2ba0d692487e49224e7921bd6dd18764df999b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:05.847966Z","signature_b64":"Ye0F6vfDSFeTBRkHj++26Nlx6Yg8tiRWBKhZTd2dbX67vJx+kDQFVyYatHo+WUmBt9HBvllRT5VxIxQbcL1bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bee8076e74d14cf7583f1b3fffafb0addc3247e1766444d64af1111c0497b57b","last_reissued_at":"2026-05-17T23:56:05.847424Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:05.847424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locality in Index Coding for Large Min-Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hoang Dau, Lakshmi Natarajan, Prasad Krishnan, V. Lalitha","submitted_at":"2019-01-17T17:17:25Z","abstract_excerpt":"An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols instead of observing the entire codeword. Local decodability can be a beneficial feature in some communication scenarios, such as when the receivers can afford to listen to only a part of the transmissions because of limited availability of power. The locality of an index code is the ratio of the maximum number of codeword symbols queried by a receiver to the message length. In this paper we analyze the optimum localit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05908","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":"1901.05908","created_at":"2026-05-17T23:56:05.847542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05908v1","created_at":"2026-05-17T23:56:05.847542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05908","created_at":"2026-05-17T23:56:05.847542+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3UAO3TU2FGP","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3UAO3TU2FGPOWB7","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3UAO3TU","created_at":"2026-05-18T12:33:33.725879+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/X3UAO3TU2FGPOWB7DM777L5QVX","json":"https://pith.science/pith/X3UAO3TU2FGPOWB7DM777L5QVX.json","graph_json":"https://pith.science/api/pith-number/X3UAO3TU2FGPOWB7DM777L5QVX/graph.json","events_json":"https://pith.science/api/pith-number/X3UAO3TU2FGPOWB7DM777L5QVX/events.json","paper":"https://pith.science/paper/X3UAO3TU"},"agent_actions":{"view_html":"https://pith.science/pith/X3UAO3TU2FGPOWB7DM777L5QVX","download_json":"https://pith.science/pith/X3UAO3TU2FGPOWB7DM777L5QVX.json","view_paper":"https://pith.science/paper/X3UAO3TU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05908&json=true","fetch_graph":"https://pith.science/api/pith-number/X3UAO3TU2FGPOWB7DM777L5QVX/graph.json","fetch_events":"https://pith.science/api/pith-number/X3UAO3TU2FGPOWB7DM777L5QVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3UAO3TU2FGPOWB7DM777L5QVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3UAO3TU2FGPOWB7DM777L5QVX/action/storage_attestation","attest_author":"https://pith.science/pith/X3UAO3TU2FGPOWB7DM777L5QVX/action/author_attestation","sign_citation":"https://pith.science/pith/X3UAO3TU2FGPOWB7DM777L5QVX/action/citation_signature","submit_replication":"https://pith.science/pith/X3UAO3TU2FGPOWB7DM777L5QVX/action/replication_record"}},"created_at":"2026-05-17T23:56:05.847542+00:00","updated_at":"2026-05-17T23:56:05.847542+00:00"}