{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3ZW2GF2KOKOXGWDVAMN5XXFR23","short_pith_number":"pith:3ZW2GF2K","canonical_record":{"source":{"id":"1904.05487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T00:34:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fb3ed5908bccc9fd383921b2ee053b272b572037d4b641cf0aee8d93d696e869","abstract_canon_sha256":"195fe8f6beaee75e80ce130eee665e348c8e9cb2d5cdf03e9ff2ead62bed9b7f"},"schema_version":"1.0"},"canonical_sha256":"de6da3174a729d735875031bdbdcb1d6e85b82f7862a4d349641ac9d3b43018d","source":{"kind":"arxiv","id":"1904.05487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05487","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05487v1","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05487","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"3ZW2GF2KOKOX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3ZW2GF2KOKOXGWDV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3ZW2GF2K","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3ZW2GF2KOKOXGWDVAMN5XXFR23","target":"record","payload":{"canonical_record":{"source":{"id":"1904.05487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T00:34:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fb3ed5908bccc9fd383921b2ee053b272b572037d4b641cf0aee8d93d696e869","abstract_canon_sha256":"195fe8f6beaee75e80ce130eee665e348c8e9cb2d5cdf03e9ff2ead62bed9b7f"},"schema_version":"1.0"},"canonical_sha256":"de6da3174a729d735875031bdbdcb1d6e85b82f7862a4d349641ac9d3b43018d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:49.368563Z","signature_b64":"UDAgPqTVf2mZtl6n4SaPvtnCsk6aJyfWCMCI/6ce9IB0lP3ldTB94TdNES4pY+Wj/EyI9zN+gMAriXCkwzxiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de6da3174a729d735875031bdbdcb1d6e85b82f7862a4d349641ac9d3b43018d","last_reissued_at":"2026-05-17T23:48:49.368051Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:49.368051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.05487","source_version":1,"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-05-17T23:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WfnI0Wu6GMnbaKyraxn5I3IVhs7sB1ErI7Z7QZcBRSRctHwbztJYo/DGqKc9BoNlj1h/pCni57c0lZXsKiNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:37:11.153737Z"},"content_sha256":"b3ee97002f5ab04960ebcacb469b9f302805c8d1a43f03e0a765d7eeccda806e","schema_version":"1.0","event_id":"sha256:b3ee97002f5ab04960ebcacb469b9f302805c8d1a43f03e0a765d7eeccda806e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3ZW2GF2KOKOXGWDVAMN5XXFR23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Centralized Coded Caching with User Cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haoyu Yin, Jiahui Chen, Xiaowen You, Yanlin Geng, Youlong Wu","submitted_at":"2019-04-11T00:34:56Z","abstract_excerpt":"In this paper, we consider the coded-caching broadcast network with user cooperation, where a server connects with multiple users and the users can cooperate with each other through a cooperation network. We propose a centralized coded caching scheme based on a new deterministic placement strategy and a parallel delivery strategy. It is shown that the new scheme optimally allocate the communication loads on the server and users, obtaining cooperation gain and parallel gain that greatly reduces the transmission delay. Furthermore, we show that the number of users who parallelly send information"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05487","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":""},"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-05-17T23:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Jtz9h1mdtjbIcFgCSku2mYTGVjaflLtFyYN03tCndN2w/y7MxI7YhRwFTzM4WmRLgxgLhGCI8y+oL+mZ0koBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:37:11.154096Z"},"content_sha256":"da2c7a96c9bc599a04b731fe9edd53a80d1b003fcd0e38062e5cf626b8aaac8c","schema_version":"1.0","event_id":"sha256:da2c7a96c9bc599a04b731fe9edd53a80d1b003fcd0e38062e5cf626b8aaac8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZW2GF2KOKOXGWDVAMN5XXFR23/bundle.json","state_url":"https://pith.science/pith/3ZW2GF2KOKOXGWDVAMN5XXFR23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZW2GF2KOKOXGWDVAMN5XXFR23/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-05-26T16:37:11Z","links":{"resolver":"https://pith.science/pith/3ZW2GF2KOKOXGWDVAMN5XXFR23","bundle":"https://pith.science/pith/3ZW2GF2KOKOXGWDVAMN5XXFR23/bundle.json","state":"https://pith.science/pith/3ZW2GF2KOKOXGWDVAMN5XXFR23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZW2GF2KOKOXGWDVAMN5XXFR23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3ZW2GF2KOKOXGWDVAMN5XXFR23","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":"195fe8f6beaee75e80ce130eee665e348c8e9cb2d5cdf03e9ff2ead62bed9b7f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T00:34:56Z","title_canon_sha256":"fb3ed5908bccc9fd383921b2ee053b272b572037d4b641cf0aee8d93d696e869"},"schema_version":"1.0","source":{"id":"1904.05487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05487","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05487v1","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05487","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"3ZW2GF2KOKOX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3ZW2GF2KOKOXGWDV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3ZW2GF2K","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:da2c7a96c9bc599a04b731fe9edd53a80d1b003fcd0e38062e5cf626b8aaac8c","target":"graph","created_at":"2026-05-17T23:48:49Z","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"},"paper":{"abstract_excerpt":"In this paper, we consider the coded-caching broadcast network with user cooperation, where a server connects with multiple users and the users can cooperate with each other through a cooperation network. We propose a centralized coded caching scheme based on a new deterministic placement strategy and a parallel delivery strategy. It is shown that the new scheme optimally allocate the communication loads on the server and users, obtaining cooperation gain and parallel gain that greatly reduces the transmission delay. Furthermore, we show that the number of users who parallelly send information","authors_text":"Haoyu Yin, Jiahui Chen, Xiaowen You, Yanlin Geng, Youlong Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T00:34:56Z","title":"Centralized Coded Caching with User Cooperation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05487","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:b3ee97002f5ab04960ebcacb469b9f302805c8d1a43f03e0a765d7eeccda806e","target":"record","created_at":"2026-05-17T23:48:49Z","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":"195fe8f6beaee75e80ce130eee665e348c8e9cb2d5cdf03e9ff2ead62bed9b7f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T00:34:56Z","title_canon_sha256":"fb3ed5908bccc9fd383921b2ee053b272b572037d4b641cf0aee8d93d696e869"},"schema_version":"1.0","source":{"id":"1904.05487","kind":"arxiv","version":1}},"canonical_sha256":"de6da3174a729d735875031bdbdcb1d6e85b82f7862a4d349641ac9d3b43018d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de6da3174a729d735875031bdbdcb1d6e85b82f7862a4d349641ac9d3b43018d","first_computed_at":"2026-05-17T23:48:49.368051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:49.368051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UDAgPqTVf2mZtl6n4SaPvtnCsk6aJyfWCMCI/6ce9IB0lP3ldTB94TdNES4pY+Wj/EyI9zN+gMAriXCkwzxiCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:49.368563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3ee97002f5ab04960ebcacb469b9f302805c8d1a43f03e0a765d7eeccda806e","sha256:da2c7a96c9bc599a04b731fe9edd53a80d1b003fcd0e38062e5cf626b8aaac8c"],"state_sha256":"3e68376579dac873a1447f5fd9440924c483ed3d0b289064297dd7c8acace0fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Td0Gl5PIRs8d8R6XW1eLrrJdiy7snvrnxSYdaiti2JhSOdv36aE1snkfSgaTM78IHljS+nOS/Taxt5TgFA13Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:37:11.156350Z","bundle_sha256":"5696e967623fbff7b11b8fc8f3033d5165deec1a9f00b0f9161986c592d20e24"}}