Pith. sign in

Paper Citation Record · LEDGER

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2602.12220 v2

Coverage vector

measured 74 of 74 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T00:06:26.424922Z

measured 74 of 74 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

74 of 74 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved74
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 322be63f-1e70-44db-9c94-169707236b1a · outbound

This paper cites A new design framework on D2D coded caching with optimal rate and less subpacketizations,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A new design framework on D2D coded caching with optimal rate and less subpacketizations,

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:20.838080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:20.838080Z digest=sha256:c56bb37888685ee177beb7f85d4d3b317f66b0ae1fe8d1e1f0cf1625dbc96018

Observation 2a48a5f6-a84f-4d66-a8da-8996e553126d · outbound

This paper cites Finite-length analysis of D2D coded caching via exploiting asymmetry in delivery,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Finite-length analysis of D2D coded caching via exploiting asymmetry in delivery,

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:20.898459Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:20.898459Z digest=sha256:b7ad185ad662bd10c3c017b24f671275f9ab693fa8a29a2aab8a7d12af0c1371

Observation f4199134-079d-4b09-ae52-5ded412674a0 · outbound

This paper cites Fundamental limits of caching in wireless D2D networks,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Fundamental limits of caching in wireless D2D networks,

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:20.960560Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:20.960560Z digest=sha256:d6f16186b9380b3540f33a795d911affd88393a5cf811ef8b4ae1b65c76f952b

Observation 0268e19a-ad32-4958-b275-9fe1417310ef · outbound

This paper cites Fundamental limits of caching,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Fundamental limits of caching,

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.031821Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.031821Z digest=sha256:0166c688c722d0d9614ce05f16b0242676752778e538fbad4dcb59eed23c8185

Observation 2d443294-2b97-4c22-a4d2-19d4deb4af2d · outbound

This paper cites Coded caching with nonuniform demands,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Coded caching with nonuniform demands,

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.117473Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.117473Z digest=sha256:a16b8490bf0481f3ee717965570bc269ebbc530ed3c4715222b1229b665593c4

Observation 874816df-329f-4902-8d7f-934c794dab4c · outbound

This paper cites The exact rate-memory tradeoff for caching with uncoded prefetching,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization The exact rate-memory tradeoff for caching with uncoded prefetching,

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.180612Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.180612Z digest=sha256:ce1f4655f2a5e13fd23aba0131190627b189e31bd500e3632c8c9dd1709dca4e

Observation 44a78dd7-7220-4f6d-b318-4aaa448472f1 · outbound

This paper cites On the fundamental limits of caching in combination networks,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization On the fundamental limits of caching in combination networks,

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.253745Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.253745Z digest=sha256:b8bc596d84ead8120c173ef521caffa0b7eaf94e70fe573f5881158219f9abd0

Observation e53887ba-1c81-4bc9-ac05-5aa7fa41617a · outbound

This paper cites Fundamental limits of caching with secure delivery,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Fundamental limits of caching with secure delivery,

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.330909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.330909Z digest=sha256:a82d5275ccec8deaac0f70b2ccae9efb7c32d232f374fc41db1a1b593dad7b54

Observation 95579c93-930b-467d-8a35-657f1cdd2a82 · outbound

This paper cites Fundamental limits of cache-aided interference management,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Fundamental limits of cache-aided interference management,

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.442819Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.442819Z digest=sha256:9978c30126b843de7d9f2e3daff5b53ba996dcc149758cce65275c101f5ad85e

Observation 619c596c-aefe-418d-999b-5e06d6754e71 · outbound

This paper cites Cache-aided interference management using hypercube combinatorial design with reduced subpacketizations and order optimal sum-degrees of freedom,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Cache-aided interference management using hypercube combinatorial design with reduced subpacketizations and order optimal sum-degrees of freedom,

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.525078Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.525078Z digest=sha256:2643fe08b5f2e21aa6424b06d4b7a9280110181667165ba041c9a9df793efda3

Observation 59bcee09-7b45-43e8-95e8-56e66c91a64d · outbound

