{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YC2UU2CATD2FEBHYCGJMLRUVV6","short_pith_number":"pith:YC2UU2CA","schema_version":"1.0","canonical_sha256":"c0b54a684098f45204f81192c5c695af9e144273cbcc372d1062e8f469178100","source":{"kind":"arxiv","id":"1801.03895","version":1},"attestation_state":"computed","paper":{"title":"On Locally Decodable Index Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lakshmi Natarajan, Prasad Krishnan, V. Lalitha","submitted_at":"2018-01-11T17:41:25Z","abstract_excerpt":"Index coding achieves bandwidth savings by jointly encoding the messages demanded by all the clients in a broadcast channel. The encoding is performed in such a way that each client can retrieve its demanded message from its side information and the broadcast codeword. In general, in order to decode its demanded message symbol, a receiver may have to observe the entire transmitted codeword. Querying or downloading the codeword symbols might involve costs to a client -- such as network utilization costs and storage requirements for the queried symbols to perform decoding. In traditional index c"},"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":"1801.03895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T17:41:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d549dfa3b2e036f02a6e50274a03c19e74d6e1c58083edca5e148bf0e59b82b5","abstract_canon_sha256":"f3108b40c586d470191df4e7001aee092f8af7376277a5890b1e8693b1294156"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:13.277698Z","signature_b64":"NFrhiGmQGE0iFxwogljcbOQYBzEepT1LZyCNWboXGRnmq4gXr2x6+YAbIbIFqX8Nct1MtesMdkHGy/FYqKpxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0b54a684098f45204f81192c5c695af9e144273cbcc372d1062e8f469178100","last_reissued_at":"2026-05-18T00:26:13.277211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:13.277211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Locally Decodable Index Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lakshmi Natarajan, Prasad Krishnan, V. Lalitha","submitted_at":"2018-01-11T17:41:25Z","abstract_excerpt":"Index coding achieves bandwidth savings by jointly encoding the messages demanded by all the clients in a broadcast channel. The encoding is performed in such a way that each client can retrieve its demanded message from its side information and the broadcast codeword. In general, in order to decode its demanded message symbol, a receiver may have to observe the entire transmitted codeword. Querying or downloading the codeword symbols might involve costs to a client -- such as network utilization costs and storage requirements for the queried symbols to perform decoding. In traditional index c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03895","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":"1801.03895","created_at":"2026-05-18T00:26:13.277293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03895v1","created_at":"2026-05-18T00:26:13.277293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03895","created_at":"2026-05-18T00:26:13.277293+00:00"},{"alias_kind":"pith_short_12","alias_value":"YC2UU2CATD2F","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YC2UU2CATD2FEBHY","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YC2UU2CA","created_at":"2026-05-18T12:33:04.347982+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/YC2UU2CATD2FEBHYCGJMLRUVV6","json":"https://pith.science/pith/YC2UU2CATD2FEBHYCGJMLRUVV6.json","graph_json":"https://pith.science/api/pith-number/YC2UU2CATD2FEBHYCGJMLRUVV6/graph.json","events_json":"https://pith.science/api/pith-number/YC2UU2CATD2FEBHYCGJMLRUVV6/events.json","paper":"https://pith.science/paper/YC2UU2CA"},"agent_actions":{"view_html":"https://pith.science/pith/YC2UU2CATD2FEBHYCGJMLRUVV6","download_json":"https://pith.science/pith/YC2UU2CATD2FEBHYCGJMLRUVV6.json","view_paper":"https://pith.science/paper/YC2UU2CA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03895&json=true","fetch_graph":"https://pith.science/api/pith-number/YC2UU2CATD2FEBHYCGJMLRUVV6/graph.json","fetch_events":"https://pith.science/api/pith-number/YC2UU2CATD2FEBHYCGJMLRUVV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YC2UU2CATD2FEBHYCGJMLRUVV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YC2UU2CATD2FEBHYCGJMLRUVV6/action/storage_attestation","attest_author":"https://pith.science/pith/YC2UU2CATD2FEBHYCGJMLRUVV6/action/author_attestation","sign_citation":"https://pith.science/pith/YC2UU2CATD2FEBHYCGJMLRUVV6/action/citation_signature","submit_replication":"https://pith.science/pith/YC2UU2CATD2FEBHYCGJMLRUVV6/action/replication_record"}},"created_at":"2026-05-18T00:26:13.277293+00:00","updated_at":"2026-05-18T00:26:13.277293+00:00"}