{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5S4QCDQRWWJCESDGWQEX6BL2CI","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":"8282d30f845cada1d556a3c064951a487a7173d0c988510b4f608f04d0488c9d","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-09-10T12:17:46Z","title_canon_sha256":"6cf05aba392c51d466fbac8cc161c95808ff11c4b2b5d08301055dcacd08ddd2"},"schema_version":"1.0","source":{"id":"2209.04647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.04647","created_at":"2026-07-05T04:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"2209.04647v1","created_at":"2026-07-05T04:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.04647","created_at":"2026-07-05T04:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"5S4QCDQRWWJC","created_at":"2026-07-05T04:56:21Z"},{"alias_kind":"pith_short_16","alias_value":"5S4QCDQRWWJCESDG","created_at":"2026-07-05T04:56:21Z"},{"alias_kind":"pith_short_8","alias_value":"5S4QCDQR","created_at":"2026-07-05T04:56:21Z"}],"graph_snapshots":[{"event_id":"sha256:d153bc5fce3ead62267ab71333a547c9ba21d5132b747d491779948a5284742b","target":"graph","created_at":"2026-07-05T04:56:21Z","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/2209.04647/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Several network communication problems are highly related such as coded caching and distributed computation. The centralized coded caching focuses on reducing the network burden in peak times in a wireless network system and the coded distributed computation studies the tradeoff between computation and communication in distributed system. In this paper, motivated by the study of the only rainbow $3$-term arithmetic progressions set, we propose a unified framework for constructing coded caching schemes. This framework builds bridges between coded caching schemes and lots of combinatorial object","authors_text":"Gennian Ge, Min-Qian Liu, Min Xu, Zixiang Xu","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-09-10T12:17:46Z","title":"A generic framework for coded caching and distributed computation schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.04647","kind":"arxiv","version":1},"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:fbbf5de9bca97fdd42f55a9b89ad82e30228f35484d155832a145b92c7cd24d2","target":"record","created_at":"2026-07-05T04:56:21Z","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":"8282d30f845cada1d556a3c064951a487a7173d0c988510b4f608f04d0488c9d","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-09-10T12:17:46Z","title_canon_sha256":"6cf05aba392c51d466fbac8cc161c95808ff11c4b2b5d08301055dcacd08ddd2"},"schema_version":"1.0","source":{"id":"2209.04647","kind":"arxiv","version":1}},"canonical_sha256":"ecb9010e11b592224866b4097f057a121a9aa60e6023c4d53e778d5199a4504e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecb9010e11b592224866b4097f057a121a9aa60e6023c4d53e778d5199a4504e","first_computed_at":"2026-07-05T04:56:21.668059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:56:21.668059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ytEe98j7XJViY3KsEI2JaMNAe5gXO9qrXsVcteFgnmYO1SGgPcJWPo5MimsdOpuR/FIPx0hGPZDzLFT5OL8wCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:56:21.668597Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.04647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbbf5de9bca97fdd42f55a9b89ad82e30228f35484d155832a145b92c7cd24d2","sha256:d153bc5fce3ead62267ab71333a547c9ba21d5132b747d491779948a5284742b"],"state_sha256":"d374722204010c7b4e897c378cbeb37cd1a8b7dc987e7554c2d57eeaa9862f2f"}