This paper cites Femtocaching: Wireless content delivery through distributed caching helpers,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Femtocaching: Wireless content delivery through distributed caching helpers,

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.648006Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.648006Z digest=sha256:e0134839926c31dda03ea346846a558512614449142f20833d9079ffbd3e084a

Observation 6a93b7ac-ab39-4359-8a76-114f213d6be2 · outbound

This paper cites The exact rate-memory tradeoff for caching with uncoded prefetching,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization The exact rate-memory tradeoff for caching with uncoded prefetching,

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.758610Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.758610Z digest=sha256:497e5164f9377ac70c8ae743ee961a9935de37fa91e3856760b02876a5819819

Observation 3642afbf-1931-4c4f-a739-f8dbb532fb7e · outbound

This paper cites Hierarchical coded caching,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Hierarchical coded caching,

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.830126Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.830126Z digest=sha256:e240547c70113cfae50a40eea7da4e56b29c550adfafe0fa1ab2b644cc5c3fb5

Observation ada00552-4e28-4362-a525-78762f431658 · outbound

This paper cites Content delivery via multi-server coded caching in linear networks,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Content delivery via multi-server coded caching in linear networks,

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.905563Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.905563Z digest=sha256:9e3c224a75be033a47e9b9f1e68bcf6666368077d6687ab51940ebe340a98194

Observation 54009697-8270-4543-ad7f-3c19f9b7d9f8 · outbound

This paper cites On the fundamental limits of cache-aided multiuser private information retrieval,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization On the fundamental limits of cache-aided multiuser private information retrieval,

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:21.977388Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:21.977388Z digest=sha256:80c14e4d3f3c5a89ed8e1730575a2296584c3c442db132026f07abd08cf628ef

Observation 7444a1ae-dabf-4536-88c6-76f34ed25bfb · outbound

This paper cites A fundamental tradeoff between computation and communication in distributed computing,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A fundamental tradeoff between computation and communication in distributed computing,

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.057244Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.057244Z digest=sha256:b795dd4e300c7fa45c8d28d8c6aa903c76663438de230081f84ec71123b6ac5e

Observation e689dd0d-7ff1-4a4b-a2e6-d94d6460d074 · outbound

This paper cites Optimal throughput-outage analysis of cache-aided wireless multi-hop d2d networks,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Optimal throughput-outage analysis of cache-aided wireless multi-hop d2d networks,

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.129376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.129376Z digest=sha256:42799aa995fdc82a48b2bab014801d6b6468d44102fc2ff0ac53f404f1e5ccfa

Observation 56bc88a3-727b-45a3-b876-820095a24d33 · outbound

This paper cites On the optimality of D2D coded caching with uncoded cache placement and one-shot delivery,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization On the optimality of D2D coded caching with uncoded cache placement and one-shot delivery,

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.161931Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.161931Z digest=sha256:aec725671ab247f2a9a5497cb4c5307612fa46bfa30debb5636ba03e01ea7a2f

Observation bd9550b3-5229-42ce-9c7c-5a03e7310c09 · outbound

This paper cites Device-to-Device secure coded caching,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Device-to-Device secure coded caching,

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.164770Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.164770Z digest=sha256:dc04fd2999c7ea7850ce461e023b024c1a38599a80e3d2cf952bb3e869bc17e8

Observation 5c9cd789-4dbc-4759-948f-13dc639cdc1d · outbound

This paper cites Device-to-device coded-caching with distinct cache sizes,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Device-to-device coded-caching with distinct cache sizes,

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.184773Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.184773Z digest=sha256:70ab4012f65117218fa8eacc65bd16497cc18b1f1760401f51b48c550c434535

Observation 66ab3a10-28dd-4e04-ba9b-130da08b4989 · outbound

This paper cites Device-to-Device coded caching with distinct cache sizes,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Device-to-Device coded caching with distinct cache sizes,

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.276674Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.276674Z digest=sha256:92f005917e9f28af40704f3e0c9011c19ebd417d8e3873bab9dd2b1e1685fc90

Observation ade93161-914c-4bf3-8e01-742d4ff858c3 · outbound

