{"as_of":"2026-08-13T10:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:632b5f9f510cb4e73e68f2b5ca17851c5e024262bed587b21e4e78ec1679ca82","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:57:07.792926Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:22:29.156524Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T21:22:29.262915Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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":"2501.11855","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.11855","snapshot_observed_at":"2026-08-06T21:22:29.262915Z","title":"A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing","venue":"cs.IT","work_id":"fc3d95cc-5140-416f-89b8-2c4163163008","year":2025},"citing_paper":{"arxiv_id":"2507.00727","last_updated":"2025-07-01T13:17:46Z","snapshot_observed_at":"2026-08-06T21:06:11.863734Z","submitted_at":"2025-07-01T13:17:46Z","title":"On Hierarchical Coded Caching with Offline Users","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:22:29.156524Z"},"links":{"cited_paper":"/paper/2501.11855","citing_paper":"/paper/2507.00727"},"observation_digest":"sha256:42baa0e62f2f5a5ad4c634389bb7a039aa1c8137ad108fd02e86b32fa59683a0","observation_id":"6314edaf-55b1-4a85-abd9-572be1266751","resolution":{"observed_at":"2026-08-06T21:22:29.267420Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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:d464d191c4178fc976fa1db83956fa164bedc557a1ad1aea3a1b4df4e5e73fd5","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"}}],"links":{"evidence":"/evidence","html":"/paper/2501.11855/citation-record","integrity":"/paper/2501.11855/integrity","json":"/paper/2501.11855/citation-record.json","paper":"/paper/2501.11855"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.594160Z","title":"Improving bicm performance of qam constellations for broadcasting applications,","venue":null,"work_id":"e1e5ba9f-31da-4bd2-baab-bc92dac4bf5b","year":2008},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.572464Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:a3a4bb1c6a93da8f823a6d0f4048247d2a0e3fc2baf24d60c398a66806f70566","observation_id":"8a584bef-f149-4cd4-a75d-c347a533579d","resolution":{"observed_at":"2026-08-10T17:57:08.599434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.578184Z","title":"Fundamental limits of caching,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.578184Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:6c8c8311b128125da9acad4bdebdc894b4e10962b164e31a66f3ba7f14c557cf","observation_id":"f6ff3126-b66e-4941-9a43-71daba8c7e23","resolution":{"observed_at":"2026-08-10T17:57:07.578184Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.566858Z","title":"On the optimality of uncoded cache placement,","venue":null,"work_id":"a7da65c8-115a-4631-8c63-2f87bd850c94","year":2016},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.583317Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:84ab324edd028addb55a265b0e4d3db16cb11cc23663d53e08187a2ab75cf33a","observation_id":"93d5e435-3a39-4f3a-a0c4-2049ef4c4c76","resolution":{"observed_at":"2026-08-10T17:57:08.572016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.550668Z","title":"Uncoded placement optimization for coded delivery,","venue":null,"work_id":"9b1e5128-e20a-4b02-82c9-b0889fd86416","year":2018},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.588390Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:76c98e652516fdca37e6e29146cdb62cdf4b20bbfa6ac8c7fc0ef03d04832e3f","observation_id":"cb240efb-032e-45a9-8b7c-f6dfe73fbbe3","resolution":{"observed_at":"2026-08-10T17:57:08.555941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.534912Z","title":"The exact rate-memory tradeoff for caching with uncoded prefetching,","venue":null,"work_id":"c023b7bb-361b-4d31-b2bd-7916a9d47776","year":2018},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.593566Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:12741190626188b3715e2056febc0f6e4f0986bb4907dfd203bd1962767c0dc6","observation_id":"28f75639-e7a7-419a-99fb-41e168827313","resolution":{"observed_at":"2026-08-10T17:57:08.540050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.519128Z","title":"An index coding approach to caching with uncoded cache placement,","venue":null,"work_id":"4d22e89e-0e0c-4402-a159-bc5ec3a1470e","year":2020},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.598591Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:6de3a1e3602617a7f4ee8ac1c80666ab9c1d18f1c81a436a13ef34d4675ab6fd","observation_id":"5b67681e-9804-42ce-afb1-5f042a392d5a","resolution":{"observed_at":"2026-08-10T17:57:08.524347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.503158Z","title":"Finite-length analysis of caching-aided coded multicasting,","venue":null,"work_id":"ec4ea64a-8587-4586-ad25-02be3f6373b2","year":2016},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.603790Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:c3777b856a06bcd1194e2bba7ebf60d3740e958703e490d91bb6ff97f75fcb8e","observation_id":"39ac6b54-9af9-4f3c-9a60-baa5f8bbfd1c","resolution":{"observed_at":"2026-08-10T17:57:08.508063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.486057Z","title":"A generalized grouping scheme in coded caching,","venue":null,"work_id":"df6627dd-1079-4f24-ac2a-b5765566c6e0","year":2019},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.608334Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:097ff5446a0f9a247a702362b4522d84104cbe9c6b7baf00a582720c417ec202","observation_id":"6580c0fd-fb75-4c76-86bf-358424a8e662","resolution":{"observed_at":"2026-08-10T17:57:08.492053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.468716Z","title":"On the placement delivery array design for centralized coded caching scheme,","venue":null,"work_id":"4ecc8bcb-930e-449d-9cc2-6dbaed1f6df9","year":2017},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.612908Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:2d7c74f96131afcfd0f446d01b5e9d1ee3f5bbff8f8555f70c95d256ffcdfe77","observation_id":"714218ad-819b-487f-9084-8ca1b5ef771c","resolution":{"observed_at":"2026-08-10T17:57:08.473901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.452816Z","title":"Constructions of coded caching schemes with flexible memory size,","venue":null,"work_id":"ca690ebf-7c29-419f-9b01-ecacd2027a83","year":2019},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.617592Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:dedb045dc852f6cae283cae61d2663c5140d5ee76b6c54cd3699e90ab524a810","observation_id":"fd0e4717-d7a4-4be5-a9d1-d327c192aed0","resolution":{"observed_at":"2026-08-10T17:57:08.458046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.436843Z","title":"Some variant of known coded caching schemes with good performance,","venue":null,"work_id":"151ec07d-853a-44ec-937f-6121a250d646","year":2020},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.621867Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:346c12d89ee265786437fa18597987507d891753826a5406855d2655b77a133b","observation_id":"8065d5e0-372c-4e9e-82c2-9dc990b7a0f5","resolution":{"observed_at":"2026-08-10T17:57:08.441960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.419046Z","title":"A framework of constructing placement delivery arrays for centralized coded caching,","venue":null,"work_id":"e358123b-daa1-44f0-bff1-30207bbc2168","year":2021},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.626323Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:647047b955a05ea57ad4e01dfc169a87defedac338c48f3b8be272ff23716771","observation_id":"4d2ac656-e18f-4147-9efe-a864b655ddb4","resolution":{"observed_at":"2026-08-10T17:57:08.425378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.402387Z","title":"Placement delivery array construction via cartesian product for coded caching,","venue":null,"work_id":"d10b3f48-a9fa-48c9-98c0-14829962c7cb","year":2023},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.630728Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:667af1992b66043b42d2fb8c618c96ab6f854052006b8738e6a601f3c8a8c737","observation_id":"52df7541-2393-421d-ac81-35965acc8d12","resolution":{"observed_at":"2026-08-10T17:57:08.407633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.385247Z","title":"Multi-access coded caching with optimal rate and linear subpacketization under pda and consecutive cyclic placement,","venue":null,"work_id":"8e3d84d2-369f-4e88-ba80-b033d94727a9","year":2023},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.634952Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:912a391de2aba6b174f482a1ae72a319b3e0e2ccd21365023c07a840850dfea3","observation_id":"0f24376f-3124-4f5c-a73b-2ec9f3539373","resolution":{"observed_at":"2026-08-10T17:57:08.391040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.368710Z","title":"Design of coded caching schemes with linear subpacketizations based on injective arc coloring of regular digraphs,","venue":null,"work_id":"3431b0dd-494e-4b0c-bca0-1c09799535d5","year":2023},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.639275Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:e15e42f7db4284eb83e38953648e982bd751beb634b93b0b04e7529bea05a4e9","observation_id":"3dac51e6-4549-46fb-a0fb-af7b4962e513","resolution":{"observed_at":"2026-08-10T17:57:08.374132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.352288Z","title":"Coded caching schemes with linear subpacketizations,","venue":null,"work_id":"c431bd3a-9650-4179-85e3-f14a36ceecdd","year":2021},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.643438Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:9b476a1819df7adc29324ef2802f2441b9ccace50a680d4e1d4e4179f97294db","observation_id":"4fdf1252-8680-4818-8cbc-bd3ca0315901","resolution":{"observed_at":"2026-08-10T17:57:08.357739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.336387Z","title":"Placement delivery arrays based on combinatorial designs,","venue":null,"work_id":"2b3bd577-da23-473c-8c63-71259310384d","year":2022},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.647621Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:2d5605ad10e4cd6b03608b73ba8076f55e993aa25fba56f181682551dfae953f","observation_id":"f3015d55-41e5-4f7a-acb8-222a8774b956","resolution":{"observed_at":"2026-08-10T17:57:08.341507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.319926Z","title":"Shared cache coded caching schemes with known user-to- cache association profile using placement delivery arrays,","venue":null,"work_id":"c229b861-acf4-40ec-acf9-b5ef353e868b","year":2022},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.651854Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:885edb5dad5f054ecbb58ad304373ed60ac2fc041354e42fbed8fcdd937bd2e0","observation_id":"570d21a4-4c2b-43de-80d6-98aa076b9da0","resolution":{"observed_at":"2026-08-10T17:57:08.325069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.303464Z","title":"Design of placement delivery arrays for coded caching with small subpacketizations and flexible memory sizes,","venue":null,"work_id":"52cb0aa8-1122-4ba4-ba2a-61795ec6a0c1","year":2022},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.655948Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:09536d44392de14f88a6dd01daa971538b7e7948b1acf58fb8ed85c5def461dd","observation_id":"50f606ce-9ebb-48ff-9357-a59bd1db8cb9","resolution":{"observed_at":"2026-08-10T17:57:08.309294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.286606Z","title":"Lifting constructions of pdas for coded caching with linear subpacketization,","venue":null,"work_id":"2182ef5f-0099-4627-a6c0-5fd428d214ea","year":2022},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.661046Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:f9cb7a297c313295f9f09b2adcaa3b57fd41c9a3708525df47e2cd4fd63a2a49","observation_id":"cf4e9576-db93-49ec-8994-6fb4a463bac0","resolution":{"observed_at":"2026-08-10T17:57:08.292348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.269915Z","title":"Coded caching schemes with reduced subpacketization from linear block codes,","venue":null,"work_id":"14e56def-a033-491e-b091-db9cda8b6e2f","year":2018},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.665979Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:1275a3b6db3093c8eaa3cfa4bc5da3be24c8739ceac0e5df3b8ad96a753662bf","observation_id":"625b9a75-9c02-4e5b-92ff-5d96c8f57493","resolution":{"observed_at":"2026-08-10T17:57:08.275496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.254936Z","title":"Centralized coded caching schemes: A hypergraph theoretical approach,","venue":null,"work_id":"4601979c-44be-46ed-a4f7-ec2c02b043db","year":2018},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.670694Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:6b4ac1415844d84c17c3089e1261a84127f272fa6998733cb5fd70c6f860572d","observation_id":"069df60b-1008-45f0-9057-e3db167e7913","resolution":{"observed_at":"2026-08-10T17:57:08.259835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.239032Z","title":"Coded caching with linear subpacketization is possible using ruzsa- szem´eredi graphs,","venue":null,"work_id":"dbcd19c8-6711-4617-b7dd-5e312d9cfaea","year":2017},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.675282Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:7db0b62a6abe7ca84a5724538b5063782b072e99f7f5cd5df8b2411b9c1165f3","observation_id":"c7e463ff-4387-493b-921f-f37b2f85a3a9","resolution":{"observed_at":"2026-08-10T17:57:08.244072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.222977Z","title":"Placement delivery array design through strong edge coloring of bipartite graphs,","venue":null,"work_id":"8c991430-cf44-4154-b409-4f271fe5a399","year":2018},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.679764Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:fa3b310a5e549b0e3e38f62f6d8e13d787b88d9f73bc408f5a0ed2cb03f3975c","observation_id":"7bab90da-1b65-4c5d-8970-46f23d5736ab","resolution":{"observed_at":"2026-08-10T17:57:08.228318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.207420Z","title":"Multi-access coded caching schemes from cross resolvable designs,","venue":null,"work_id":"e1969880-0f48-43de-a02e-9d4b01c08012","year":2021},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.684338Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:9062063ebe7b9215f53888fab47bf57b9cd4ef6fb60581831f024267d486aa39","observation_id":"664ba5cf-7233-4aae-a1dc-62253aa0304e","resolution":{"observed_at":"2026-08-10T17:57:08.212423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.191797Z","title":"Subexponential and linear subpacketization coded caching via projective geometry,","venue":null,"work_id":"7de2e3c0-6b05-4de6-bc14-5464084c1428","year":2021},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.688978Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:6397588bf937502133613c68def1bc9e259a232b27da41df334df784b650db92","observation_id":"13802be4-5546-4c3d-b70c-c73a7a143c4d","resolution":{"observed_at":"2026-08-10T17:57:08.196760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.176106Z","title":"Coded caching based on combinatorial designs,","venue":null,"work_id":"aa5e38a3-65dd-4945-a201-d22defd36a0d","year":2019},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.693527Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:bceb820baa936de2aa7ca7f1165f11ce81d296d2199fc6313b09d9c4ee1ded5e","observation_id":"56790601-537a-480c-85ae-a5956916991b","resolution":{"observed_at":"2026-08-10T17:57:08.181202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.160789Z","title":"A rainbow framework for coded caching and its applications,","venue":null,"work_id":"f5f05516-97e4-4707-a7cf-8afcbb46c2b6","year":2024},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.698424Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:de0e0dfe5d433e7c99bfd3e8f2d232966ef0a0764c85a0df8b5a463515656458","observation_id":"688fa2d9-5817-45bb-a9c0-b500a61bed83","resolution":{"observed_at":"2026-08-10T17:57:08.165757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.145769Z","title":"A coded caching scheme with linear sub-packetization and its application to multi- access coded caching,","venue":null,"work_id":"f047e6f5-e5c9-4f60-8749-4b80546cc431","year":2021},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.703094Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:ea692513a34ec3f399e162bf50f4690932f5efe3c08a11a266e0646590d4ae24","observation_id":"c77f7408-0085-469a-9c46-fd675406cfd1","resolution":{"observed_at":"2026-08-10T17:57:08.150829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.129944Z","title":"Multi-access coded caching scheme with linear sub-packetization using pdas,","venue":null,"work_id":"5f8353fe-4f0a-4d9e-8c8f-689c9a886231","year":2021},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.707745Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:4823e9557ce1f720e5f1ce25579418825f78b3ac72ef96ed1831c63c50191c1c","observation_id":"999b64d4-5a19-49d9-be57-a8e2cee4cb01","resolution":{"observed_at":"2026-08-10T17:57:08.134984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.114472Z","title":"Some combinatorial constructions for optical orthogonal codes,","venue":null,"work_id":"09bca4ef-dac7-44ed-9d29-09d5d3293150","year":null},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.712379Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:99516316f79f3e21a99c55045d2020b07867965cda02c0fecfbed971310427b6","observation_id":"f64a3d79-fc6c-4e60-ba89-f359d68be5fa","resolution":{"observed_at":"2026-08-10T17:57:08.119393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.099415Z","title":"A density version of a geometric ramsey theorem,","venue":null,"work_id":"ea58c65a-d849-4dec-aa3d-90e956cc2209","year":1982},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.722214Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:594ef151720e8464ff92b8b88e2ab77d8b6737e734c586da1198021523f92370","observation_id":"fd7131e1-b731-4fe2-96ee-94b71956cfab","resolution":{"observed_at":"2026-08-10T17:57:08.104317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.082740Z","title":"Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions,","venue":null,"work_id":"82b4d23d-1b35-48e9-a92c-4015cbc53f3c","year":1996},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.727125Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:58bd9803829e197a55f016821d1cfa9f2dc594188926f626469e1e2439f69acb","observation_id":"e131ded8-eec8-42fc-a12a-70014a3e7e7f","resolution":{"observed_at":"2026-08-10T17:57:08.088974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.064178Z","title":"Jukna, Extremal combinatorics: with applications in computer science","venue":null,"work_id":"d26afd40-5e65-4a4f-9276-ecac71d499fe","year":2011},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.731584Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:0cc2b62a61417e218e02c85db9ae2c8af0a9879748826d673a42f5257d843bee","observation_id":"966c4360-90fc-4a3a-9cba-385f6d99356e","resolution":{"observed_at":"2026-08-10T17:57:08.069570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/15m103827x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.827772Z","title":"Separating hash families: A johnson-type bound and new constructions,","venue":null,"work_id":"54e54422-06f5-4819-9c1a-c84fd8408f06","year":2016},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.736318Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:2bb54ab33d7c08c3097c44ea4035994036a4100d1e9a2b37bc45fef17cda0d89","observation_id":"11328995-888a-4292-ad6b-72840fc8528e","resolution":{"observed_at":"2026-08-10T17:57:07.834691Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12290","last_updated":"2024-06-18T05:53:09Z","snapshot_observed_at":"2026-08-12T23:40:25.635353Z","submitted_at":"2024-06-18T05:53:09Z","title":"Improving Behrend's construction: Sets without arithmetic progressions in integers and over finite fields","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12290","snapshot_observed_at":"2026-08-10T17:57:07.741254Z","title":"Improving behrend’s construction: Sets without arithmetic progressions in integers and over finite fields,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.741254Z"},"links":{"cited_paper":"/paper/2406.12290","citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:587f1d6b5e1c0c24fdc32ecfe2340c4f734f4c48eef55bf8a58b1f467d7630a4","observation_id":"2663c8c2-0f85-4436-9375-acbc9c0b8d63","resolution":{"observed_at":"2026-08-10T17:57:07.741254Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.047131Z","title":"Perfect hash families of strength three with three rows from varieties on finite projective geometries,","venue":null,"work_id":"47f4d86b-ecb0-4675-8862-d848bc2db504","year":2015},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.746598Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:1d995238e9678f23eba27117ed2d69e1ba648b1165300c6b32e2d74ba9d3f404","observation_id":"9c4a23b1-974b-4820-a334-18d9cde1f6ac","resolution":{"observed_at":"2026-08-10T17:57:08.052280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.029875Z","title":"Placement delivery array based on concatenating construction,","venue":null,"work_id":"c04e3937-ca5b-4edd-a04c-07723de5687c","year":2020},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.751200Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:7f850798cb19fc09d628f0f13c07d0c82ef940874025d92bd74cc41acfef724a","observation_id":"c03714e3-4a86-46de-87ee-bbb87e4ea38a","resolution":{"observed_at":"2026-08-10T17:57:08.035618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:08.013132Z","title":"Placement delivery arrays from combinations of strong edge colorings,","venue":null,"work_id":"9020682b-42c3-4cfd-b7fb-197856bad273","year":2020},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.755745Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:b2d6512ae855066d2dbe64859d7465b31b6d031e09cba9cf00ee79cbc5171f87","observation_id":"c6ba9b0c-6eaf-422f-b3bc-178d10f0746b","resolution":{"observed_at":"2026-08-10T17:57:08.018567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.996791Z","title":"Cryptography theory and practice, chapman &hall/crc,","venue":null,"work_id":"ef6681b5-4a2f-4186-8fd4-1e0e3393aa82","year":2006},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.760272Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:b72e710aec43604c30b73a1e5aa79e698087e95241b0f74163e1d5f87d76470e","observation_id":"90e6c7d5-a506-4a83-a8ff-2595112aa618","resolution":{"observed_at":"2026-08-10T17:57:08.002240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.981298Z","title":null,"venue":null,"work_id":"60236758-e0ba-434b-833d-cf483e2de4b4","year":2010},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.764995Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:20a7e019eb6ffd56c2eea9f4f04a333b3a1c4c749eb95f106b84ae8e998a90a4","observation_id":"a728e5bf-1c9c-4da8-9d3e-0f7e70bfc6ad","resolution":{"observed_at":"2026-08-10T17:57:07.986120Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.964245Z","title":"Combinatorics and threshold cryptography,","venue":null,"work_id":"120b78cb-50da-414c-801f-c06abe6c6690","year":2023},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.769915Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:78ea55219e087e20f77724bb226c8c12b6c7f7d295304645aa566bbe31b295ad","observation_id":"d5e3855e-476f-41c6-9324-77b85752a1f7","resolution":{"observed_at":"2026-08-10T17:57:07.970199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.947900Z","title":"Efficient multiplicative sharing schemes,","venue":null,"work_id":"31599deb-23fc-493e-a198-b23f435b04ea","year":1996},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.774735Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:a0823cec7bc2da1b71bb52915df4d78739870baead62943c3e40d93f6f61fe3d","observation_id":"6129537c-3273-4d30-808e-614909725ce3","resolution":{"observed_at":"2026-08-10T17:57:07.952839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.931344Z","title":"Roux-type constructions for covering arrays of strengths three and four,","venue":null,"work_id":"331691cd-a227-4153-8ded-62e76c3185cc","year":2006},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.779392Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:80bf09fd707278276cb049ac8c9ec69fa053883c73e651715dd1cbdd77835b5d","observation_id":"da9bc504-6aa4-4c5a-921f-dc828cd2269c","resolution":{"observed_at":"2026-08-10T17:57:07.936547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.913269Z","title":"Broadcast encryption,","venue":null,"work_id":"2317c410-0ae7-4fc8-920a-f1ce6dcffb55","year":1994},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.783868Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:135a69326941b64617f5ac3d9f1da990931a7496e3ba6471730c124909cfbe88","observation_id":"847bb533-c72d-4a4c-b881-28bd88b39db7","resolution":{"observed_at":"2026-08-10T17:57:07.918158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.896593Z","title":"Bounds and constructions for 3 3¯-separable codes with length 3,","venue":null,"work_id":"5da2a9ea-c38f-4cb2-8dec-18060620d1e3","year":2016},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.788618Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:f13bede1cee6203bd90134ff4dd7f875098a64e267043812f58d402cc8f40d2b","observation_id":"903737b8-ce0f-48d3-b903-9e627d101600","resolution":{"observed_at":"2026-08-10T17:57:07.902425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.879641Z","title":"Separating hash families: A johnson-type bound and new constructions,","venue":null,"work_id":"ffe46244-9ff2-4601-bc49-b58410eae569","year":2016},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.792926Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:afa11c31976f7594b1c57bdccd0727ebae9db9049a3a2a2bf1f7d10fd6ee4a9b","observation_id":"6abf75f4-d6d6-4435-ae77-92b3224a4ad7","resolution":{"observed_at":"2026-08-10T17:57:07.884813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0012-365x(97)00172-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:57:07.845126Z","title":"Available: https://doi.org/10.1016/S0012-365X(97)00172-6","venue":null,"work_id":"d11a3c18-6d11-46ea-b8b6-5b9193d079e8","year":null},"citing_paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","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},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-10T17:57:07.717092Z"},"links":{"citing_paper":"/paper/2501.11855"},"observation_digest":"sha256:dd0410384e6504d99eb455063842989986e0b1e522b5af7bed10afe4d2ce90f3","observation_id":"cb982cae-6c2b-43db-8aec-839423b1c2b9","resolution":{"observed_at":"2026-08-10T17:57:07.850236Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.11855","last_updated":"2025-02-23T11:52:45Z","latest_version":3,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-10T17:45:07.248475Z","submitted_at":"2025-01-21T03:13:21Z","title":"A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":43},"total_outbound_references":48},"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 48 of 48 outbound references and 2 inbound Pith citation observations for arXiv:2501.11855."}