{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y6PHS7YGIUMXL2TKUFQDEZQGP5","short_pith_number":"pith:Y6PHS7YG","schema_version":"1.0","canonical_sha256":"c79e797f06451975ea6aa1603266067f488e743747381858dfded2fab23c4778","source":{"kind":"arxiv","id":"1712.08113","version":1},"attestation_state":"computed","paper":{"title":"Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anoop Thomas, B. Sundar Rajan, Nujoom Sageer Karat","submitted_at":"2017-12-21T17:46:25Z","abstract_excerpt":"Coded caching is used to reduce network congestion during peak hours. A single server is connected to a set of users through a bottleneck link, which generally is assumed to be error-free. During non-peak hours, all the users have full access to the files and they fill their local cache with portions of the files available. During delivery phase, each user requests a file and the server delivers coded transmissions to meet the demands taking into consideration their cache contents. In this paper we assume that the shared link is error prone. A new delivery scheme is required to meet the demand"},"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":"1712.08113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T17:46:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"987a0dbd6b2e8e44014cd5287c1caceadcede54d8247d9823d16b384d39ad1a4","abstract_canon_sha256":"ea664692af4e812d52f269996e0282f66ab52e438445d5f5edd130cb9d37aa9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:28.754643Z","signature_b64":"yVbdAzMp/jIBxAky3FLmUerGI6hAC+1BAzhnAQSZyT2IDod9P5zhcHeKhS4ySTOG6JgFO169fukIM50Hc6F4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c79e797f06451975ea6aa1603266067f488e743747381858dfded2fab23c4778","last_reissued_at":"2026-05-18T00:27:28.753804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:28.753804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anoop Thomas, B. Sundar Rajan, Nujoom Sageer Karat","submitted_at":"2017-12-21T17:46:25Z","abstract_excerpt":"Coded caching is used to reduce network congestion during peak hours. A single server is connected to a set of users through a bottleneck link, which generally is assumed to be error-free. During non-peak hours, all the users have full access to the files and they fill their local cache with portions of the files available. During delivery phase, each user requests a file and the server delivers coded transmissions to meet the demands taking into consideration their cache contents. In this paper we assume that the shared link is error prone. A new delivery scheme is required to meet the demand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08113","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":"1712.08113","created_at":"2026-05-18T00:27:28.753919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08113v1","created_at":"2026-05-18T00:27:28.753919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08113","created_at":"2026-05-18T00:27:28.753919+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6PHS7YGIUMX","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6PHS7YGIUMXL2TK","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6PHS7YG","created_at":"2026-05-18T12:31:56.362134+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/Y6PHS7YGIUMXL2TKUFQDEZQGP5","json":"https://pith.science/pith/Y6PHS7YGIUMXL2TKUFQDEZQGP5.json","graph_json":"https://pith.science/api/pith-number/Y6PHS7YGIUMXL2TKUFQDEZQGP5/graph.json","events_json":"https://pith.science/api/pith-number/Y6PHS7YGIUMXL2TKUFQDEZQGP5/events.json","paper":"https://pith.science/paper/Y6PHS7YG"},"agent_actions":{"view_html":"https://pith.science/pith/Y6PHS7YGIUMXL2TKUFQDEZQGP5","download_json":"https://pith.science/pith/Y6PHS7YGIUMXL2TKUFQDEZQGP5.json","view_paper":"https://pith.science/paper/Y6PHS7YG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08113&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6PHS7YGIUMXL2TKUFQDEZQGP5/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6PHS7YGIUMXL2TKUFQDEZQGP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6PHS7YGIUMXL2TKUFQDEZQGP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6PHS7YGIUMXL2TKUFQDEZQGP5/action/storage_attestation","attest_author":"https://pith.science/pith/Y6PHS7YGIUMXL2TKUFQDEZQGP5/action/author_attestation","sign_citation":"https://pith.science/pith/Y6PHS7YGIUMXL2TKUFQDEZQGP5/action/citation_signature","submit_replication":"https://pith.science/pith/Y6PHS7YGIUMXL2TKUFQDEZQGP5/action/replication_record"}},"created_at":"2026-05-18T00:27:28.753919+00:00","updated_at":"2026-05-18T00:27:28.753919+00:00"}