{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BNFUOTRIBBM77TS74L4IUFZG3A","short_pith_number":"pith:BNFUOTRI","canonical_record":{"source":{"id":"1704.04146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T14:16:45Z","cross_cats_sorted":[],"title_canon_sha256":"87ab84f6a5940fa8d8ec4303c015ec3176fdc30969e9921f94c70180345355f6","abstract_canon_sha256":"a68dd04a39e68b3c7f60135744b7ca87d00cc1842ef356ed5dee5e120110d4ab"},"schema_version":"1.0"},"canonical_sha256":"0b4b474e280859ffce5fe2f88a1726d83ac299e275891d51b129cd4e977b02e7","source":{"kind":"arxiv","id":"1704.04146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04146","created_at":"2026-05-18T00:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04146v1","created_at":"2026-05-18T00:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04146","created_at":"2026-05-18T00:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"BNFUOTRIBBM7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BNFUOTRIBBM77TS7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BNFUOTRI","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BNFUOTRIBBM77TS74L4IUFZG3A","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T14:16:45Z","cross_cats_sorted":[],"title_canon_sha256":"87ab84f6a5940fa8d8ec4303c015ec3176fdc30969e9921f94c70180345355f6","abstract_canon_sha256":"a68dd04a39e68b3c7f60135744b7ca87d00cc1842ef356ed5dee5e120110d4ab"},"schema_version":"1.0"},"canonical_sha256":"0b4b474e280859ffce5fe2f88a1726d83ac299e275891d51b129cd4e977b02e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:24.768092Z","signature_b64":"U6K7mqH2C0zdaCkHsczPoa/uwu05yh2V48gP6F8AUDrSn3uoxK19UBqCfPvcYgJuAOWWMqTsVrlFr+f5OEwgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b4b474e280859ffce5fe2f88a1726d83ac299e275891d51b129cd4e977b02e7","last_reissued_at":"2026-05-18T00:46:24.767501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:24.767501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04146","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:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQjmHNZsQaPak+iPwGTRwlycKkAa83aeBxcZVgz8eerXCH1frD42a2CfywJFqZAJiDbFdlf1UhHauuWgv646AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:37:17.515876Z"},"content_sha256":"b562b9edde39abe31e0615834c433e364c39af7d8666796c6d8dd50a55370022","schema_version":"1.0","event_id":"sha256:b562b9edde39abe31e0615834c433e364c39af7d8666796c6d8dd50a55370022"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BNFUOTRIBBM77TS74L4IUFZG3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Traffic Minimizing Caching and Latent Variable Distributions of Order Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Camilla Hollanti, Joonas P\\\"a\\\"akk\\\"onen, Olav Tirkkonen, Prathapasinghe Dharmawansa, Ragnar Freij-Hollanti","submitted_at":"2017-04-13T14:16:45Z","abstract_excerpt":"Given a statistical model for the request frequencies and sizes of data objects in a caching system, we derive the probability density of the size of the file that accounts for the largest amount of data traffic. This is equivalent to finding the required size of the cache for a caching placement that maximizes the expected byte hit ratio for given file size and popularity distributions. The file that maximizes the expected byte hit ratio is the file for which the product of its size and popularity is the highest -- thus, it is the file that incurs the greatest load on the network. We generali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04146","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:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rAE8IJwd01XOdNE+JUJdfJCYoQvEnaBr0T4dzjIgx/UR9Or4EBG2L9r+xxE9DJEOZimhrydJRVLjlf3er6VDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:37:17.516549Z"},"content_sha256":"adac1a809e564a76b9a350d336ec5f9893c31b14f4dd4c1455571d1722ba0e14","schema_version":"1.0","event_id":"sha256:adac1a809e564a76b9a350d336ec5f9893c31b14f4dd4c1455571d1722ba0e14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNFUOTRIBBM77TS74L4IUFZG3A/bundle.json","state_url":"https://pith.science/pith/BNFUOTRIBBM77TS74L4IUFZG3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNFUOTRIBBM77TS74L4IUFZG3A/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-29T17:37:17Z","links":{"resolver":"https://pith.science/pith/BNFUOTRIBBM77TS74L4IUFZG3A","bundle":"https://pith.science/pith/BNFUOTRIBBM77TS74L4IUFZG3A/bundle.json","state":"https://pith.science/pith/BNFUOTRIBBM77TS74L4IUFZG3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNFUOTRIBBM77TS74L4IUFZG3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BNFUOTRIBBM77TS74L4IUFZG3A","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":"a68dd04a39e68b3c7f60135744b7ca87d00cc1842ef356ed5dee5e120110d4ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T14:16:45Z","title_canon_sha256":"87ab84f6a5940fa8d8ec4303c015ec3176fdc30969e9921f94c70180345355f6"},"schema_version":"1.0","source":{"id":"1704.04146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04146","created_at":"2026-05-18T00:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04146v1","created_at":"2026-05-18T00:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04146","created_at":"2026-05-18T00:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"BNFUOTRIBBM7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BNFUOTRIBBM77TS7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BNFUOTRI","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:adac1a809e564a76b9a350d336ec5f9893c31b14f4dd4c1455571d1722ba0e14","target":"graph","created_at":"2026-05-18T00:46:24Z","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":"Given a statistical model for the request frequencies and sizes of data objects in a caching system, we derive the probability density of the size of the file that accounts for the largest amount of data traffic. This is equivalent to finding the required size of the cache for a caching placement that maximizes the expected byte hit ratio for given file size and popularity distributions. The file that maximizes the expected byte hit ratio is the file for which the product of its size and popularity is the highest -- thus, it is the file that incurs the greatest load on the network. We generali","authors_text":"Camilla Hollanti, Joonas P\\\"a\\\"akk\\\"onen, Olav Tirkkonen, Prathapasinghe Dharmawansa, Ragnar Freij-Hollanti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T14:16:45Z","title":"Traffic Minimizing Caching and Latent Variable Distributions of Order Statistics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04146","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:b562b9edde39abe31e0615834c433e364c39af7d8666796c6d8dd50a55370022","target":"record","created_at":"2026-05-18T00:46:24Z","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":"a68dd04a39e68b3c7f60135744b7ca87d00cc1842ef356ed5dee5e120110d4ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T14:16:45Z","title_canon_sha256":"87ab84f6a5940fa8d8ec4303c015ec3176fdc30969e9921f94c70180345355f6"},"schema_version":"1.0","source":{"id":"1704.04146","kind":"arxiv","version":1}},"canonical_sha256":"0b4b474e280859ffce5fe2f88a1726d83ac299e275891d51b129cd4e977b02e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b4b474e280859ffce5fe2f88a1726d83ac299e275891d51b129cd4e977b02e7","first_computed_at":"2026-05-18T00:46:24.767501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:24.767501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U6K7mqH2C0zdaCkHsczPoa/uwu05yh2V48gP6F8AUDrSn3uoxK19UBqCfPvcYgJuAOWWMqTsVrlFr+f5OEwgAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:24.768092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b562b9edde39abe31e0615834c433e364c39af7d8666796c6d8dd50a55370022","sha256:adac1a809e564a76b9a350d336ec5f9893c31b14f4dd4c1455571d1722ba0e14"],"state_sha256":"35decb053ae441c687b8b178a6ee9c3f036ffe826cf21ed7a7693cf89e940e72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ZJcbkacPTaES79Sq8gtwN5xl/XEcrLDGXFjRdpHhydLqBLXpJzZbr+3vSA9l/GUewh0BQu7XIyr3dxtcibmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:37:17.520742Z","bundle_sha256":"31be4b194e5d47fdbd816354cab2b2afcc0f9a1a3a14e6b076307a674a3e1701"}}