{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SQD77UKOIU73SSXUMDKTCPQPHV","short_pith_number":"pith:SQD77UKO","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"},"canonical_sha256":"9407ffd14e453fb94af460d5313e0f3d7ca9d9291cc25c1d64c9b2ecf3eea08d","source":{"kind":"arxiv","id":"2006.13565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.13565","created_at":"2026-07-05T01:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"2006.13565v1","created_at":"2026-07-05T01:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.13565","created_at":"2026-07-05T01:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"SQD77UKOIU73","created_at":"2026-07-05T01:13:17Z"},{"alias_kind":"pith_short_16","alias_value":"SQD77UKOIU73SSXU","created_at":"2026-07-05T01:13:17Z"},{"alias_kind":"pith_short_8","alias_value":"SQD77UKO","created_at":"2026-07-05T01:13:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SQD77UKOIU73SSXUMDKTCPQPHV","target":"record","payload":{"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"},"canonical_sha256":"9407ffd14e453fb94af460d5313e0f3d7ca9d9291cc25c1d64c9b2ecf3eea08d","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"},"source_kind":"arxiv","source_id":"2006.13565","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWb9xKkPdRTp9Ief7TirdpQtBisLQAJf8bADSu0/h+b39MieskfL2/WCe6xiSQFP9pkkkMXFuUIPOsq2UBKgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:57:05.344908Z"},"content_sha256":"e6d53fb941ab3c5467638382d9d0d9ee6d165c5a40779525663823d05911f12a","schema_version":"1.0","event_id":"sha256:e6d53fb941ab3c5467638382d9d0d9ee6d165c5a40779525663823d05911f12a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SQD77UKOIU73SSXUMDKTCPQPHV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TaXs5RI66TtrTHYpzSmXPB0UPlUMf97lrPwyAFLyulidFW1S+EHzWPp5ljSVpLzJdTZrvNJECQtDj5lR5qBHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:57:05.345695Z"},"content_sha256":"2dbe0518f3e2580c574b2917d68ead7a73487a1231f3af4a874b2d4bf25c1f11","schema_version":"1.0","event_id":"sha256:2dbe0518f3e2580c574b2917d68ead7a73487a1231f3af4a874b2d4bf25c1f11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV/bundle.json","state_url":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQD77UKOIU73SSXUMDKTCPQPHV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T18:57:05Z","links":{"resolver":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV","bundle":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV/bundle.json","state":"https://pith.science/pith/SQD77UKOIU73SSXUMDKTCPQPHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQD77UKOIU73SSXUMDKTCPQPHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SQD77UKOIU73SSXUMDKTCPQPHV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a6ab974a1eec5070a356f587603cd05453be369642544ceef7c9ae0939e1d1d0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-24T08:54:46Z","title_canon_sha256":"f0e4760465e9db417f9f7102ce05e762dec88c9ee166ef9a3aa688db5e7d616e"},"schema_version":"1.0","source":{"id":"2006.13565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.13565","created_at":"2026-07-05T01:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"2006.13565v1","created_at":"2026-07-05T01:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.13565","created_at":"2026-07-05T01:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"SQD77UKOIU73","created_at":"2026-07-05T01:13:17Z"},{"alias_kind":"pith_short_16","alias_value":"SQD77UKOIU73SSXU","created_at":"2026-07-05T01:13:17Z"},{"alias_kind":"pith_short_8","alias_value":"SQD77UKO","created_at":"2026-07-05T01:13:17Z"}],"graph_snapshots":[{"event_id":"sha256:2dbe0518f3e2580c574b2917d68ead7a73487a1231f3af4a874b2d4bf25c1f11","target":"graph","created_at":"2026-07-05T01:13:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.13565/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"H. Vincent Poor, Jun Li, Ming Xiao, P. C. Ching, Xiongwei Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-24T08:54:46Z","title":"Multi-Agent Reinforcement Learning for Cooperative Coded Caching via Homotopy Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.13565","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e6d53fb941ab3c5467638382d9d0d9ee6d165c5a40779525663823d05911f12a","target":"record","created_at":"2026-07-05T01:13:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a6ab974a1eec5070a356f587603cd05453be369642544ceef7c9ae0939e1d1d0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-24T08:54:46Z","title_canon_sha256":"f0e4760465e9db417f9f7102ce05e762dec88c9ee166ef9a3aa688db5e7d616e"},"schema_version":"1.0","source":{"id":"2006.13565","kind":"arxiv","version":1}},"canonical_sha256":"9407ffd14e453fb94af460d5313e0f3d7ca9d9291cc25c1d64c9b2ecf3eea08d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9407ffd14e453fb94af460d5313e0f3d7ca9d9291cc25c1d64c9b2ecf3eea08d","first_computed_at":"2026-07-05T01:13:17.803379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:13:17.803379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dqXsuuGD1IOGxcxxJ+ASMcntLaOfcVNP6SPtfU1HW2EYMB3DYs+h/6kmzIEcLXiwDwG8o+G+HpKfaISSqTfkCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:13:17.803798Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.13565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6d53fb941ab3c5467638382d9d0d9ee6d165c5a40779525663823d05911f12a","sha256:2dbe0518f3e2580c574b2917d68ead7a73487a1231f3af4a874b2d4bf25c1f11"],"state_sha256":"101ddf0e9ced93440a64ff40202b6ffdbb6f994cd0c9bfc91bbdb4f9bd30d44a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1k0kA1cpdUquN5W6HU5vX4/dFpZ0FxRCEzb4beOJsmEgyUiLBocs/k9e87SPBq1cfE4LyL5zL5aTeP4coCulBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:57:05.354779Z","bundle_sha256":"1f117bccf6dd818fb691fd3398cdd16a45204903679a6bebd23123f479ec89d3"}}