{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XC3EJEODSXXWQOYCMHB2OTZ5WH","short_pith_number":"pith:XC3EJEOD","schema_version":"1.0","canonical_sha256":"b8b64491c395ef683b0261c3a74f3db1fad9960493b32d5b1baaa998d8b3cc19","source":{"kind":"arxiv","id":"1912.04321","version":1},"attestation_state":"computed","paper":{"title":"Learning to Code: Coded Caching via Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Navid Naderializadeh, Seyed Mohammad Asghari","submitted_at":"2019-12-09T19:05:41Z","abstract_excerpt":"We consider a system comprising a file library and a network with a server and multiple users equipped with cache memories. The system operates in two phases: a prefetching phase, where users load their caches with parts of contents from the library, and a delivery phase, where users request files from the library and the server needs to send the uncached parts of the requested files to the users. For the case where the users' caches are arbitrarily loaded, we propose an algorithm based on deep reinforcement learning to minimize the delay of delivering requested contents to the users in the de"},"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":"1912.04321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-12-09T19:05:41Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"04eb87db962c254634da1531ac7ec65510c2c4a240f7898a757ae8f6cf63f988","abstract_canon_sha256":"a973501e700fa3d9aa72cf81ce3e16a5b8e9e898f2cd2f2411c565fe0396f391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:24:57.167395Z","signature_b64":"kprJzHNH6aW3pjk99LOEkY2bS4ZhaeEFP9Mw3tL9SyjH+68byLs9XICUhwXEcfknNK5JR8Mf7z/W2gJ4DAiQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8b64491c395ef683b0261c3a74f3db1fad9960493b32d5b1baaa998d8b3cc19","last_reissued_at":"2026-07-05T00:24:57.166990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:24:57.166990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Code: Coded Caching via Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Navid Naderializadeh, Seyed Mohammad Asghari","submitted_at":"2019-12-09T19:05:41Z","abstract_excerpt":"We consider a system comprising a file library and a network with a server and multiple users equipped with cache memories. The system operates in two phases: a prefetching phase, where users load their caches with parts of contents from the library, and a delivery phase, where users request files from the library and the server needs to send the uncached parts of the requested files to the users. For the case where the users' caches are arbitrarily loaded, we propose an algorithm based on deep reinforcement learning to minimize the delay of delivering requested contents to the users in the de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.04321","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.04321/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.04321","created_at":"2026-07-05T00:24:57.167057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.04321v1","created_at":"2026-07-05T00:24:57.167057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.04321","created_at":"2026-07-05T00:24:57.167057+00:00"},{"alias_kind":"pith_short_12","alias_value":"XC3EJEODSXXW","created_at":"2026-07-05T00:24:57.167057+00:00"},{"alias_kind":"pith_short_16","alias_value":"XC3EJEODSXXWQOYC","created_at":"2026-07-05T00:24:57.167057+00:00"},{"alias_kind":"pith_short_8","alias_value":"XC3EJEOD","created_at":"2026-07-05T00:24:57.167057+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/XC3EJEODSXXWQOYCMHB2OTZ5WH","json":"https://pith.science/pith/XC3EJEODSXXWQOYCMHB2OTZ5WH.json","graph_json":"https://pith.science/api/pith-number/XC3EJEODSXXWQOYCMHB2OTZ5WH/graph.json","events_json":"https://pith.science/api/pith-number/XC3EJEODSXXWQOYCMHB2OTZ5WH/events.json","paper":"https://pith.science/paper/XC3EJEOD"},"agent_actions":{"view_html":"https://pith.science/pith/XC3EJEODSXXWQOYCMHB2OTZ5WH","download_json":"https://pith.science/pith/XC3EJEODSXXWQOYCMHB2OTZ5WH.json","view_paper":"https://pith.science/paper/XC3EJEOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.04321&json=true","fetch_graph":"https://pith.science/api/pith-number/XC3EJEODSXXWQOYCMHB2OTZ5WH/graph.json","fetch_events":"https://pith.science/api/pith-number/XC3EJEODSXXWQOYCMHB2OTZ5WH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XC3EJEODSXXWQOYCMHB2OTZ5WH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XC3EJEODSXXWQOYCMHB2OTZ5WH/action/storage_attestation","attest_author":"https://pith.science/pith/XC3EJEODSXXWQOYCMHB2OTZ5WH/action/author_attestation","sign_citation":"https://pith.science/pith/XC3EJEODSXXWQOYCMHB2OTZ5WH/action/citation_signature","submit_replication":"https://pith.science/pith/XC3EJEODSXXWQOYCMHB2OTZ5WH/action/replication_record"}},"created_at":"2026-07-05T00:24:57.167057+00:00","updated_at":"2026-07-05T00:24:57.167057+00:00"}