{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2WLKYAQJSE364IBK3OCYNSXBAJ","short_pith_number":"pith:2WLKYAQJ","schema_version":"1.0","canonical_sha256":"d596ac02099137ee202adb8586cae1024c5a61744aa690a15d001d3d9b265834","source":{"kind":"arxiv","id":"2310.20239","version":1},"attestation_state":"computed","paper":{"title":"Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Kai Wan, Minquan Cheng, Petros Elia","submitted_at":"2023-10-31T07:46:08Z","abstract_excerpt":"This paper studies a multiaccess coded caching (MACC) where the connectivity topology between the users and the caches can be described by a class of combinatorial designs. Our model includes as special cases several MACC topologies considered in previous works. The considered MACC network includes a server containing $N$ files, $\\Gamma$ cache nodes and $K$ cacheless users, where each user can access $L$ cache nodes. The server is connected to the users via an error-free shared link, while the users can retrieve the cache content of the connected cache-nodes while the users can directly access"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2310.20239","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-31T07:46:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"303ddc4c37c7a1498b00c25d12bd4b15d5a65e3388ea5266ec12f12d19d72915","abstract_canon_sha256":"6aa297515feb23de4eff73d74e0b2791f74d9769942aa916de8c070b3b2cb737"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:07:26.281599Z","signature_b64":"zCo/P9VTWBSQFL8JPXcKqOJqw9OTwfgF6UAvr2KkR2YhA2jpCUw3RT1nQ0MLtUaFg+HAps+/JqKonjMmC50BCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d596ac02099137ee202adb8586cae1024c5a61744aa690a15d001d3d9b265834","last_reissued_at":"2026-07-05T07:07:26.281195Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:07:26.281195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Kai Wan, Minquan Cheng, Petros Elia","submitted_at":"2023-10-31T07:46:08Z","abstract_excerpt":"This paper studies a multiaccess coded caching (MACC) where the connectivity topology between the users and the caches can be described by a class of combinatorial designs. Our model includes as special cases several MACC topologies considered in previous works. The considered MACC network includes a server containing $N$ files, $\\Gamma$ cache nodes and $K$ cacheless users, where each user can access $L$ cache nodes. The server is connected to the users via an error-free shared link, while the users can retrieve the cache content of the connected cache-nodes while the users can directly access"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.20239","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.20239/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.20239","created_at":"2026-07-05T07:07:26.281246+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.20239v1","created_at":"2026-07-05T07:07:26.281246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.20239","created_at":"2026-07-05T07:07:26.281246+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WLKYAQJSE36","created_at":"2026-07-05T07:07:26.281246+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WLKYAQJSE364IBK","created_at":"2026-07-05T07:07:26.281246+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WLKYAQJ","created_at":"2026-07-05T07:07:26.281246+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2WLKYAQJSE364IBK3OCYNSXBAJ","json":"https://pith.science/pith/2WLKYAQJSE364IBK3OCYNSXBAJ.json","graph_json":"https://pith.science/api/pith-number/2WLKYAQJSE364IBK3OCYNSXBAJ/graph.json","events_json":"https://pith.science/api/pith-number/2WLKYAQJSE364IBK3OCYNSXBAJ/events.json","paper":"https://pith.science/paper/2WLKYAQJ"},"agent_actions":{"view_html":"https://pith.science/pith/2WLKYAQJSE364IBK3OCYNSXBAJ","download_json":"https://pith.science/pith/2WLKYAQJSE364IBK3OCYNSXBAJ.json","view_paper":"https://pith.science/paper/2WLKYAQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.20239&json=true","fetch_graph":"https://pith.science/api/pith-number/2WLKYAQJSE364IBK3OCYNSXBAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2WLKYAQJSE364IBK3OCYNSXBAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WLKYAQJSE364IBK3OCYNSXBAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WLKYAQJSE364IBK3OCYNSXBAJ/action/storage_attestation","attest_author":"https://pith.science/pith/2WLKYAQJSE364IBK3OCYNSXBAJ/action/author_attestation","sign_citation":"https://pith.science/pith/2WLKYAQJSE364IBK3OCYNSXBAJ/action/citation_signature","submit_replication":"https://pith.science/pith/2WLKYAQJSE364IBK3OCYNSXBAJ/action/replication_record"}},"created_at":"2026-07-05T07:07:26.281246+00:00","updated_at":"2026-07-05T07:07:26.281246+00:00"}