{"as_of":"2026-08-13T18:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15b7dc7dedf9666a82d65d82580d7aa3158a48e43173d50c5cdec5f797a77a94","coverage":[{"denominator":74,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":74,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T00:06:26.424922Z","state":"measured"},{"denominator":74,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":74,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.12220/citation-record","integrity":"/paper/2602.12220/integrity","json":"/paper/2602.12220/citation-record.json","paper":"/paper/2602.12220"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:20.838080Z","title":"A new design framework on D2D coded caching with optimal rate and less subpacketizations,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:20.838080Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:c56bb37888685ee177beb7f85d4d3b317f66b0ae1fe8d1e1f0cf1625dbc96018","observation_id":"322be63f-1e70-44db-9c94-169707236b1a","resolution":{"observed_at":"2026-08-03T00:06:20.838080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:20.898459Z","title":"Finite-length analysis of D2D coded caching via exploiting asymmetry in delivery,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:20.898459Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:b7ad185ad662bd10c3c017b24f671275f9ab693fa8a29a2aab8a7d12af0c1371","observation_id":"2a48a5f6-a84f-4d66-a8da-8996e553126d","resolution":{"observed_at":"2026-08-03T00:06:20.898459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:20.960560Z","title":"Fundamental limits of caching in wireless D2D networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:20.960560Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:d6f16186b9380b3540f33a795d911affd88393a5cf811ef8b4ae1b65c76f952b","observation_id":"f4199134-079d-4b09-ae52-5ded412674a0","resolution":{"observed_at":"2026-08-03T00:06:20.960560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.031821Z","title":"Fundamental limits of caching,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.031821Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:0166c688c722d0d9614ce05f16b0242676752778e538fbad4dcb59eed23c8185","observation_id":"0268e19a-ad32-4958-b275-9fe1417310ef","resolution":{"observed_at":"2026-08-03T00:06:21.031821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.117473Z","title":"Coded caching with nonuniform demands,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.117473Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:a16b8490bf0481f3ee717965570bc269ebbc530ed3c4715222b1229b665593c4","observation_id":"2d443294-2b97-4c22-a4d2-19d4deb4af2d","resolution":{"observed_at":"2026-08-03T00:06:21.117473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.180612Z","title":"The exact rate-memory tradeoff for caching with uncoded prefetching,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.180612Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:ce1f4655f2a5e13fd23aba0131190627b189e31bd500e3632c8c9dd1709dca4e","observation_id":"874816df-329f-4902-8d7f-934c794dab4c","resolution":{"observed_at":"2026-08-03T00:06:21.180612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.253745Z","title":"On the fundamental limits of caching in combination networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.253745Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:b8bc596d84ead8120c173ef521caffa0b7eaf94e70fe573f5881158219f9abd0","observation_id":"44a78dd7-7220-4f6d-b318-4aaa448472f1","resolution":{"observed_at":"2026-08-03T00:06:21.253745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.330909Z","title":"Fundamental limits of caching with secure delivery,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.330909Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:a82d5275ccec8deaac0f70b2ccae9efb7c32d232f374fc41db1a1b593dad7b54","observation_id":"e53887ba-1c81-4bc9-ac05-5aa7fa41617a","resolution":{"observed_at":"2026-08-03T00:06:21.330909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.442819Z","title":"Fundamental limits of cache-aided interference management,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.442819Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:9978c30126b843de7d9f2e3daff5b53ba996dcc149758cce65275c101f5ad85e","observation_id":"95579c93-930b-467d-8a35-657f1cdd2a82","resolution":{"observed_at":"2026-08-03T00:06:21.442819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.525078Z","title":"Cache-aided interference management using hypercube combinatorial design with reduced subpacketizations and order optimal sum-degrees of freedom,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.525078Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:2643fe08b5f2e21aa6424b06d4b7a9280110181667165ba041c9a9df793efda3","observation_id":"619c596c-aefe-418d-999b-5e06d6754e71","resolution":{"observed_at":"2026-08-03T00:06:21.525078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.648006Z","title":"Femtocaching: Wireless content delivery through distributed caching helpers,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.648006Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:e0134839926c31dda03ea346846a558512614449142f20833d9079ffbd3e084a","observation_id":"59bcee09-7b45-43e8-95e8-56e66c91a64d","resolution":{"observed_at":"2026-08-03T00:06:21.648006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.758610Z","title":"The exact rate-memory tradeoff for caching with uncoded prefetching,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.758610Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:497e5164f9377ac70c8ae743ee961a9935de37fa91e3856760b02876a5819819","observation_id":"6a93b7ac-ab39-4359-8a76-114f213d6be2","resolution":{"observed_at":"2026-08-03T00:06:21.758610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.830126Z","title":"Hierarchical coded caching,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.830126Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:e240547c70113cfae50a40eea7da4e56b29c550adfafe0fa1ab2b644cc5c3fb5","observation_id":"3642afbf-1931-4c4f-a739-f8dbb532fb7e","resolution":{"observed_at":"2026-08-03T00:06:21.830126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.905563Z","title":"Content delivery via multi-server coded caching in linear networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.905563Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:9e3c224a75be033a47e9b9f1e68bcf6666368077d6687ab51940ebe340a98194","observation_id":"ada00552-4e28-4362-a525-78762f431658","resolution":{"observed_at":"2026-08-03T00:06:21.905563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:21.977388Z","title":"On the fundamental limits of cache-aided multiuser private information retrieval,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:21.977388Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:80c14e4d3f3c5a89ed8e1730575a2296584c3c442db132026f07abd08cf628ef","observation_id":"54009697-8270-4543-ad7f-3c19f9b7d9f8","resolution":{"observed_at":"2026-08-03T00:06:21.977388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.057244Z","title":"A fundamental tradeoff between computation and communication in distributed computing,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.057244Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:b795dd4e300c7fa45c8d28d8c6aa903c76663438de230081f84ec71123b6ac5e","observation_id":"7444a1ae-dabf-4536-88c6-76f34ed25bfb","resolution":{"observed_at":"2026-08-03T00:06:22.057244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.129376Z","title":"Optimal throughput-outage analysis of cache-aided wireless multi-hop d2d networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.129376Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:42799aa995fdc82a48b2bab014801d6b6468d44102fc2ff0ac53f404f1e5ccfa","observation_id":"e689dd0d-7ff1-4a4b-a2e6-d94d6460d074","resolution":{"observed_at":"2026-08-03T00:06:22.129376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.161931Z","title":"On the optimality of D2D coded caching with uncoded cache placement and one-shot delivery,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.161931Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:aec725671ab247f2a9a5497cb4c5307612fa46bfa30debb5636ba03e01ea7a2f","observation_id":"56bc88a3-727b-45a3-b876-820095a24d33","resolution":{"observed_at":"2026-08-03T00:06:22.161931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.164770Z","title":"Device-to-Device secure coded caching,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.164770Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:dc04fd2999c7ea7850ce461e023b024c1a38599a80e3d2cf952bb3e869bc17e8","observation_id":"bd9550b3-5229-42ce-9c7c-5a03e7310c09","resolution":{"observed_at":"2026-08-03T00:06:22.164770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.184773Z","title":"Device-to-device coded-caching with distinct cache sizes,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.184773Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:70ab4012f65117218fa8eacc65bd16497cc18b1f1760401f51b48c550c434535","observation_id":"5c9cd789-4dbc-4759-948f-13dc639cdc1d","resolution":{"observed_at":"2026-08-03T00:06:22.184773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.276674Z","title":"Device-to-Device coded caching with distinct cache sizes,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.276674Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:92f005917e9f28af40704f3e0c9011c19ebd417d8e3873bab9dd2b1e1685fc90","observation_id":"66ab3a10-28dd-4e04-ba9b-130da08b4989","resolution":{"observed_at":"2026-08-03T00:06:22.276674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.435188Z","title":"On the fundamental limits of Device-to-Device private caching under uncoded cache placement and user collusion,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.435188Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:ece59d07e29360d8c27cd5b7e7dc8b2aa33f64eaf361c486836f400f035d2f40","observation_id":"ade93161-914c-4bf3-8e01-742d4ff858c3","resolution":{"observed_at":"2026-08-03T00:06:22.435188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.533353Z","title":"Optimal caching policy for D2D assisted cellular networks with different cache size devices,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.533353Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:6d8938876926d7f70af6dc086589cfdeef25c0bd98d3a62c721739e4d6d4b74e","observation_id":"8bcbb094-942e-4288-85d3-d347723ac3c4","resolution":{"observed_at":"2026-08-03T00:06:22.533353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.648565Z","title":"Fundamental limits of coded caching in request-robust d2d communication networks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.648565Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:0276c98eab9b1486b3d33eb20bbff109dac0868f3fcdadc29298d0da95800695","observation_id":"c7de26cf-1292-4b75-beca-e9104c7e8a25","resolution":{"observed_at":"2026-08-03T00:06:22.648565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.746246Z","title":"Adding transmitters dramatically boosts coded caching gains for finite file sizes,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.746246Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:cea9157ad480cc940faa9710e2cba87e9fcf6c255ed75c5b343ec3cd18e2a26e","observation_id":"a6adc649-a589-40ea-ac8a-4cec4f5f48b7","resolution":{"observed_at":"2026-08-03T00:06:22.746246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.828997Z","title":"Finite-length analysis of caching-aided coded multicasting,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.828997Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:5bb030683d6238de34828e7a4ccaadd3a2eca85656e09bd36d038613ee551a3f","observation_id":"7896233b-a059-493a-b46e-69341f38751d","resolution":{"observed_at":"2026-08-03T00:06:22.828997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.882596Z","title":"On the placement delivery array design for centralized coded caching scheme,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.882596Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:e25518c4c38d3cc8d87f6fe4549292c68d899c8a889a1fb770cb8fdd1077ea7d","observation_id":"55e97828-3534-4e19-a65e-0883d0f31cba","resolution":{"observed_at":"2026-08-03T00:06:22.882596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.944653Z","title":"A framework of constructing placement delivery arrays for centralized coded caching,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.944653Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:8e712054e793143a1f4f13be08e847709cf3f91e944d9386ebf63eebff36a3a0","observation_id":"1e2a1c63-546e-4b41-b0e9-e6a6598dd085","resolution":{"observed_at":"2026-08-03T00:06:22.944653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:22.992342Z","title":"Improving placement delivery array coded caching schemes with coded placement,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:22.992342Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:1525b340d031a17103d3d2ffa04c870b536d440f201c0c07273eda12201a92b8","observation_id":"53c43e2e-898c-48ad-bea9-21a8d0257961","resolution":{"observed_at":"2026-08-03T00:06:22.992342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.045983Z","title":"Placement delivery array based on concatenating construction,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.045983Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:ac299d02e8c8918425022a75dcb3f1946709cfad4b350fc5e0b1bffbc6cc94f8","observation_id":"90ebd2b3-065d-4214-908c-459d1b56222c","resolution":{"observed_at":"2026-08-03T00:06:23.045983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.131338Z","title":"Placement delivery array design through strong edge coloring of bipartite graphs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.131338Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:0a3fb9f88cb558044bdb0459929dc51f7d8c81fd9d613f5fe476589be8a17f86","observation_id":"14e3246b-5fdb-44ad-9611-f4a9f4c80ccf","resolution":{"observed_at":"2026-08-03T00:06:23.131338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.187351Z","title":"Constructions of coded caching schemes with flexible memory size,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.187351Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:aa42ca1e0996cf0bf030afdd2834ffb7fa7979b5e50cccd9f452c50110e46103","observation_id":"8c3d3030-247b-47e3-b68c-20c47c74c4e2","resolution":{"observed_at":"2026-08-03T00:06:23.187351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.240015Z","title":"Centralized coded caching schemes: A hypergraph theoretical approach,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.240015Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:69eb0a80834bffef0649e807f6c03065708f8bcef0a59debd474fbc3094539ff","observation_id":"dfb25f78-cae2-451a-935c-12a7337efd45","resolution":{"observed_at":"2026-08-03T00:06:23.240015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.295860Z","title":"Coded caching schemes with reduced subpacketization from linear block codes,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.295860Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:6801ade0d0efdcbfe05e7201fdf90161f14929f9421639216dd0fc1610d245c2","observation_id":"997a13f9-616f-494c-8ccc-61f13abb0587","resolution":{"observed_at":"2026-08-03T00:06:23.295860Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.353588Z","title":"A unified Ruzsa-Szem´ eredi framework for finite-length coded caching,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.353588Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:9df3677386eaa16c0529f3f52085b45f5d1f7ae612fdb2b877480fc6cb645d3e","observation_id":"25bbe275-debe-450d-bdc1-6261719b2e58","resolution":{"observed_at":"2026-08-03T00:06:23.353588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.405095Z","title":"Coded caching with linear subpacketization is possible using Ruzsa-Szem´ eredi graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.405095Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:56ce46e0f809a5a386d9cd53c73b8eea0e96e1d916d2c7156dbf6e87bbbe9b75","observation_id":"ceb01341-83a2-4a91-acea-29d333fea048","resolution":{"observed_at":"2026-08-03T00:06:23.405095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.461198Z","title":"Coded caching via line graphs of bipartite graphs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.461198Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:f0deafabf346f56cca528b6b98ad3df3676e0c4ff74b237658a7968960145637","observation_id":"c5ccfc4d-089e-4708-8f12-30722ea60bca","resolution":{"observed_at":"2026-08-03T00:06:23.461198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.512643Z","title":"Subexponential and linear subpacketization coded caching via projective geometry,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.512643Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:db10d47f3fed9fde96cd7365011f251d9cd1c0e6e73e7ab08f9278fb1e385e5b","observation_id":"9b68ee7d-3144-42a5-b37a-3c0cc29b816b","resolution":{"observed_at":"2026-08-03T00:06:23.512643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.568017Z","title":"A multi-antenna coded caching scheme with linear subpacketization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.568017Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:a0cfdeda9f3a4a162865bbb1a4d31160eb36800f29f087c19fc13f5389af5f3d","observation_id":"7572ba62-507a-41f4-93fb-04f54ebaabfa","resolution":{"observed_at":"2026-08-03T00:06:23.568017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.642702Z","title":"Multi-antenna coded caching analysis in finite SNR and finite subpacketization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.642702Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:5100bd26ec7daf5ffcda9ba9a6235a34e4aae366a96a52549f0b4616a8c8b05c","observation_id":"e9ba2532-6dc2-476b-a105-cf5ddddcd5a1","resolution":{"observed_at":"2026-08-03T00:06:23.642702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.694817Z","title":"Diagonal multi-antenna coded caching for reduced subpacketization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.694817Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:948ce51279a64cbbb152292346220eb2322ce0feb6fa560fcc816754bc141cfe","observation_id":"2240c375-7eb0-4502-a33a-80b35a83ae54","resolution":{"observed_at":"2026-08-03T00:06:23.694817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.777869Z","title":"Bridging two extremes: Multi-antenna coded caching with reduced subpacketization and CSIT,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.777869Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:e1303649c7d31fb21157030641ab8e693e1d7b212f28439e3249cfad0985d6c5","observation_id":"22210600-288b-4397-9a6e-3f7a44ee9c79","resolution":{"observed_at":"2026-08-03T00:06:23.777869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.864885Z","title":"Cache-aided interference management using hypercube combinatorial cache designs,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.864885Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:e944deaf734550dce4ba4f9464e8abee36997e67c5f2ee3e0b4de92b93338aa4","observation_id":"b86c48b0-82ff-4a0c-bc30-dc52b446c0d1","resolution":{"observed_at":"2026-08-03T00:06:23.864885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.922498Z","title":"Multi-antenna interference management for coded caching,","venue":null,"work_id":null,"year":2091},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.922498Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:cd50afcc9b52ac72ef09a32af36d2a4f62316b143d4d8e19293935eb222ef513","observation_id":"112e75aa-8305-428e-9ee0-b0ea110ea54f","resolution":{"observed_at":"2026-08-03T00:06:23.922498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:23.998646Z","title":"Stochastic coded caching with optimized shared-cache sizes and reduced subpacketization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:23.998646Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:7668ec2e5cc3e55ebcd617fa7f95ebb2230e1a843a28a4225bdda7e382534e54","observation_id":"1769b7f3-0ada-42ef-bab2-35a2e9a41de2","resolution":{"observed_at":"2026-08-03T00:06:23.998646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.084647Z","title":"A low-subpacketization high-performance mimo coded caching scheme,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.084647Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:fdc9662c8746654e49b418d4c9d5cd6701c362d68502df6f15fc08325ba98bbd","observation_id":"dcdc96bd-9521-4de8-ab77-33a1d3a5f76c","resolution":{"observed_at":"2026-08-03T00:06:24.084647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.12231","last_updated":"2021-10-11T12:31:03Z","snapshot_observed_at":"2026-08-05T20:25:06.837703Z","submitted_at":"2020-09-25T13:25:30Z","title":"Low-Complexity High-Performance Cyclic Caching for Large MISO Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.12231","snapshot_observed_at":"2026-08-03T00:06:24.139786Z","title":"Low-complexity high-performance cyclic caching for large miso systems,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.139786Z"},"links":{"cited_paper":"/paper/2009.12231","citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:298f549a53f9124e2d0d76ca5dbb1dc31fd19fbf0e10c7482a970f42d7fabd21","observation_id":"388918be-320d-42c1-b9c7-db96c1c8e0be","resolution":{"observed_at":"2026-08-03T00:06:24.139786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.193140Z","title":"Multi-access coded caching scheme with linear sub-packetization using pdas,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.193140Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:2a5706af183351ca6b461714cd6b245592927dbe012f637a562e81717dcef4fb","observation_id":"bc0db285-2815-44da-a995-26b58f01e56b","resolution":{"observed_at":"2026-08-03T00:06:24.193140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.293930Z","title":"Fundamental limits of combinatorial multi-access caching,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.293930Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:e531a838d4a5830e91f484f3a604870f205a3e1e3954245a5afc751142fac8ae","observation_id":"4f4cfc8d-6f7d-49e0-961b-b4165c8dd44b","resolution":{"observed_at":"2026-08-03T00:06:24.293930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.347498Z","title":"Asymptotically optimal coded distributed computing via combinatorial designs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.347498Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:7237e9aa83f2017affa11c3c4f5b05056bb9565e95c0b3486174fa78a7dafc0d","observation_id":"e52f1963-28c5-47fa-9e03-1239b2fdf4ed","resolution":{"observed_at":"2026-08-03T00:06:24.347498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.399060Z","title":"Coded caching for miso systems with linear subpacketization,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.399060Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:730b1ea05be2c3edbb5f982f1c3153f3bb8997304edd90ab36718545c6a57852","observation_id":"d7ed0ed5-4805-42ba-bced-2733bce0a8de","resolution":{"observed_at":"2026-08-03T00:06:24.399060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.476871Z","title":"A novel construction of coded caching schemes with polynomial subpacketizations via projective geometry,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.476871Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:586f907d3fd8096f2e1e391e3335d92c87994beb65442249b9e1d2b982f85af2","observation_id":"7fa4d17e-65a8-451b-952b-a2c6042a1dd2","resolution":{"observed_at":"2026-08-03T00:06:24.476871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07188","last_updated":"2024-02-26T18:40:15Z","snapshot_observed_at":"2026-08-13T16:16:45.285601Z","submitted_at":"2024-02-11T12:51:38Z","title":"Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07188","snapshot_observed_at":"2026-08-03T00:06:24.532741Z","title":"Optimal placement delivery arrays fromt-designs with application to hierarchical coded caching,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.532741Z"},"links":{"cited_paper":"/paper/2402.07188","citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:bb1043107fb21fa43d732c76832c01c6a7e5fd6abbb42b0f566089e2b7dfce03","observation_id":"fdc6fa85-0b14-4b94-bd77-599d4fcc0974","resolution":{"observed_at":"2026-08-03T00:06:24.532741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.589276Z","title":"Hierarchical coded caching with low subpacketization and coding delay using combinatorial t-designs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.589276Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:beb877c754e1995f3906420f85e787afd6961db73a72d146f9746cc8abb78893","observation_id":"f4698086-748f-438f-95b2-3202a0237b78","resolution":{"observed_at":"2026-08-03T00:06:24.589276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-13T17:49:58.518579Z","submitted_at":"2025-01-21T03:13:21Z","title":"A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.11855","snapshot_observed_at":"2026-08-03T00:06:24.640870Z","title":"A new construction structure on coded caching with linear subpacketization: Non-half-sum disjoint packing,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.640870Z"},"links":{"cited_paper":"/paper/2501.11855","citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:a13d7e662d4d383d1eadf432027e90695687a6c35c4f8a4349b797b8cc205a04","observation_id":"b259cd15-c9bf-40dd-8d9c-fb27f558a090","resolution":{"observed_at":"2026-08-03T00:06:24.640870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.712759Z","title":"Fundamental limits of coded caching with multiple antennas, shared caches and uncoded prefetching,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.712759Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:106ad76b22d3c285e53d26792ce1af045000d1ae1263f639cd454215d64b51a0","observation_id":"6136c7d0-1fba-409a-b5e6-9a926a4edb1f","resolution":{"observed_at":"2026-08-03T00:06:24.712759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.769863Z","title":"D2d coded caching from two classes of optimal dpdas using cross resolvable designs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.769863Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:7307da4be7ef7ae2e6bb8d8b0a160095f1213f5570aa158b4dff8108afea6831","observation_id":"075bca59-769c-4670-ba56-9984131dae01","resolution":{"observed_at":"2026-08-03T00:06:24.769863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.826214Z","title":"Placement delivery array for cache-aided mimo systems,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.826214Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:2d5073e5d0f9c657bdcd74da765386fc6b25fce0a83d28b6dd43bf475a333033","observation_id":"df6a0e58-4e39-4d2e-88a7-0c5906041469","resolution":{"observed_at":"2026-08-03T00:06:24.826214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:24.883695Z","title":"Multi-access coded caching schemes from cross resolvable designs,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.883695Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:441f724d8f536d42128579e46d0ecdec43316c14c23b9a5880c1a9edde25d715","observation_id":"220318bc-0854-4948-aed7-66e6d9639075","resolution":{"observed_at":"2026-08-03T00:06:24.883695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.10175","last_updated":"2026-05-07T14:13:19Z","snapshot_observed_at":"2026-08-03T23:20:34.236027Z","submitted_at":"2026-01-15T08:28:21Z","title":"A Low-Complexity Framework for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.10175","snapshot_observed_at":"2026-08-03T00:06:25.039500Z","title":"A low-complexity architecture for multi-access coded caching systems with arbitrary user-cache access topology,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:25.039500Z"},"links":{"cited_paper":"/paper/2601.10175","citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:b4a156e27a2c5b2d2f40460841b81507c40dc06c0fa12ca044645ac4bbbedf54","observation_id":"6a97f66f-8381-4ef9-9494-f451451c5a0b","resolution":{"observed_at":"2026-08-03T00:06:25.039500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:25.112710Z","title":"Adapt or wait: Quality adaptation for cache-aided channels,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:25.112710Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:b7f6fe064e216ddd4f22d29f3eb26efd5bc522311241a82ea78c28ba6c93655e","observation_id":"711480dc-bfca-4f8a-a0a3-d72bb0113901","resolution":{"observed_at":"2026-08-03T00:06:25.112710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.06212","last_updated":"2017-12-18T00:29:52Z","snapshot_observed_at":"2026-08-03T10:29:24.226730Z","submitted_at":"2017-12-18T00:29:52Z","title":"On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.06212","snapshot_observed_at":"2026-08-03T00:06:25.206578Z","title":"On the placement delivery array design for coded caching scheme in d2d networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:25.206578Z"},"links":{"cited_paper":"/paper/1712.06212","citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:c26fc922b32afa253b3524f8d9a06b3127a4cec2cd9b506e7ad6b7874501a755","observation_id":"3379351a-e8d4-41fb-bc92-8daad53e7c42","resolution":{"observed_at":"2026-08-03T00:06:25.206578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:25.333898Z","title":"Low subpacketization coded caching via projective geometry for broadcast and d2d networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:25.333898Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:a4d36e470a872c7ca5441efb7c9028d3549d44067a181018c5e0a65915a1444e","observation_id":"8ec56916-e29d-4c62-9013-ddcd1aeba67d","resolution":{"observed_at":"2026-08-03T00:06:25.333898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:25.431292Z","title":"Placement delivery array design for coded caching scheme in D2D networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:25.431292Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:ab5e57d5aee7268969f4caf13776bf8718349c2be3bcd1fdf7748a02fcd0d400","observation_id":"34759e5d-6b4d-4b71-a681-a79605d2e185","resolution":{"observed_at":"2026-08-03T00:06:25.431292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:25.526322Z","title":"New constructions of D2D placement delivery arrays,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:25.526322Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:8c75b5fe3361fd4d285350d04088b41c95a8802852d4c66aba944f04e1c6ff11","observation_id":"fb2ec5ec-9637-4087-960d-347a96d772bc","resolution":{"observed_at":"2026-08-03T00:06:25.526322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:25.652423Z","title":"Towards finite file packetizations in wireless Device-to-Device caching networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:25.652423Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:e43dc8983dd6c78a5d1ed90c18a494ab5aedb24c6572641faedcef204c0dcdde","observation_id":"0bcc2ae5-fa41-4212-ac1b-7ce7616411fd","resolution":{"observed_at":"2026-08-03T00:06:25.652423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:25.734264Z","title":"Coded caching design for dynamic networks with reduced subpacketizations,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:25.734264Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:6cd866d5f37433fff8b14bacd5f421e9880f5ce09f34d408d8cab02b0a22203c","observation_id":"601b72d2-8da4-478d-a63d-53ee42035fdf","resolution":{"observed_at":"2026-08-03T00:06:25.734264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:25.825264Z","title":"Coded caching for d2d multi-access networks with linear subpacketization via vector set,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:25.825264Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:1aa51d6a4c4539b108190d6cb3d28a2245bea62d21d0b0b8226a74eaaabe1791","observation_id":"bec77670-d2f3-4fe0-b420-62d4ff11b419","resolution":{"observed_at":"2026-08-03T00:06:25.825264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:25.964365Z","title":"D2d coded caching from two classes of optimal dpdas using cross resolvable designs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:25.964365Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:eb6fd581b679c82a36a77a56d677ede7e8d7d4be3dff8a1f352b4bf37168d252","observation_id":"5afb46f6-9ea3-41fa-9397-db339371096b","resolution":{"observed_at":"2026-08-03T00:06:25.964365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:26.041316Z","title":"Optimal device-to-device placement delivery arrays using combinatorial designs,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:26.041316Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:04e34ad7c96d02c7d3958b7b45832d40c11748851eb4b2e529bba2bfdd3a566c","observation_id":"9c85ea12-3bb8-4800-b23e-847c4833a73a","resolution":{"observed_at":"2026-08-03T00:06:26.041316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:26.121693Z","title":"A new combinatorial design of coded distributed computing,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:26.121693Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:969ed77ed9f22b0c598e61908cbe7502411bd500dabdd9fecd49e46f9ece4e63","observation_id":"fda5f581-befe-429d-9cdf-da67cd1c0f76","resolution":{"observed_at":"2026-08-03T00:06:26.121693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:26.242922Z","title":"A new combinatorial coded design for heterogeneous distributed computing,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:26.242922Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:c195c1fa99a179db5975c9a84412144d1ed426c4195d2f30ec83a40662add68b","observation_id":"18dbeb7e-4a07-4704-9fd4-c5c3d0e22751","resolution":{"observed_at":"2026-08-03T00:06:26.242922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:26.333250Z","title":"Resolvable designs for speeding up distributed computing,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:26.333250Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:530a9525dfc032385f3f0713b54bc4368aa162d9a34f0d57c38abd9a2b47451b","observation_id":"d2af529f-de75-450c-aa65-44b888b1b32a","resolution":{"observed_at":"2026-08-03T00:06:26.333250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:06:26.424922Z","title":"A fundamental tradeoff between computation and communication in distributed computing,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:26.424922Z"},"links":{"citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:abeb8390be3174610770ddd0dc59255adef574602e00788ba5698e9d3e440ad0","observation_id":"24b361f6-bd82-4dcc-9bec-4571b92e3f0d","resolution":{"observed_at":"2026-08-03T00:06:26.424922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization"},"reference_resolution":{"displayed":74,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":74,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":74},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 74 of 74 outbound references and 0 inbound Pith citation observations for arXiv:2602.12220."}