{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N2ZVCXJ2JKL26N4ITKJDE6S6TH","short_pith_number":"pith:N2ZVCXJ2","canonical_record":{"source":{"id":"1712.04930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T18:57:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b5965054f993dde29fcd4b3651aa8903d8675c4617721afdae6d77ba220d81bb","abstract_canon_sha256":"8dfb1e1a8cb2ce0b990526737a85ff85f1d9d303bd942a33e87eb07657d06277"},"schema_version":"1.0"},"canonical_sha256":"6eb3515d3a4a97af37889a92327a5e99ed5d529d0efdcaa6e79661183d510f70","source":{"kind":"arxiv","id":"1712.04930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04930","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04930v1","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04930","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"N2ZVCXJ2JKL2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N2ZVCXJ2JKL26N4I","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N2ZVCXJ2","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N2ZVCXJ2JKL26N4ITKJDE6S6TH","target":"record","payload":{"canonical_record":{"source":{"id":"1712.04930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T18:57:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b5965054f993dde29fcd4b3651aa8903d8675c4617721afdae6d77ba220d81bb","abstract_canon_sha256":"8dfb1e1a8cb2ce0b990526737a85ff85f1d9d303bd942a33e87eb07657d06277"},"schema_version":"1.0"},"canonical_sha256":"6eb3515d3a4a97af37889a92327a5e99ed5d529d0efdcaa6e79661183d510f70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:03.136183Z","signature_b64":"0Oysd7uDMzk6Z7fJNf7HE66xUflFtxtj97dGZ7yNKqZ3Hqd8Eb8Eim9lpwNXScm/Nv/N8/aovvw2sA9ORfNYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eb3515d3a4a97af37889a92327a5e99ed5d529d0efdcaa6e79661183d510f70","last_reissued_at":"2026-05-18T00:28:03.135504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:03.135504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.04930","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-18T00:28:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AzuPf0MSXKi8Q4rGjfWvR2AEh8doGlL5Asjv6UHeMyf26jBd8E0TCc339Z4pkmyCpBDAOhIXRR+1k+AZrOHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:00:44.710260Z"},"content_sha256":"5b574ecde6239e46f8145af435bda382a09695f98ca3d40dc80cba63fcd34cdd","schema_version":"1.0","event_id":"sha256:5b574ecde6239e46f8145af435bda382a09695f98ca3d40dc80cba63fcd34cdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N2ZVCXJ2JKL26N4ITKJDE6S6TH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combination Networks with or without Secrecy Constraints: The Impact of Caching Relays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed A. Zewail, Aylin Yener","submitted_at":"2017-12-13T18:57:17Z","abstract_excerpt":"This paper considers a two-hop network architecture known as a combination network, where a layer of relay nodes connects a server to a set of end users. In particular, a new model is investigated where the intermediate relays employ caches in addition to the end users. First, a new centralized coded caching scheme is developed that utilizes maximum distance separable (MDS) coding, jointly optimizes cache placement and delivery phase, and enables decomposing the combination network into a set virtual multicast sub-networks. It is shown that if the sum of the memory of an end user and its conne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04930","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-18T00:28:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JwH6mXkpoq819QlbYMqo+NH+51+hwaterH8IZylFP+NSeokA/T5WnurlcrF8HIcHP3yp/RWNHKXO5o3BoYl/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:00:44.710627Z"},"content_sha256":"b0a9820bc7a7d6dcc1906ef29ab87c6d6211f1cca451f4d2db8a4f6955732314","schema_version":"1.0","event_id":"sha256:b0a9820bc7a7d6dcc1906ef29ab87c6d6211f1cca451f4d2db8a4f6955732314"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2ZVCXJ2JKL26N4ITKJDE6S6TH/bundle.json","state_url":"https://pith.science/pith/N2ZVCXJ2JKL26N4ITKJDE6S6TH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2ZVCXJ2JKL26N4ITKJDE6S6TH/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-06-07T07:00:44Z","links":{"resolver":"https://pith.science/pith/N2ZVCXJ2JKL26N4ITKJDE6S6TH","bundle":"https://pith.science/pith/N2ZVCXJ2JKL26N4ITKJDE6S6TH/bundle.json","state":"https://pith.science/pith/N2ZVCXJ2JKL26N4ITKJDE6S6TH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2ZVCXJ2JKL26N4ITKJDE6S6TH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N2ZVCXJ2JKL26N4ITKJDE6S6TH","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":"8dfb1e1a8cb2ce0b990526737a85ff85f1d9d303bd942a33e87eb07657d06277","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T18:57:17Z","title_canon_sha256":"b5965054f993dde29fcd4b3651aa8903d8675c4617721afdae6d77ba220d81bb"},"schema_version":"1.0","source":{"id":"1712.04930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04930","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04930v1","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04930","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"N2ZVCXJ2JKL2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N2ZVCXJ2JKL26N4I","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N2ZVCXJ2","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:b0a9820bc7a7d6dcc1906ef29ab87c6d6211f1cca451f4d2db8a4f6955732314","target":"graph","created_at":"2026-05-18T00:28:03Z","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":"This paper considers a two-hop network architecture known as a combination network, where a layer of relay nodes connects a server to a set of end users. In particular, a new model is investigated where the intermediate relays employ caches in addition to the end users. First, a new centralized coded caching scheme is developed that utilizes maximum distance separable (MDS) coding, jointly optimizes cache placement and delivery phase, and enables decomposing the combination network into a set virtual multicast sub-networks. It is shown that if the sum of the memory of an end user and its conne","authors_text":"Ahmed A. Zewail, Aylin Yener","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T18:57:17Z","title":"Combination Networks with or without Secrecy Constraints: The Impact of Caching Relays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04930","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:5b574ecde6239e46f8145af435bda382a09695f98ca3d40dc80cba63fcd34cdd","target":"record","created_at":"2026-05-18T00:28:03Z","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":"8dfb1e1a8cb2ce0b990526737a85ff85f1d9d303bd942a33e87eb07657d06277","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T18:57:17Z","title_canon_sha256":"b5965054f993dde29fcd4b3651aa8903d8675c4617721afdae6d77ba220d81bb"},"schema_version":"1.0","source":{"id":"1712.04930","kind":"arxiv","version":1}},"canonical_sha256":"6eb3515d3a4a97af37889a92327a5e99ed5d529d0efdcaa6e79661183d510f70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eb3515d3a4a97af37889a92327a5e99ed5d529d0efdcaa6e79661183d510f70","first_computed_at":"2026-05-18T00:28:03.135504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:03.135504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Oysd7uDMzk6Z7fJNf7HE66xUflFtxtj97dGZ7yNKqZ3Hqd8Eb8Eim9lpwNXScm/Nv/N8/aovvw2sA9ORfNYAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:03.136183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b574ecde6239e46f8145af435bda382a09695f98ca3d40dc80cba63fcd34cdd","sha256:b0a9820bc7a7d6dcc1906ef29ab87c6d6211f1cca451f4d2db8a4f6955732314"],"state_sha256":"0762ff54dbe135db207bedac23410f30d2c9a4bdc29beb3085c628427eaae828"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6GKR1LuasVCD6ZwyCvFWdtN52frkKKugbF1/s90mwjDOZUqN9tulyk6HA8jPeiCeN5FLaDZPSTvx8YDYBhSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:00:44.712654Z","bundle_sha256":"a59a5534a47febb81f4d5249301d683c08818dd0266cea2bcdb19a320cf99c79"}}