This paper cites On the fundamental limits of Device-to-Device private caching under uncoded cache placement and user collusion,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization On the fundamental limits of Device-to-Device private caching under uncoded cache placement and user collusion,

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.435188Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.435188Z digest=sha256:ece59d07e29360d8c27cd5b7e7dc8b2aa33f64eaf361c486836f400f035d2f40

Observation 8bcbb094-942e-4288-85d3-d347723ac3c4 · outbound

This paper cites Optimal caching policy for D2D assisted cellular networks with different cache size devices,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Optimal caching policy for D2D assisted cellular networks with different cache size devices,

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.533353Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.533353Z digest=sha256:6d8938876926d7f70af6dc086589cfdeef25c0bd98d3a62c721739e4d6d4b74e

Observation c7de26cf-1292-4b75-beca-e9104c7e8a25 · outbound

This paper cites Fundamental limits of coded caching in request-robust d2d communication networks,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Fundamental limits of coded caching in request-robust d2d communication networks,

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.648565Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.648565Z digest=sha256:0276c98eab9b1486b3d33eb20bbff109dac0868f3fcdadc29298d0da95800695

Observation a6adc649-a589-40ea-ac8a-4cec4f5f48b7 · outbound

This paper cites Adding transmitters dramatically boosts coded caching gains for finite file sizes,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Adding transmitters dramatically boosts coded caching gains for finite file sizes,

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.746246Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.746246Z digest=sha256:cea9157ad480cc940faa9710e2cba87e9fcf6c255ed75c5b343ec3cd18e2a26e

Observation 7896233b-a059-493a-b46e-69341f38751d · outbound

This paper cites Finite-length analysis of caching-aided coded multicasting,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Finite-length analysis of caching-aided coded multicasting,

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.828997Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.828997Z digest=sha256:5bb030683d6238de34828e7a4ccaadd3a2eca85656e09bd36d038613ee551a3f

Observation 55e97828-3534-4e19-a65e-0883d0f31cba · outbound

This paper cites On the placement delivery array design for centralized coded caching scheme,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization On the placement delivery array design for centralized coded caching scheme,

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.882596Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.882596Z digest=sha256:e25518c4c38d3cc8d87f6fe4549292c68d899c8a889a1fb770cb8fdd1077ea7d

Observation 1e2a1c63-546e-4b41-b0e9-e6a6598dd085 · outbound

This paper cites A framework of constructing placement delivery arrays for centralized coded caching,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A framework of constructing placement delivery arrays for centralized coded caching,

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.944653Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.944653Z digest=sha256:8e712054e793143a1f4f13be08e847709cf3f91e944d9386ebf63eebff36a3a0

Observation 53c43e2e-898c-48ad-bea9-21a8d0257961 · outbound

This paper cites Improving placement delivery array coded caching schemes with coded placement,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Improving placement delivery array coded caching schemes with coded placement,

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:22.992342Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:22.992342Z digest=sha256:1525b340d031a17103d3d2ffa04c870b536d440f201c0c07273eda12201a92b8

Observation 90ebd2b3-065d-4214-908c-459d1b56222c · outbound

This paper cites Placement delivery array based on concatenating construction,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Placement delivery array based on concatenating construction,

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.045983Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.045983Z digest=sha256:ac299d02e8c8918425022a75dcb3f1946709cfad4b350fc5e0b1bffbc6cc94f8

Observation 14e3246b-5fdb-44ad-9611-f4a9f4c80ccf · outbound

This paper cites Placement delivery array design through strong edge coloring of bipartite graphs,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Placement delivery array design through strong edge coloring of bipartite graphs,

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.131338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.131338Z digest=sha256:0a3fb9f88cb558044bdb0459929dc51f7d8c81fd9d613f5fe476589be8a17f86

Observation 8c3d3030-247b-47e3-b68c-20c47c74c4e2 · outbound

This paper cites Constructions of coded caching schemes with flexible memory size,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Constructions of coded caching schemes with flexible memory size,

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.187351Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.187351Z digest=sha256:aa42ca1e0996cf0bf030afdd2834ffb7fa7979b5e50cccd9f452c50110e46103

Observation dfb25f78-cae2-451a-935c-12a7337efd45 · outbound

