{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GU6E3T3NSJQ7VU33HPPF7ETNVS","short_pith_number":"pith:GU6E3T3N","canonical_record":{"source":{"id":"1501.02549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-12T06:09:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6a7bef12628538858c0f65a678831e2c8f182a811adee88801f9bf6525a5e5f8","abstract_canon_sha256":"cb31b86695dd74772176b1955e2e236bf4fe5704f3ff8bbcf545da66954305c6"},"schema_version":"1.0"},"canonical_sha256":"353c4dcf6d9261fad37b3bde5f926dacb2be31e8375094d479e034faee11b58b","source":{"kind":"arxiv","id":"1501.02549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02549","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02549v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02549","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"GU6E3T3NSJQ7","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GU6E3T3NSJQ7VU33","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GU6E3T3N","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GU6E3T3NSJQ7VU33HPPF7ETNVS","target":"record","payload":{"canonical_record":{"source":{"id":"1501.02549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-12T06:09:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6a7bef12628538858c0f65a678831e2c8f182a811adee88801f9bf6525a5e5f8","abstract_canon_sha256":"cb31b86695dd74772176b1955e2e236bf4fe5704f3ff8bbcf545da66954305c6"},"schema_version":"1.0"},"canonical_sha256":"353c4dcf6d9261fad37b3bde5f926dacb2be31e8375094d479e034faee11b58b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:37.694398Z","signature_b64":"pBX/VkZnoItpV63XAbSONQ7KEnG8GeEprsyDM7v7lelF3J11qIWxXy9w6DcK7aza6EC/ZQauhIC6AJBFUa86CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"353c4dcf6d9261fad37b3bde5f926dacb2be31e8375094d479e034faee11b58b","last_reissued_at":"2026-05-18T02:29:37.693944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:37.693944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.02549","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-18T02:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljpINJiBI86XShIPCk4aybr85+vj2u6OJMJvRAZuigzKpXYTSp4AfbbKsGBlLUk/C8FcKgWfJ86atvUqvxRZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:14:05.749310Z"},"content_sha256":"3710a48b64ab80569f57e8be5c9d4c955835461d54ea5a78270dd80ec08966d4","schema_version":"1.0","event_id":"sha256:3710a48b64ab80569f57e8be5c9d4c955835461d54ea5a78270dd80ec08966d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GU6E3T3NSJQ7VU33HPPF7ETNVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Critical Database Size for Effective Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ajaykrishnan N., Navya S. Prem, Rahul Vaze, Vinod M. Prabhakaran","submitted_at":"2015-01-12T06:09:03Z","abstract_excerpt":"Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the performance gain of caching was thought to result from making part of the requested data available closer to end users. Recently, it has been shown that by using a carefully designed technique to store the contents in the cache and coding across data streams a much more significant gain can be achieved in reducing the network load. Inner and outer bounds on the network load v/s cache memory tradeoff were obtained in (Maddah-Ali and Niesen, 2012). We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02549","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-18T02:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USMciL1549Yl41bpMORR82i3mUwMleTGMSt+nHW6PBJ9vngmp/WkdLFhOvbyuiMPuHziMF4KTx5TGBn/z+gFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:14:05.750128Z"},"content_sha256":"294ffce88694a0155f8daed35574ae955d323022e568b23e50f123f64c6707c8","schema_version":"1.0","event_id":"sha256:294ffce88694a0155f8daed35574ae955d323022e568b23e50f123f64c6707c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GU6E3T3NSJQ7VU33HPPF7ETNVS/bundle.json","state_url":"https://pith.science/pith/GU6E3T3NSJQ7VU33HPPF7ETNVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GU6E3T3NSJQ7VU33HPPF7ETNVS/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-10T12:14:05Z","links":{"resolver":"https://pith.science/pith/GU6E3T3NSJQ7VU33HPPF7ETNVS","bundle":"https://pith.science/pith/GU6E3T3NSJQ7VU33HPPF7ETNVS/bundle.json","state":"https://pith.science/pith/GU6E3T3NSJQ7VU33HPPF7ETNVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GU6E3T3NSJQ7VU33HPPF7ETNVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GU6E3T3NSJQ7VU33HPPF7ETNVS","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":"cb31b86695dd74772176b1955e2e236bf4fe5704f3ff8bbcf545da66954305c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-12T06:09:03Z","title_canon_sha256":"6a7bef12628538858c0f65a678831e2c8f182a811adee88801f9bf6525a5e5f8"},"schema_version":"1.0","source":{"id":"1501.02549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02549","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02549v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02549","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"GU6E3T3NSJQ7","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GU6E3T3NSJQ7VU33","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GU6E3T3N","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:294ffce88694a0155f8daed35574ae955d323022e568b23e50f123f64c6707c8","target":"graph","created_at":"2026-05-18T02:29:37Z","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":"Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the performance gain of caching was thought to result from making part of the requested data available closer to end users. Recently, it has been shown that by using a carefully designed technique to store the contents in the cache and coding across data streams a much more significant gain can be achieved in reducing the network load. Inner and outer bounds on the network load v/s cache memory tradeoff were obtained in (Maddah-Ali and Niesen, 2012). We","authors_text":"Ajaykrishnan N., Navya S. Prem, Rahul Vaze, Vinod M. Prabhakaran","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-12T06:09:03Z","title":"Critical Database Size for Effective Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02549","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:3710a48b64ab80569f57e8be5c9d4c955835461d54ea5a78270dd80ec08966d4","target":"record","created_at":"2026-05-18T02:29:37Z","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":"cb31b86695dd74772176b1955e2e236bf4fe5704f3ff8bbcf545da66954305c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-12T06:09:03Z","title_canon_sha256":"6a7bef12628538858c0f65a678831e2c8f182a811adee88801f9bf6525a5e5f8"},"schema_version":"1.0","source":{"id":"1501.02549","kind":"arxiv","version":1}},"canonical_sha256":"353c4dcf6d9261fad37b3bde5f926dacb2be31e8375094d479e034faee11b58b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"353c4dcf6d9261fad37b3bde5f926dacb2be31e8375094d479e034faee11b58b","first_computed_at":"2026-05-18T02:29:37.693944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:37.693944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pBX/VkZnoItpV63XAbSONQ7KEnG8GeEprsyDM7v7lelF3J11qIWxXy9w6DcK7aza6EC/ZQauhIC6AJBFUa86CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:37.694398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3710a48b64ab80569f57e8be5c9d4c955835461d54ea5a78270dd80ec08966d4","sha256:294ffce88694a0155f8daed35574ae955d323022e568b23e50f123f64c6707c8"],"state_sha256":"d718729e2512463e03d193996cc5dedab56d1bf8e05c3a3c3921b9b054044f50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bbbJHgN7rkX/tbsbbcdaik1NITcP/b1KJ44lcQ22PzGG0iXVc39+0tYB/+1E8kM/CctqrmAwbcDPDoj7HUFvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:14:05.754274Z","bundle_sha256":"4d811feeccf934187475c3f334464149dd61b9ed64d82e72ecd13721b271b927"}}