{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SQD77UKOIU73SSXUMDKTCPQPHV","short_pith_number":"pith:SQD77UKO","schema_version":"1.0","canonical_sha256":"9407ffd14e453fb94af460d5313e0f3d7ca9d9291cc25c1d64c9b2ecf3eea08d","source":{"kind":"arxiv","id":"2006.13565","version":1},"attestation_state":"computed","paper":{"title":"Multi-Agent Reinforcement Learning for Cooperative Coded Caching via Homotopy Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Jun Li, Ming Xiao, P. C. Ching, Xiongwei Wu","submitted_at":"2020-06-24T08:54:46Z","abstract_excerpt":"Introducing cooperative coded caching into small cell networks is a promising approach to reducing traffic loads. By encoding content via maximum distance separable (MDS) codes, coded fragments can be collectively cached at small-cell base stations (SBSs) to enhance caching efficiency. However, content popularity is usually time-varying and unknown in practice. As a result, cache contents are anticipated to be intelligently updated by taking into account limited caching storage and interactive impacts among SBSs. In response to these challenges, we propose a multi-agent deep reinforcement lear"},"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":"2006.13565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-24T08:54:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f0e4760465e9db417f9f7102ce05e762dec88c9ee166ef9a3aa688db5e7d616e","abstract_canon_sha256":"a6ab974a1eec5070a356f587603cd05453be369642544ceef7c9ae0939e1d1d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:17.803798Z","signature_b64":"dqXsuuGD1IOGxcxxJ+ASMcntLaOfcVNP6SPtfU1HW2EYMB3DYs+h/6kmzIEcLXiwDwG8o+G+HpKfaISSqTfkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9407ffd14e453fb94af460d5313e0f3d7ca9d9291cc25c1d64c9b2ecf3eea08d","last_reissued_at":"2026-07-05T01:13:17.803379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:17.803379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Reinforcement Learning for Cooperative Coded Caching via Homotopy Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Jun Li, Ming Xiao, P. C. Ching, Xiongwei Wu","submitted_at":"2020-06-24T08:54:46Z","abstract_excerpt":"Introducing cooperative coded caching into small cell networks is a promising approach to reducing traffic loads. By encoding content via maximum distance separable (MDS) codes, coded fragments can be collectively cached at small-cell base stations (SBSs) to enhance caching efficiency. However, content popularity is usually time-varying and unknown in practice. As a result, cache contents are anticipated to be intelligently updated by taking into account limited caching storage and interactive impacts among SBSs. In response to these challenges, we propose a multi-agent deep reinforcement lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.13565","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/2006.13565/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":"2006.13565","created_at":"2026-07-05T01:13:17.803445+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.13565v1","created_at":"2026-07-05T01:13:17.803445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.13565","created_at":"2026-07-05T01:13:17.803445+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQD77UKOIU73","created_at":"2026-07-05T01:13:17.803445+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQD77UKOIU73SSXU","created_at":"2026-07-05T01:13:17.803445+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQD77UKO","created_at":"2026-07-05T01:13:17.803445+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/SQD77UKOIU73SSXUMDKTCPQPHV","json":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV.json","graph_json":"https://pith.science/api/pith-number/SQD77UKOIU73SSXUMDKTCPQPHV/graph.json","events_json":"https://pith.science/api/pith-number/SQD77UKOIU73SSXUMDKTCPQPHV/events.json","paper":"https://pith.science/paper/SQD77UKO"},"agent_actions":{"view_html":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV","download_json":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV.json","view_paper":"https://pith.science/paper/SQD77UKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.13565&json=true","fetch_graph":"https://pith.science/api/pith-number/SQD77UKOIU73SSXUMDKTCPQPHV/graph.json","fetch_events":"https://pith.science/api/pith-number/SQD77UKOIU73SSXUMDKTCPQPHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV/action/storage_attestation","attest_author":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV/action/author_attestation","sign_citation":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV/action/citation_signature","submit_replication":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV/action/replication_record"}},"created_at":"2026-07-05T01:13:17.803445+00:00","updated_at":"2026-07-05T01:13:17.803445+00:00"}