This paper cites Centralized coded caching schemes: A hypergraph theoretical approach,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Centralized coded caching schemes: A hypergraph theoretical approach,

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.240015Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.240015Z digest=sha256:69eb0a80834bffef0649e807f6c03065708f8bcef0a59debd474fbc3094539ff

Observation 997a13f9-616f-494c-8ccc-61f13abb0587 · outbound

This paper cites Coded caching schemes with reduced subpacketization from linear block codes,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Coded caching schemes with reduced subpacketization from linear block codes,

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.295860Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.295860Z digest=sha256:6801ade0d0efdcbfe05e7201fdf90161f14929f9421639216dd0fc1610d245c2

Observation 25bbe275-debe-450d-bdc1-6261719b2e58 · outbound

This paper cites A unified Ruzsa-Szem´ eredi framework for finite-length coded caching,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A unified Ruzsa-Szem´ eredi framework for finite-length coded caching,

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.353588Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.353588Z digest=sha256:9df3677386eaa16c0529f3f52085b45f5d1f7ae612fdb2b877480fc6cb645d3e

Observation ceb01341-83a2-4a91-acea-29d333fea048 · outbound

This paper cites Coded caching with linear subpacketization is possible using Ruzsa-Szem´ eredi graphs,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Coded caching with linear subpacketization is possible using Ruzsa-Szem´ eredi graphs,

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.405095Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.405095Z digest=sha256:56ce46e0f809a5a386d9cd53c73b8eea0e96e1d916d2c7156dbf6e87bbbe9b75

Observation c5ccfc4d-089e-4708-8f12-30722ea60bca · outbound

This paper cites Coded caching via line graphs of bipartite graphs,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Coded caching via line graphs of bipartite graphs,

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.461198Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.461198Z digest=sha256:f0deafabf346f56cca528b6b98ad3df3676e0c4ff74b237658a7968960145637

Observation 9b68ee7d-3144-42a5-b37a-3c0cc29b816b · outbound

This paper cites Subexponential and linear subpacketization coded caching via projective geometry,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Subexponential and linear subpacketization coded caching via projective geometry,

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.512643Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.512643Z digest=sha256:db10d47f3fed9fde96cd7365011f251d9cd1c0e6e73e7ab08f9278fb1e385e5b

Observation 7572ba62-507a-41f4-93fb-04f54ebaabfa · outbound

This paper cites A multi-antenna coded caching scheme with linear subpacketization,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A multi-antenna coded caching scheme with linear subpacketization,

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.568017Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.568017Z digest=sha256:a0cfdeda9f3a4a162865bbb1a4d31160eb36800f29f087c19fc13f5389af5f3d

Observation e9ba2532-6dc2-476b-a105-cf5ddddcd5a1 · outbound

This paper cites Multi-antenna coded caching analysis in finite SNR and finite subpacketization,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Multi-antenna coded caching analysis in finite SNR and finite subpacketization,

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.642702Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.642702Z digest=sha256:5100bd26ec7daf5ffcda9ba9a6235a34e4aae366a96a52549f0b4616a8c8b05c

Observation 2240c375-7eb0-4502-a33a-80b35a83ae54 · outbound

This paper cites Diagonal multi-antenna coded caching for reduced subpacketization,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Diagonal multi-antenna coded caching for reduced subpacketization,

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.694817Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.694817Z digest=sha256:948ce51279a64cbbb152292346220eb2322ce0feb6fa560fcc816754bc141cfe

Observation 22210600-288b-4397-9a6e-3f7a44ee9c79 · outbound

This paper cites Bridging two extremes: Multi-antenna coded caching with reduced subpacketization and CSIT,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Bridging two extremes: Multi-antenna coded caching with reduced subpacketization and CSIT,

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.777869Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.777869Z digest=sha256:e1303649c7d31fb21157030641ab8e693e1d7b212f28439e3249cfad0985d6c5

Observation b86c48b0-82ff-4a0c-bc30-dc52b446c0d1 · outbound

