{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XK5TBAVU5B7HCPGSQVBX5XPTET","short_pith_number":"pith:XK5TBAVU","canonical_record":{"source":{"id":"1802.10474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-28T15:22:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"614c2507d5ab852f0e4025a1e0eecbb9e0fbe961b0c0aa16ed621be6da2c2ccc","abstract_canon_sha256":"4f057e36c96f564da26e03c4586475ef54357614ad522485107a22835ad11409"},"schema_version":"1.0"},"canonical_sha256":"babb3082b4e87e713cd285437eddf324c437a7d184c0716df1158cf43c452f89","source":{"kind":"arxiv","id":"1802.10474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10474","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10474v1","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10474","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"XK5TBAVU5B7H","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XK5TBAVU5B7HCPGS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XK5TBAVU","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XK5TBAVU5B7HCPGSQVBX5XPTET","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-28T15:22:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"614c2507d5ab852f0e4025a1e0eecbb9e0fbe961b0c0aa16ed621be6da2c2ccc","abstract_canon_sha256":"4f057e36c96f564da26e03c4586475ef54357614ad522485107a22835ad11409"},"schema_version":"1.0"},"canonical_sha256":"babb3082b4e87e713cd285437eddf324c437a7d184c0716df1158cf43c452f89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:17.055000Z","signature_b64":"9OylCWTv0LQRnEZ3AI0MfCfWIU+vlkctqRELSaNKnR8/il2hADnRYbhrKOOzn74JX4/6mxiBVcnGVE74MHxiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"babb3082b4e87e713cd285437eddf324c437a7d184c0716df1158cf43c452f89","last_reissued_at":"2026-05-18T00:22:17.054367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:17.054367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10474","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:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cc8eNwHYgGSwH6YsP9gdMGyPDQozZhFA3kdcb+BA17V9ERK9EPhb4qKL+nHorK2SYcr4K2Wwc+8oEMVI1a5UDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:04:42.720059Z"},"content_sha256":"d0b698b947c2fcacf47336834d7409c9c9f6ab73dc5af0b3554afe8af044a2a0","schema_version":"1.0","event_id":"sha256:d0b698b947c2fcacf47336834d7409c9c9f6ab73dc5af0b3554afe8af044a2a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XK5TBAVU5B7HCPGSQVBX5XPTET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User Caches","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":"2018-02-28T15:22:44Z","abstract_excerpt":"This paper investigates the fundamental tradeoff between cache size and download time in the (H;r;M;N) combination network, where a server with N files is connected to H relays (without caches) and each of the K:=\\binom{H}{r} users (with caches of size M files) is connected to a different subset of r relays. Existing schemes fall within two categories: either use the uncoded symmetric cache placement originally proposed for the shared-link model and design delivery phase dependent on the network topology, or effectively divide the combination network into H independent shared-link networks eac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10474","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:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1UcqPLEvn4ZmwCsgn0kPGMjrfGY8qHthpcjpgiJGdfSuuMfOpUmpkTew5w7QmYFPs5FbgxKOJkCL6/CzIdDTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:04:42.720762Z"},"content_sha256":"69631e3e79c4227de6205d7b31ad2ef8cb1a85b261243c02697b6704595a77aa","schema_version":"1.0","event_id":"sha256:69631e3e79c4227de6205d7b31ad2ef8cb1a85b261243c02697b6704595a77aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/bundle.json","state_url":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/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-23T22:04:42Z","links":{"resolver":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET","bundle":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/bundle.json","state":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XK5TBAVU5B7HCPGSQVBX5XPTET","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":"4f057e36c96f564da26e03c4586475ef54357614ad522485107a22835ad11409","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-28T15:22:44Z","title_canon_sha256":"614c2507d5ab852f0e4025a1e0eecbb9e0fbe961b0c0aa16ed621be6da2c2ccc"},"schema_version":"1.0","source":{"id":"1802.10474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10474","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10474v1","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10474","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"XK5TBAVU5B7H","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XK5TBAVU5B7HCPGS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XK5TBAVU","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:69631e3e79c4227de6205d7b31ad2ef8cb1a85b261243c02697b6704595a77aa","target":"graph","created_at":"2026-05-18T00:22:17Z","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 investigates the fundamental tradeoff between cache size and download time in the (H;r;M;N) combination network, where a server with N files is connected to H relays (without caches) and each of the K:=\\binom{H}{r} users (with caches of size M files) is connected to a different subset of r relays. Existing schemes fall within two categories: either use the uncoded symmetric cache placement originally proposed for the shared-link model and design delivery phase dependent on the network topology, or effectively divide the combination network into H independent shared-link networks eac","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":"2018-02-28T15:22:44Z","title":"On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User Caches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10474","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:d0b698b947c2fcacf47336834d7409c9c9f6ab73dc5af0b3554afe8af044a2a0","target":"record","created_at":"2026-05-18T00:22:17Z","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":"4f057e36c96f564da26e03c4586475ef54357614ad522485107a22835ad11409","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-28T15:22:44Z","title_canon_sha256":"614c2507d5ab852f0e4025a1e0eecbb9e0fbe961b0c0aa16ed621be6da2c2ccc"},"schema_version":"1.0","source":{"id":"1802.10474","kind":"arxiv","version":1}},"canonical_sha256":"babb3082b4e87e713cd285437eddf324c437a7d184c0716df1158cf43c452f89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"babb3082b4e87e713cd285437eddf324c437a7d184c0716df1158cf43c452f89","first_computed_at":"2026-05-18T00:22:17.054367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:17.054367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9OylCWTv0LQRnEZ3AI0MfCfWIU+vlkctqRELSaNKnR8/il2hADnRYbhrKOOzn74JX4/6mxiBVcnGVE74MHxiBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:17.055000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0b698b947c2fcacf47336834d7409c9c9f6ab73dc5af0b3554afe8af044a2a0","sha256:69631e3e79c4227de6205d7b31ad2ef8cb1a85b261243c02697b6704595a77aa"],"state_sha256":"3714e5cbc41d7f9dd2bcecc9f9abb31001c4d9aac594ce794d82fe59b70ee6e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JVmZsIetjf8mXUJ2jFGo4NCYP88JfL6I2knLoDFmdV/JyZ/ZQcs/TuxPlxBs5+BaT2QsOMYVFWFl/yNHDWVeDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T22:04:42.723749Z","bundle_sha256":"23fa885c4ddbc0eb388377455c6062f205665a759aaefd0a1f28ad97caa88e91"}}