{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KXYMXNVKL65SSIUSY722VKA2FU","short_pith_number":"pith:KXYMXNVK","schema_version":"1.0","canonical_sha256":"55f0cbb6aa5fbb292292c7f5aaa81a2d27f37a40d8af99981ea4a3805ba2ee66","source":{"kind":"arxiv","id":"2501.11855","version":3},"attestation_state":"computed","paper":{"title":"A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Huimei Wei, Kai Wan, Minquan Cheng","submitted_at":"2025-01-21T03:13:21Z","abstract_excerpt":"Coded caching is a promising technique to effectively reduce peak traffic by using local caches and the multicast gains generated by these local caches. We prefer to design a coded caching scheme with the subpacketization $F$ and transmission load $R$ as small as possible since these are the key metrics for evaluating the implementation complexity and transmission efficiency of the scheme, respectively. However, most of the existing coded caching schemes have large subpacketizations which grow exponentially with the number of users $K$, and there are a few schemes with linear subpacketizations"},"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":"2501.11855","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-21T03:13:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d4ec3f8e98d039ac82bec7ad25a13c0deaa22e2957db30004f01b46b455d4533","abstract_canon_sha256":"12f8ca84d8374628a9c012d1d8c9e0890620f690eb25713e62b5afd9b966913e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:48.558380Z","signature_b64":"aiHsearHLu90jF5sTAzGtOP23sPLuydAsDG4RkQLHU5bI8Hx8FMuczJKIUJ62hLzeWuub9fKP/Byy0q4fiD3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55f0cbb6aa5fbb292292c7f5aaa81a2d27f37a40d8af99981ea4a3805ba2ee66","last_reissued_at":"2026-07-05T10:18:48.557766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:48.557766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Huimei Wei, Kai Wan, Minquan Cheng","submitted_at":"2025-01-21T03:13:21Z","abstract_excerpt":"Coded caching is a promising technique to effectively reduce peak traffic by using local caches and the multicast gains generated by these local caches. We prefer to design a coded caching scheme with the subpacketization $F$ and transmission load $R$ as small as possible since these are the key metrics for evaluating the implementation complexity and transmission efficiency of the scheme, respectively. However, most of the existing coded caching schemes have large subpacketizations which grow exponentially with the number of users $K$, and there are a few schemes with linear subpacketizations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11855","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/2501.11855/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":"2501.11855","created_at":"2026-07-05T10:18:48.557834+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.11855v3","created_at":"2026-07-05T10:18:48.557834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11855","created_at":"2026-07-05T10:18:48.557834+00:00"},{"alias_kind":"pith_short_12","alias_value":"KXYMXNVKL65S","created_at":"2026-07-05T10:18:48.557834+00:00"},{"alias_kind":"pith_short_16","alias_value":"KXYMXNVKL65SSIUS","created_at":"2026-07-05T10:18:48.557834+00:00"},{"alias_kind":"pith_short_8","alias_value":"KXYMXNVK","created_at":"2026-07-05T10:18:48.557834+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/KXYMXNVKL65SSIUSY722VKA2FU","json":"https://pith.science/pith/KXYMXNVKL65SSIUSY722VKA2FU.json","graph_json":"https://pith.science/api/pith-number/KXYMXNVKL65SSIUSY722VKA2FU/graph.json","events_json":"https://pith.science/api/pith-number/KXYMXNVKL65SSIUSY722VKA2FU/events.json","paper":"https://pith.science/paper/KXYMXNVK"},"agent_actions":{"view_html":"https://pith.science/pith/KXYMXNVKL65SSIUSY722VKA2FU","download_json":"https://pith.science/pith/KXYMXNVKL65SSIUSY722VKA2FU.json","view_paper":"https://pith.science/paper/KXYMXNVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.11855&json=true","fetch_graph":"https://pith.science/api/pith-number/KXYMXNVKL65SSIUSY722VKA2FU/graph.json","fetch_events":"https://pith.science/api/pith-number/KXYMXNVKL65SSIUSY722VKA2FU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KXYMXNVKL65SSIUSY722VKA2FU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KXYMXNVKL65SSIUSY722VKA2FU/action/storage_attestation","attest_author":"https://pith.science/pith/KXYMXNVKL65SSIUSY722VKA2FU/action/author_attestation","sign_citation":"https://pith.science/pith/KXYMXNVKL65SSIUSY722VKA2FU/action/citation_signature","submit_replication":"https://pith.science/pith/KXYMXNVKL65SSIUSY722VKA2FU/action/replication_record"}},"created_at":"2026-07-05T10:18:48.557834+00:00","updated_at":"2026-07-05T10:18:48.557834+00:00"}