{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ACUAGRO7A6WYE7FVUQYNSZZ3E3","short_pith_number":"pith:ACUAGRO7","canonical_record":{"source":{"id":"1710.06752","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-18T14:32:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9300bb5f5837ea3f6066c7a8d43dc3f629e3fc22b85e7ac755e8406179f20f8b","abstract_canon_sha256":"459508ff08e38bb09133c161eb59e03bff101f04f6ef33e02a355f8bc1673a7f"},"schema_version":"1.0"},"canonical_sha256":"00a80345df07ad827cb5a430d9673b26e9226d9020b88e8122189fdb0c774655","source":{"kind":"arxiv","id":"1710.06752","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06752","created_at":"2026-05-18T00:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06752v2","created_at":"2026-05-18T00:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06752","created_at":"2026-05-18T00:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"ACUAGRO7A6WY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ACUAGRO7A6WYE7FV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ACUAGRO7","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ACUAGRO7A6WYE7FVUQYNSZZ3E3","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06752","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-18T14:32:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9300bb5f5837ea3f6066c7a8d43dc3f629e3fc22b85e7ac755e8406179f20f8b","abstract_canon_sha256":"459508ff08e38bb09133c161eb59e03bff101f04f6ef33e02a355f8bc1673a7f"},"schema_version":"1.0"},"canonical_sha256":"00a80345df07ad827cb5a430d9673b26e9226d9020b88e8122189fdb0c774655","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:13.686641Z","signature_b64":"sypbdAwgUXZ9tzHEn9ADUlTuKXNXlZG22NSLhp5Jfk1e0R40CLMVbPlL0MnWZnQq7pzAISiLB6odcqUCoF5fAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00a80345df07ad827cb5a430d9673b26e9226d9020b88e8122189fdb0c774655","last_reissued_at":"2026-05-18T00:19:13.685997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:13.685997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06752","source_version":2,"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:19:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMZ/0JGGLTqQziTTYSb6Kdqhu1ry04m/z3BX3MAi9g7zzs4Ce5pLnHJkGrYvknEyKZJtt1yqFnwKfLuHtweyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:20:48.236764Z"},"content_sha256":"76a61db4770a79c81bafc40a6e5abbff33dbc9d49b82ade888dbf0e892d8cfb5","schema_version":"1.0","event_id":"sha256:76a61db4770a79c81bafc40a6e5abbff33dbc9d49b82ade888dbf0e892d8cfb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ACUAGRO7A6WYE7FVUQYNSZZ3E3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Caching in Combination Networks: Novel Multicast Message Generation and Delivery by Leveraging the Network Topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Kai Wan, Mingyue Ji, Pablo Piantanida","submitted_at":"2017-10-18T14:32:58Z","abstract_excerpt":"Maddah-Ali and Niesen's original coded caching scheme for shared-link broadcast networks is now known to be optimal to within a factor two, and has been applied to other types of networks. For practical reasons, this paper considers that a server communicates to cache-aided users through $H$ intermediate relays. In particular, it focuses on combination networks where each of the $K = \\binom{H}{r}$ users is connected to a distinct $r$-subsets of relays. By leveraging the symmetric topology of the network, this paper proposes a novel method to general multicast messages and to deliver them to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06752","kind":"arxiv","version":2},"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:19:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIp++oxpvJWGXIolmYDU+mcAz4hhRvXuXFvunh0tXiXOh0jpoPrzfAe66qBhLaBBwCG+JIKfSIltgHwDPrhdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:20:48.237410Z"},"content_sha256":"db32512558abd9ad85a0fdcaa32f756445b5dd104e29119478da0fecbea9e878","schema_version":"1.0","event_id":"sha256:db32512558abd9ad85a0fdcaa32f756445b5dd104e29119478da0fecbea9e878"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACUAGRO7A6WYE7FVUQYNSZZ3E3/bundle.json","state_url":"https://pith.science/pith/ACUAGRO7A6WYE7FVUQYNSZZ3E3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACUAGRO7A6WYE7FVUQYNSZZ3E3/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-11T01:20:48Z","links":{"resolver":"https://pith.science/pith/ACUAGRO7A6WYE7FVUQYNSZZ3E3","bundle":"https://pith.science/pith/ACUAGRO7A6WYE7FVUQYNSZZ3E3/bundle.json","state":"https://pith.science/pith/ACUAGRO7A6WYE7FVUQYNSZZ3E3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACUAGRO7A6WYE7FVUQYNSZZ3E3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ACUAGRO7A6WYE7FVUQYNSZZ3E3","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":"459508ff08e38bb09133c161eb59e03bff101f04f6ef33e02a355f8bc1673a7f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-18T14:32:58Z","title_canon_sha256":"9300bb5f5837ea3f6066c7a8d43dc3f629e3fc22b85e7ac755e8406179f20f8b"},"schema_version":"1.0","source":{"id":"1710.06752","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06752","created_at":"2026-05-18T00:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06752v2","created_at":"2026-05-18T00:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06752","created_at":"2026-05-18T00:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"ACUAGRO7A6WY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ACUAGRO7A6WYE7FV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ACUAGRO7","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:db32512558abd9ad85a0fdcaa32f756445b5dd104e29119478da0fecbea9e878","target":"graph","created_at":"2026-05-18T00:19:13Z","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":"Maddah-Ali and Niesen's original coded caching scheme for shared-link broadcast networks is now known to be optimal to within a factor two, and has been applied to other types of networks. For practical reasons, this paper considers that a server communicates to cache-aided users through $H$ intermediate relays. In particular, it focuses on combination networks where each of the $K = \\binom{H}{r}$ users is connected to a distinct $r$-subsets of relays. By leveraging the symmetric topology of the network, this paper proposes a novel method to general multicast messages and to deliver them to th","authors_text":"Daniela Tuninetti, Kai Wan, Mingyue Ji, Pablo Piantanida","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-18T14:32:58Z","title":"Caching in Combination Networks: Novel Multicast Message Generation and Delivery by Leveraging the Network Topology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06752","kind":"arxiv","version":2},"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:76a61db4770a79c81bafc40a6e5abbff33dbc9d49b82ade888dbf0e892d8cfb5","target":"record","created_at":"2026-05-18T00:19:13Z","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":"459508ff08e38bb09133c161eb59e03bff101f04f6ef33e02a355f8bc1673a7f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-18T14:32:58Z","title_canon_sha256":"9300bb5f5837ea3f6066c7a8d43dc3f629e3fc22b85e7ac755e8406179f20f8b"},"schema_version":"1.0","source":{"id":"1710.06752","kind":"arxiv","version":2}},"canonical_sha256":"00a80345df07ad827cb5a430d9673b26e9226d9020b88e8122189fdb0c774655","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00a80345df07ad827cb5a430d9673b26e9226d9020b88e8122189fdb0c774655","first_computed_at":"2026-05-18T00:19:13.685997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:13.685997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sypbdAwgUXZ9tzHEn9ADUlTuKXNXlZG22NSLhp5Jfk1e0R40CLMVbPlL0MnWZnQq7pzAISiLB6odcqUCoF5fAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:13.686641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06752","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76a61db4770a79c81bafc40a6e5abbff33dbc9d49b82ade888dbf0e892d8cfb5","sha256:db32512558abd9ad85a0fdcaa32f756445b5dd104e29119478da0fecbea9e878"],"state_sha256":"6d872b5bb3cbca49f35d8951e27ba3cf5d28eb5d5eb0bb97f385b12390d73357"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lg+yEVIBP0nqdTxnzwF/5AauXgGxe/xUgcl9GRUxfJ9ruceeC2WM4RjFFHxn6kLMzv+vLnJCG+C0+Wv0LvOrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:20:48.241056Z","bundle_sha256":"a03c52940dff9cbf8bc50a8e6303a37437d5ff08a03cf7ef72b67b7f98c0bb69"}}