{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:2UFOALFK24BX4TQHKOOAO6PDUY","short_pith_number":"pith:2UFOALFK","canonical_record":{"source":{"id":"2012.04483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-08T15:24:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1aa9e581efe7b14ef57e46fdc27b8277d2fb2c9bc17b7b2002480fa476c20fb1","abstract_canon_sha256":"d30279a4f418a64d68a96e4ec32b76ad1e1954ea42f96196cd439bfbc8dc869f"},"schema_version":"1.0"},"canonical_sha256":"d50ae02caad7037e4e07539c0779e3a62c4d44ea7810d1e0e480b0375ffde1a7","source":{"kind":"arxiv","id":"2012.04483","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.04483","created_at":"2026-07-05T02:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"2012.04483v3","created_at":"2026-07-05T02:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04483","created_at":"2026-07-05T02:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"2UFOALFK24BX","created_at":"2026-07-05T02:46:25Z"},{"alias_kind":"pith_short_16","alias_value":"2UFOALFK24BX4TQH","created_at":"2026-07-05T02:46:25Z"},{"alias_kind":"pith_short_8","alias_value":"2UFOALFK","created_at":"2026-07-05T02:46:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:2UFOALFK24BX4TQHKOOAO6PDUY","target":"record","payload":{"canonical_record":{"source":{"id":"2012.04483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-08T15:24:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1aa9e581efe7b14ef57e46fdc27b8277d2fb2c9bc17b7b2002480fa476c20fb1","abstract_canon_sha256":"d30279a4f418a64d68a96e4ec32b76ad1e1954ea42f96196cd439bfbc8dc869f"},"schema_version":"1.0"},"canonical_sha256":"d50ae02caad7037e4e07539c0779e3a62c4d44ea7810d1e0e480b0375ffde1a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:25.828005Z","signature_b64":"DVOzWhQggEB/X/eomrtwGOc8R32LRR0M5l7cvlGdY52+HQjiWuSIyo+8CNI7qYKP8GfyR/FKdZ+RLIiafbZ4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d50ae02caad7037e4e07539c0779e3a62c4d44ea7810d1e0e480b0375ffde1a7","last_reissued_at":"2026-07-05T02:46:25.827603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:25.827603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.04483","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:46:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XMWgZD70bwMCamA+bRAJwhQLKX0VBDkV44fDsIvoJ+SRMztLeGsyifRiK6IX863wziLGfQYI47pFxI0k5LAoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:05:35.657812Z"},"content_sha256":"43d6002aa4e0489a522c41fbfb4a654f284914075af321714211415fd4cc08e6","schema_version":"1.0","event_id":"sha256:43d6002aa4e0489a522c41fbfb4a654f284914075af321714211415fd4cc08e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:2UFOALFK24BX4TQHKOOAO6PDUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Transformation Approach of Shared-link Coded Caching Schemes for Multiaccess Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dequan Liang, Giuseppe Caire, Kai Wan, Mingming Zhang, Minquan Cheng","submitted_at":"2020-12-08T15:24:25Z","abstract_excerpt":"This paper considers the multiaccess coded caching systems formulated by Hachem et al., including a central server containing $N$ files connected to $K$ cache-less users through an error-free shared link, and $K$ cache-nodes, each equipped with a cache memory size of $M$ files. Each user has access to $L$ neighbouring cache-nodes with a cyclic wrap-around topology. The coded caching scheme proposed by Hachem et al. suffers from the case that $L$ does not divide $K$, where the needed number of transmissions (a.k.a. load) is at most four times the load expression for the case where $L$ divides $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04483","kind":"arxiv","version":3},"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/2012.04483/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:46:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dm63oJvehv7IVdVTud5hFoYwc9NukOKBzwrzp6fCZMmF2YGsE/Hc7kK7Mlr5osQDmopwDRO1Guz5MqhSbG5tAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:05:35.658352Z"},"content_sha256":"3c044dcd3f8b8a8161196dbf56a1a03350833b80a3fbcc8ce01105c85efd4e24","schema_version":"1.0","event_id":"sha256:3c044dcd3f8b8a8161196dbf56a1a03350833b80a3fbcc8ce01105c85efd4e24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UFOALFK24BX4TQHKOOAO6PDUY/bundle.json","state_url":"https://pith.science/pith/2UFOALFK24BX4TQHKOOAO6PDUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UFOALFK24BX4TQHKOOAO6PDUY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T17:05:35Z","links":{"resolver":"https://pith.science/pith/2UFOALFK24BX4TQHKOOAO6PDUY","bundle":"https://pith.science/pith/2UFOALFK24BX4TQHKOOAO6PDUY/bundle.json","state":"https://pith.science/pith/2UFOALFK24BX4TQHKOOAO6PDUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UFOALFK24BX4TQHKOOAO6PDUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2UFOALFK24BX4TQHKOOAO6PDUY","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":"d30279a4f418a64d68a96e4ec32b76ad1e1954ea42f96196cd439bfbc8dc869f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-08T15:24:25Z","title_canon_sha256":"1aa9e581efe7b14ef57e46fdc27b8277d2fb2c9bc17b7b2002480fa476c20fb1"},"schema_version":"1.0","source":{"id":"2012.04483","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.04483","created_at":"2026-07-05T02:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"2012.04483v3","created_at":"2026-07-05T02:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04483","created_at":"2026-07-05T02:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"2UFOALFK24BX","created_at":"2026-07-05T02:46:25Z"},{"alias_kind":"pith_short_16","alias_value":"2UFOALFK24BX4TQH","created_at":"2026-07-05T02:46:25Z"},{"alias_kind":"pith_short_8","alias_value":"2UFOALFK","created_at":"2026-07-05T02:46:25Z"}],"graph_snapshots":[{"event_id":"sha256:3c044dcd3f8b8a8161196dbf56a1a03350833b80a3fbcc8ce01105c85efd4e24","target":"graph","created_at":"2026-07-05T02:46:25Z","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/2012.04483/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers the multiaccess coded caching systems formulated by Hachem et al., including a central server containing $N$ files connected to $K$ cache-less users through an error-free shared link, and $K$ cache-nodes, each equipped with a cache memory size of $M$ files. Each user has access to $L$ neighbouring cache-nodes with a cyclic wrap-around topology. The coded caching scheme proposed by Hachem et al. suffers from the case that $L$ does not divide $K$, where the needed number of transmissions (a.k.a. load) is at most four times the load expression for the case where $L$ divides $","authors_text":"Dequan Liang, Giuseppe Caire, Kai Wan, Mingming Zhang, Minquan Cheng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-08T15:24:25Z","title":"A Novel Transformation Approach of Shared-link Coded Caching Schemes for Multiaccess Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04483","kind":"arxiv","version":3},"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:43d6002aa4e0489a522c41fbfb4a654f284914075af321714211415fd4cc08e6","target":"record","created_at":"2026-07-05T02:46:25Z","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":"d30279a4f418a64d68a96e4ec32b76ad1e1954ea42f96196cd439bfbc8dc869f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-08T15:24:25Z","title_canon_sha256":"1aa9e581efe7b14ef57e46fdc27b8277d2fb2c9bc17b7b2002480fa476c20fb1"},"schema_version":"1.0","source":{"id":"2012.04483","kind":"arxiv","version":3}},"canonical_sha256":"d50ae02caad7037e4e07539c0779e3a62c4d44ea7810d1e0e480b0375ffde1a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d50ae02caad7037e4e07539c0779e3a62c4d44ea7810d1e0e480b0375ffde1a7","first_computed_at":"2026-07-05T02:46:25.827603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:46:25.827603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DVOzWhQggEB/X/eomrtwGOc8R32LRR0M5l7cvlGdY52+HQjiWuSIyo+8CNI7qYKP8GfyR/FKdZ+RLIiafbZ4DA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:46:25.828005Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.04483","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43d6002aa4e0489a522c41fbfb4a654f284914075af321714211415fd4cc08e6","sha256:3c044dcd3f8b8a8161196dbf56a1a03350833b80a3fbcc8ce01105c85efd4e24"],"state_sha256":"78047419a9996defe474d90c23d8730537ac9afab7808c8232d514c74b24aeae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDtOMQOQfuQTDAAfC2/91wIU+qYRvo7fNY3Incbh4NwmSTNDCYsCzt+PMxLWzBOWgg4SbCJnY8KtNTGp6igADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:05:35.663737Z","bundle_sha256":"1cb50e14e3afb93e5d235722a3186b90d15b2682c52155e847fdd610ad2d0fe8"}}