{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WPFRMUVJZXESFRZNSJA6J4YGAO","short_pith_number":"pith:WPFRMUVJ","canonical_record":{"source":{"id":"1702.04563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T11:53:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd67069f1085ffa200ac67ee221e7a21d06a8a67dbaba08714f9a449ce67e26d","abstract_canon_sha256":"8ae2941d0cdf6d33fb38fd3f245a5394817b54f876acd7e155cbcd5acf38dcaf"},"schema_version":"1.0"},"canonical_sha256":"b3cb1652a9cdc922c72d9241e4f30603b00a554eb027ae69f18bfc645606a4e8","source":{"kind":"arxiv","id":"1702.04563","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04563","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04563v2","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04563","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"pith_short_12","alias_value":"WPFRMUVJZXES","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WPFRMUVJZXESFRZN","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WPFRMUVJ","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WPFRMUVJZXESFRZNSJA6J4YGAO","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T11:53:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd67069f1085ffa200ac67ee221e7a21d06a8a67dbaba08714f9a449ce67e26d","abstract_canon_sha256":"8ae2941d0cdf6d33fb38fd3f245a5394817b54f876acd7e155cbcd5acf38dcaf"},"schema_version":"1.0"},"canonical_sha256":"b3cb1652a9cdc922c72d9241e4f30603b00a554eb027ae69f18bfc645606a4e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:48.551296Z","signature_b64":"ifsGuHJnAm/6FtXqLKimXz97x9TybgszZZKpFsgxqietvEMWdr+db/l0me10qlCteQBoyUttlEI4RPy6uBc+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3cb1652a9cdc922c72d9241e4f30603b00a554eb027ae69f18bfc645606a4e8","last_reissued_at":"2026-05-18T00:06:48.550607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:48.550607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04563","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:06:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLoAy8MIa6hNaQkTWJBwg+P0KgM1dCskYuDKYuujlKh/YK5qNU1wZQEgzvXJdf7mJfKERVUDLR0l/4HwEBOQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:37:06.892486Z"},"content_sha256":"e384a8467aa9f0c74a18a6028c560ebde38cc041e18a8d8aaca61abfd9712df8","schema_version":"1.0","event_id":"sha256:e384a8467aa9f0c74a18a6028c560ebde38cc041e18a8d8aaca61abfd9712df8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WPFRMUVJZXESFRZNSJA6J4YGAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing the Rate-Memory Tradeoff in Cache Networks within a Factor of 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu","submitted_at":"2017-02-15T11:53:47Z","abstract_excerpt":"We consider a basic caching system, where a single server with a database of $N$ files (e.g. movies) is connected to a set of $K$ users through a shared bottleneck link. Each user has a local cache memory with a size of $M$ files. The system operates in two phases: a placement phase, where each cache memory is populated up to its size from the database, and a following delivery phase, where each user requests a file from the database, and the server is responsible for delivering the requested contents. The objective is to design the two phases to minimize the load (peak or average) of the bott"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04563","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:06:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTGYc+BYwjMBrNHlfmbKkzQTcmPZlOVDQTImF5ja9Az/jnfmSon0mZwRC4Ree8PuWNO2SI3HKPbbvKFhgwcJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:37:06.893221Z"},"content_sha256":"0f688deea64a3a66e490af9e132985f9fca34e6322fc93ca52ced04b23c257bb","schema_version":"1.0","event_id":"sha256:0f688deea64a3a66e490af9e132985f9fca34e6322fc93ca52ced04b23c257bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPFRMUVJZXESFRZNSJA6J4YGAO/bundle.json","state_url":"https://pith.science/pith/WPFRMUVJZXESFRZNSJA6J4YGAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPFRMUVJZXESFRZNSJA6J4YGAO/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-28T13:37:06Z","links":{"resolver":"https://pith.science/pith/WPFRMUVJZXESFRZNSJA6J4YGAO","bundle":"https://pith.science/pith/WPFRMUVJZXESFRZNSJA6J4YGAO/bundle.json","state":"https://pith.science/pith/WPFRMUVJZXESFRZNSJA6J4YGAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPFRMUVJZXESFRZNSJA6J4YGAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WPFRMUVJZXESFRZNSJA6J4YGAO","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":"8ae2941d0cdf6d33fb38fd3f245a5394817b54f876acd7e155cbcd5acf38dcaf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T11:53:47Z","title_canon_sha256":"fd67069f1085ffa200ac67ee221e7a21d06a8a67dbaba08714f9a449ce67e26d"},"schema_version":"1.0","source":{"id":"1702.04563","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04563","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04563v2","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04563","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"pith_short_12","alias_value":"WPFRMUVJZXES","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WPFRMUVJZXESFRZN","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WPFRMUVJ","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:0f688deea64a3a66e490af9e132985f9fca34e6322fc93ca52ced04b23c257bb","target":"graph","created_at":"2026-05-18T00:06:48Z","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":"We consider a basic caching system, where a single server with a database of $N$ files (e.g. movies) is connected to a set of $K$ users through a shared bottleneck link. Each user has a local cache memory with a size of $M$ files. The system operates in two phases: a placement phase, where each cache memory is populated up to its size from the database, and a following delivery phase, where each user requests a file from the database, and the server is responsible for delivering the requested contents. The objective is to design the two phases to minimize the load (peak or average) of the bott","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T11:53:47Z","title":"Characterizing the Rate-Memory Tradeoff in Cache Networks within a Factor of 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04563","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:e384a8467aa9f0c74a18a6028c560ebde38cc041e18a8d8aaca61abfd9712df8","target":"record","created_at":"2026-05-18T00:06:48Z","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":"8ae2941d0cdf6d33fb38fd3f245a5394817b54f876acd7e155cbcd5acf38dcaf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T11:53:47Z","title_canon_sha256":"fd67069f1085ffa200ac67ee221e7a21d06a8a67dbaba08714f9a449ce67e26d"},"schema_version":"1.0","source":{"id":"1702.04563","kind":"arxiv","version":2}},"canonical_sha256":"b3cb1652a9cdc922c72d9241e4f30603b00a554eb027ae69f18bfc645606a4e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3cb1652a9cdc922c72d9241e4f30603b00a554eb027ae69f18bfc645606a4e8","first_computed_at":"2026-05-18T00:06:48.550607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:48.550607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ifsGuHJnAm/6FtXqLKimXz97x9TybgszZZKpFsgxqietvEMWdr+db/l0me10qlCteQBoyUttlEI4RPy6uBc+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:48.551296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04563","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e384a8467aa9f0c74a18a6028c560ebde38cc041e18a8d8aaca61abfd9712df8","sha256:0f688deea64a3a66e490af9e132985f9fca34e6322fc93ca52ced04b23c257bb"],"state_sha256":"77c1ffab7263123ea5664d250358349ca604cdd38f89f30144dc39f8187034a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkqj2xQctLVuabE2RtknJhjpU3hrLsIzNxYGYzRKsl81kd+nd7NJqE7hvqQKa2VpYADUyIrj0SluS0lnFsirAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:37:06.897039Z","bundle_sha256":"da8f48a8115d0144b17183a7b9bc5d267ad71db35b7ddab9929621e8a2af8968"}}