This paper cites Cache-aided interference management using hypercube combinatorial cache designs,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Cache-aided interference management using hypercube combinatorial cache designs,

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.864885Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.864885Z digest=sha256:e944deaf734550dce4ba4f9464e8abee36997e67c5f2ee3e0b4de92b93338aa4

Observation 112e75aa-8305-428e-9ee0-b0ea110ea54f · outbound

This paper cites Multi-antenna interference management for coded caching,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Multi-antenna interference management for coded caching,

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.922498Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.922498Z digest=sha256:cd50afcc9b52ac72ef09a32af36d2a4f62316b143d4d8e19293935eb222ef513

Observation 1769b7f3-0ada-42ef-bab2-35a2e9a41de2 · outbound

This paper cites Stochastic coded caching with optimized shared-cache sizes and reduced subpacketization,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Stochastic coded caching with optimized shared-cache sizes and reduced subpacketization,

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:23.998646Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:23.998646Z digest=sha256:7668ec2e5cc3e55ebcd617fa7f95ebb2230e1a843a28a4225bdda7e382534e54

Observation dcdc96bd-9521-4de8-ab77-33a1d3a5f76c · outbound

This paper cites A low-subpacketization high-performance mimo coded caching scheme,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A low-subpacketization high-performance mimo coded caching scheme,

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.084647Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.084647Z digest=sha256:fdc9662c8746654e49b418d4c9d5cd6701c362d68502df6f15fc08325ba98bbd

Observation 388918be-320d-42c1-b9c7-db96c1c8e0be · outbound

This paper cites Low-Complexity High-Performance Cyclic Caching for Large MISO Systems.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Low-Complexity High-Performance Cyclic Caching for Large MISO Systems

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.139786Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.139786Z digest=sha256:298f549a53f9124e2d0d76ca5dbb1dc31fd19fbf0e10c7482a970f42d7fabd21

Observation bc0db285-2815-44da-a995-26b58f01e56b · outbound

This paper cites Multi-access coded caching scheme with linear sub-packetization using pdas,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Multi-access coded caching scheme with linear sub-packetization using pdas,

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.193140Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.193140Z digest=sha256:2a5706af183351ca6b461714cd6b245592927dbe012f637a562e81717dcef4fb

Observation 4f4cfc8d-6f7d-49e0-961b-b4165c8dd44b · outbound

This paper cites Fundamental limits of combinatorial multi-access caching,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Fundamental limits of combinatorial multi-access caching,

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.293930Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.293930Z digest=sha256:e531a838d4a5830e91f484f3a604870f205a3e1e3954245a5afc751142fac8ae

Observation e52f1963-28c5-47fa-9e03-1239b2fdf4ed · outbound

This paper cites Asymptotically optimal coded distributed computing via combinatorial designs,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Asymptotically optimal coded distributed computing via combinatorial designs,

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.347498Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.347498Z digest=sha256:7237e9aa83f2017affa11c3c4f5b05056bb9565e95c0b3486174fa78a7dafc0d

Observation d7ed0ed5-4805-42ba-bced-2733bce0a8de · outbound

This paper cites Coded caching for miso systems with linear subpacketization,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Coded caching for miso systems with linear subpacketization,

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.399060Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.399060Z digest=sha256:730b1ea05be2c3edbb5f982f1c3153f3bb8997304edd90ab36718545c6a57852

Observation 7fa4d17e-65a8-451b-952b-a2c6042a1dd2 · outbound

This paper cites A novel construction of coded caching schemes with polynomial subpacketizations via projective geometry,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A novel construction of coded caching schemes with polynomial subpacketizations via projective geometry,

Reference 53

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.476871Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.476871Z digest=sha256:586f907d3fd8096f2e1e391e3335d92c87994beb65442249b9e1d2b982f85af2

Observation fdc6fa85-0b14-4b94-bd77-599d4fcc0974 · outbound

This paper cites Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching

Reference 54

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.532741Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.532741Z digest=sha256:2bdf22e9374bbdcd512af269312a8b4ceb790ebb52734ede57a030c021129321

Observation f4698086-748f-438f-95b2-3202a0237b78 · outbound

