{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ULLLP6Q37P2LCNNOOGVKCWNGHD","short_pith_number":"pith:ULLLP6Q3","canonical_record":{"source":{"id":"1808.09824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-28T15:29:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3cbf0a988195544ddb644c7b6bc2a09297483235bf20f500934786ac35d59281","abstract_canon_sha256":"06e22c20b1795f74bb6b3b53490cee571bcadae3ec25e7757f225f54d82a7345"},"schema_version":"1.0"},"canonical_sha256":"a2d6b7fa1bfbf4b135ae71aaa159a638e6d1f27633dcea519d83f63028ed6189","source":{"kind":"arxiv","id":"1808.09824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09824","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09824v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09824","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"ULLLP6Q37P2L","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"ULLLP6Q37P2LCNNO","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"ULLLP6Q3","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ULLLP6Q37P2LCNNOOGVKCWNGHD","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-28T15:29:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3cbf0a988195544ddb644c7b6bc2a09297483235bf20f500934786ac35d59281","abstract_canon_sha256":"06e22c20b1795f74bb6b3b53490cee571bcadae3ec25e7757f225f54d82a7345"},"schema_version":"1.0"},"canonical_sha256":"a2d6b7fa1bfbf4b135ae71aaa159a638e6d1f27633dcea519d83f63028ed6189","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:54.349599Z","signature_b64":"gmGX8UG2RwrodT2tGD3N61f7bxKHo3FOUgKD79diNG92eQg2KDUBbYSJWz9MioVALwMXSNytIjJP/sr6MM7MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2d6b7fa1bfbf4b135ae71aaa159a638e6d1f27633dcea519d83f63028ed6189","last_reissued_at":"2026-05-18T00:06:54.348875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:54.348875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09824","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:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcP3VHeKOCdj59fBcWsCrD0kOPnevkECBZTFwnM8EWbxyEmg8bn+dgiMyfept6zeH9+gI0hbOj4svWkmrvS3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:46:05.879462Z"},"content_sha256":"1418c3ae44f154faccac454b0c713c4d12f0d607bdf7ca8458184f527af042fb","schema_version":"1.0","event_id":"sha256:1418c3ae44f154faccac454b0c713c4d12f0d607bdf7ca8458184f527af042fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ULLLP6Q37P2LCNNOOGVKCWNGHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge Caching for Cache Intensity under Probabilistic Delay Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Matti Latva-aho, Nandana Rajatheva, Sudarshan Guruacharya, Tachporn Sanguanpuak","submitted_at":"2018-08-28T15:29:01Z","abstract_excerpt":"In order to reduce the latency of data delivery, one of techniques is to cache the popular contents at the base stations (BSs) i.e. edge caching. However, the technique of caching at edge can only reduce the backhaul delay, other techniques such as BS densification will also need to be considered to reduce the fronthaul delay. In this work, we study the trade-offs between BS densification and cache size under delay constraint at a typical user (UE). For this, we use the downlink SINR coverage probability and throughput obtained based on stochastic geometrical analysis. The network deployment o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09824","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:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b63/0QlXSzyn0eDstadKAgTVh8ZgLnlbNGJentdKxNs7+T01RR2IdIU0A/oh7d+VgbxRPYwPdPLYfBvsDcvrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:46:05.879811Z"},"content_sha256":"c5e0f8a1f54ea5347f51e8ca6f6c29bf403b4f528743a0d801b3bb0aa446e575","schema_version":"1.0","event_id":"sha256:c5e0f8a1f54ea5347f51e8ca6f6c29bf403b4f528743a0d801b3bb0aa446e575"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULLLP6Q37P2LCNNOOGVKCWNGHD/bundle.json","state_url":"https://pith.science/pith/ULLLP6Q37P2LCNNOOGVKCWNGHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULLLP6Q37P2LCNNOOGVKCWNGHD/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-07-05T15:46:05Z","links":{"resolver":"https://pith.science/pith/ULLLP6Q37P2LCNNOOGVKCWNGHD","bundle":"https://pith.science/pith/ULLLP6Q37P2LCNNOOGVKCWNGHD/bundle.json","state":"https://pith.science/pith/ULLLP6Q37P2LCNNOOGVKCWNGHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULLLP6Q37P2LCNNOOGVKCWNGHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ULLLP6Q37P2LCNNOOGVKCWNGHD","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":"06e22c20b1795f74bb6b3b53490cee571bcadae3ec25e7757f225f54d82a7345","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-28T15:29:01Z","title_canon_sha256":"3cbf0a988195544ddb644c7b6bc2a09297483235bf20f500934786ac35d59281"},"schema_version":"1.0","source":{"id":"1808.09824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09824","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09824v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09824","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"ULLLP6Q37P2L","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"ULLLP6Q37P2LCNNO","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"ULLLP6Q3","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:c5e0f8a1f54ea5347f51e8ca6f6c29bf403b4f528743a0d801b3bb0aa446e575","target":"graph","created_at":"2026-05-18T00:06:54Z","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":"In order to reduce the latency of data delivery, one of techniques is to cache the popular contents at the base stations (BSs) i.e. edge caching. However, the technique of caching at edge can only reduce the backhaul delay, other techniques such as BS densification will also need to be considered to reduce the fronthaul delay. In this work, we study the trade-offs between BS densification and cache size under delay constraint at a typical user (UE). For this, we use the downlink SINR coverage probability and throughput obtained based on stochastic geometrical analysis. The network deployment o","authors_text":"Matti Latva-aho, Nandana Rajatheva, Sudarshan Guruacharya, Tachporn Sanguanpuak","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-28T15:29:01Z","title":"Edge Caching for Cache Intensity under Probabilistic Delay Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09824","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:1418c3ae44f154faccac454b0c713c4d12f0d607bdf7ca8458184f527af042fb","target":"record","created_at":"2026-05-18T00:06:54Z","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":"06e22c20b1795f74bb6b3b53490cee571bcadae3ec25e7757f225f54d82a7345","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-28T15:29:01Z","title_canon_sha256":"3cbf0a988195544ddb644c7b6bc2a09297483235bf20f500934786ac35d59281"},"schema_version":"1.0","source":{"id":"1808.09824","kind":"arxiv","version":1}},"canonical_sha256":"a2d6b7fa1bfbf4b135ae71aaa159a638e6d1f27633dcea519d83f63028ed6189","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2d6b7fa1bfbf4b135ae71aaa159a638e6d1f27633dcea519d83f63028ed6189","first_computed_at":"2026-05-18T00:06:54.348875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:54.348875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gmGX8UG2RwrodT2tGD3N61f7bxKHo3FOUgKD79diNG92eQg2KDUBbYSJWz9MioVALwMXSNytIjJP/sr6MM7MDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:54.349599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1418c3ae44f154faccac454b0c713c4d12f0d607bdf7ca8458184f527af042fb","sha256:c5e0f8a1f54ea5347f51e8ca6f6c29bf403b4f528743a0d801b3bb0aa446e575"],"state_sha256":"c98a042446ba4a4873157f976b3af7f61a634838bfec0ca125a22fc5c7200335"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qa5507/u9wCpjCqpzgHYTpMd22zslQVYWL+uTdUFWnOvBrLvJr8oNOGPwUwp8AXGJ+whZlXJoEGCVfJFpPoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:46:05.881975Z","bundle_sha256":"2340301fdd8f0a77fbf2d85bfdd3468b4223efbfa72f86a037d0f9a4c78303bb"}}