{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5KWSKX65747QN6L3CXOSXH73EB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cc95cc69033439f2bfdca468d0dec5e841bc24f9795746be1c8014a6fb4f1b96","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-27T12:11:30Z","title_canon_sha256":"1b3de4da9247a5f57d1661d25bb9a173ac7adf890216ef9a6ce3478b0576dd5e"},"schema_version":"1.0","source":{"id":"2201.11465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.11465","created_at":"2026-07-05T04:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"2201.11465v2","created_at":"2026-07-05T04:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.11465","created_at":"2026-07-05T04:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"5KWSKX65747Q","created_at":"2026-07-05T04:34:15Z"},{"alias_kind":"pith_short_16","alias_value":"5KWSKX65747QN6L3","created_at":"2026-07-05T04:34:15Z"},{"alias_kind":"pith_short_8","alias_value":"5KWSKX65","created_at":"2026-07-05T04:34:15Z"}],"graph_snapshots":[{"event_id":"sha256:6565a302f71a7873269a091c511e2154d6971f399600ead977c0fac19f02db11","target":"graph","created_at":"2026-07-05T04:34:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.11465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies a novel multi-access coded caching (MACC) model in the two-dimensional (2D) topology, which is a generalization of the one-dimensional (1D) MACC model proposed by Hachem et al. The 2D MACC model is formed by a server containing $N$ files, $K_1\\times K_2$ cache-nodes with $M$ files located at a grid with $K_1$ rows and $K_2$ columns, and $K_1\\times K_2$ cache-less users where each user is connected to $L^2$ nearby cache-nodes. The server is connected to the users through an error-free shared link, while the users can retrieve the cached content of the connected cache-nodes wi","authors_text":"Giuseppe Caire, Kai Wan, Mingming Zhang, Minquan Cheng","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-27T12:11:30Z","title":"Coded Caching for Two-Dimensional Multi-Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.11465","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:902b76db5d1a2033049696e3e26a116fa8b60a369eb2816314f96481d60bfb6f","target":"record","created_at":"2026-07-05T04:34:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cc95cc69033439f2bfdca468d0dec5e841bc24f9795746be1c8014a6fb4f1b96","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-27T12:11:30Z","title_canon_sha256":"1b3de4da9247a5f57d1661d25bb9a173ac7adf890216ef9a6ce3478b0576dd5e"},"schema_version":"1.0","source":{"id":"2201.11465","kind":"arxiv","version":2}},"canonical_sha256":"eaad255fddff3f06f97b15dd2b9ffb20525a0f0fc414bbc6df4dd9a619ae05db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaad255fddff3f06f97b15dd2b9ffb20525a0f0fc414bbc6df4dd9a619ae05db","first_computed_at":"2026-07-05T04:34:15.022420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:34:15.022420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uo0evESxzmkt0/ZkmepAKGuqTRTk6NVZBMmy4dvXssvXcke8NuFlWUxPhxxpZL00AM6E2vFM7toJvx/CYQSJAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:34:15.022929Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.11465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:902b76db5d1a2033049696e3e26a116fa8b60a369eb2816314f96481d60bfb6f","sha256:6565a302f71a7873269a091c511e2154d6971f399600ead977c0fac19f02db11"],"state_sha256":"b4a9a847dbe27d557c204cdfe2fcfce8813b3603de6f981c68245c4da168ef88"}