This paper cites Hierarchical coded caching with low subpacketization and coding delay using combinatorial t-designs,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Hierarchical coded caching with low subpacketization and coding delay using combinatorial t-designs,

Reference 55

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.589276Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.589276Z digest=sha256:beb877c754e1995f3906420f85e787afd6961db73a72d146f9746cc8abb78893

Observation b259cd15-c9bf-40dd-8d9c-fb27f558a090 · outbound

This paper cites A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing

Reference 56

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.640870Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.640870Z digest=sha256:d464d191c4178fc976fa1db83956fa164bedc557a1ad1aea3a1b4df4e5e73fd5

Observation 6136c7d0-1fba-409a-b5e6-9a926a4edb1f · outbound

This paper cites Fundamental limits of coded caching with multiple antennas, shared caches and uncoded prefetching,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Fundamental limits of coded caching with multiple antennas, shared caches and uncoded prefetching,

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.712759Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.712759Z digest=sha256:106ad76b22d3c285e53d26792ce1af045000d1ae1263f639cd454215d64b51a0

Observation 075bca59-769c-4670-ba56-9984131dae01 · outbound

This paper cites D2d coded caching from two classes of optimal dpdas using cross resolvable designs,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization D2d coded caching from two classes of optimal dpdas using cross resolvable designs,

Reference 58

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.769863Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.769863Z digest=sha256:7307da4be7ef7ae2e6bb8d8b0a160095f1213f5570aa158b4dff8108afea6831

Observation df6a0e58-4e39-4d2e-88a7-0c5906041469 · outbound

This paper cites Placement delivery array for cache-aided mimo systems,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Placement delivery array for cache-aided mimo systems,

Reference 59

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.826214Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.826214Z digest=sha256:2d5073e5d0f9c657bdcd74da765386fc6b25fce0a83d28b6dd43bf475a333033

Observation 220318bc-0854-4948-aed7-66e6d9639075 · outbound

This paper cites Multi-access coded caching schemes from cross resolvable designs,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Multi-access coded caching schemes from cross resolvable designs,

Reference 60

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:24.883695Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:24.883695Z digest=sha256:441f724d8f536d42128579e46d0ecdec43316c14c23b9a5880c1a9edde25d715

Observation 6a97f66f-8381-4ef9-9494-f451451c5a0b · outbound

This paper cites A Low-Complexity Framework for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A Low-Complexity Framework for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology

Reference 61

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:25.039500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:25.039500Z digest=sha256:b4a156e27a2c5b2d2f40460841b81507c40dc06c0fa12ca044645ac4bbbedf54

Observation 711480dc-bfca-4f8a-a0a3-d72bb0113901 · outbound

This paper cites Adapt or wait: Quality adaptation for cache-aided channels,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Adapt or wait: Quality adaptation for cache-aided channels,

Reference 62

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:25.112710Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:25.112710Z digest=sha256:b7f6fe064e216ddd4f22d29f3eb26efd5bc522311241a82ea78c28ba6c93655e

Observation 3379351a-e8d4-41fb-bc92-8daad53e7c42 · outbound

This paper cites On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks

Reference 63

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:25.206578Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:25.206578Z digest=sha256:c26fc922b32afa253b3524f8d9a06b3127a4cec2cd9b506e7ad6b7874501a755

Observation 8ec56916-e29d-4c62-9013-ddcd1aeba67d · outbound

This paper cites Low subpacketization coded caching via projective geometry for broadcast and d2d networks,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Low subpacketization coded caching via projective geometry for broadcast and d2d networks,

Reference 64

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:25.333898Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:25.333898Z digest=sha256:a4d36e470a872c7ca5441efb7c9028d3549d44067a181018c5e0a65915a1444e

Observation 34759e5d-6b4d-4b71-a681-a79605d2e185 · outbound

This paper cites Placement delivery array design for coded caching scheme in D2D networks,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Placement delivery array design for coded caching scheme in D2D networks,

Reference 65

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:25.431292Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:25.431292Z digest=sha256:ab5e57d5aee7268969f4caf13776bf8718349c2be3bcd1fdf7748a02fcd0d400

Observation fb2ec5ec-9637-4087-960d-347a96d772bc · outbound

This paper cites New constructions of D2D placement delivery arrays,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization New constructions of D2D placement delivery arrays,

Reference 66

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:25.526322Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:25.526322Z digest=sha256:8c75b5fe3361fd4d285350d04088b41c95a8802852d4c66aba944f04e1c6ff11

Observation 0bcc2ae5-fa41-4212-ac1b-7ce7616411fd · outbound

This paper cites Towards finite file packetizations in wireless Device-to-Device caching networks,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Towards finite file packetizations in wireless Device-to-Device caching networks,

Reference 67

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:25.652423Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:25.652423Z digest=sha256:e43dc8983dd6c78a5d1ed90c18a494ab5aedb24c6572641faedcef204c0dcdde

Observation 601b72d2-8da4-478d-a63d-53ee42035fdf · outbound

This paper cites Coded caching design for dynamic networks with reduced subpacketizations,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Coded caching design for dynamic networks with reduced subpacketizations,

Reference 68

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:25.734264Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:25.734264Z digest=sha256:6cd866d5f37433fff8b14bacd5f421e9880f5ce09f34d408d8cab02b0a22203c

Observation bec77670-d2f3-4fe0-b420-62d4ff11b419 · outbound

This paper cites Coded caching for d2d multi-access networks with linear subpacketization via vector set,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Coded caching for d2d multi-access networks with linear subpacketization via vector set,

Reference 69

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:25.825264Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:25.825264Z digest=sha256:1aa51d6a4c4539b108190d6cb3d28a2245bea62d21d0b0b8226a74eaaabe1791

Observation 5afb46f6-9ea3-41fa-9397-db339371096b · outbound

This paper cites D2d coded caching from two classes of optimal dpdas using cross resolvable designs,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization D2d coded caching from two classes of optimal dpdas using cross resolvable designs,

Reference 70

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:25.964365Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:25.964365Z digest=sha256:eb6fd581b679c82a36a77a56d677ede7e8d7d4be3dff8a1f352b4bf37168d252

Observation 9c85ea12-3bb8-4800-b23e-847c4833a73a · outbound

This paper cites Optimal device-to-device placement delivery arrays using combinatorial designs,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Optimal device-to-device placement delivery arrays using combinatorial designs,

Reference 71

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:26.041316Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:26.041316Z digest=sha256:04e34ad7c96d02c7d3958b7b45832d40c11748851eb4b2e529bba2bfdd3a566c

Observation fda5f581-befe-429d-9cdf-da67cd1c0f76 · outbound

This paper cites A new combinatorial design of coded distributed computing,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A new combinatorial design of coded distributed computing,

Reference 72

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:26.121693Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:26.121693Z digest=sha256:969ed77ed9f22b0c598e61908cbe7502411bd500dabdd9fecd49e46f9ece4e63

Observation 18dbeb7e-4a07-4704-9fd4-c5c3d0e22751 · outbound

This paper cites A new combinatorial coded design for heterogeneous distributed computing,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A new combinatorial coded design for heterogeneous distributed computing,

Reference 73

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:26.242922Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:26.242922Z digest=sha256:c195c1fa99a179db5975c9a84412144d1ed426c4195d2f30ec83a40662add68b

Observation d2af529f-de75-450c-aa65-44b888b1b32a · outbound

This paper cites Resolvable designs for speeding up distributed computing,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization Resolvable designs for speeding up distributed computing,

Reference 74

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:26.333250Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:26.333250Z digest=sha256:530a9525dfc032385f3f0713b54bc4368aa162d9a34f0d57c38abd9a2b47451b

Observation 24b361f6-bd82-4dcc-9bec-4571b92e3f0d · outbound

This paper cites A fundamental tradeoff between computation and communication in distributed computing,.

Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization A fundamental tradeoff between computation and communication in distributed computing,

Reference 75

Resolution
unresolved
no resolver link, observed 2026-08-03T00:06:26.424922Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:06:26.424922Z digest=sha256:abeb8390be3174610770ddd0dc59255adef574602e00788ba5698e9d3e440ad0

Pith citing papers

No inbound Pith citation observations are available.