{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RG6SFCLPPT2GFZKYOXWDR2J52F","short_pith_number":"pith:RG6SFCLP","canonical_record":{"source":{"id":"1807.01093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-03T11:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"23b9c7f607a0ed8dee7b2b90b48e49aeca5c94ebd6aab5741d0d928a43e8e405","abstract_canon_sha256":"7dd807143a7cf9872cb31fcf15d9ddb27e22b81bf67d722ff8490b4aef0d0efd"},"schema_version":"1.0"},"canonical_sha256":"89bd22896f7cf462e55875ec38e93dd170de0e3a29d9886eb919c770a695451a","source":{"kind":"arxiv","id":"1807.01093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01093","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01093v1","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01093","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"RG6SFCLPPT2G","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RG6SFCLPPT2GFZKY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RG6SFCLP","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RG6SFCLPPT2GFZKYOXWDR2J52F","target":"record","payload":{"canonical_record":{"source":{"id":"1807.01093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-03T11:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"23b9c7f607a0ed8dee7b2b90b48e49aeca5c94ebd6aab5741d0d928a43e8e405","abstract_canon_sha256":"7dd807143a7cf9872cb31fcf15d9ddb27e22b81bf67d722ff8490b4aef0d0efd"},"schema_version":"1.0"},"canonical_sha256":"89bd22896f7cf462e55875ec38e93dd170de0e3a29d9886eb919c770a695451a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:45.370458Z","signature_b64":"n4s4NQcsqgjo59D3UmJq92PRrbjdRZywvYYAFSY3JM4jrh8Dvb6k9bXeuMBeKQxfaeDTBqY2A1XVDFttijnjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89bd22896f7cf462e55875ec38e93dd170de0e3a29d9886eb919c770a695451a","last_reissued_at":"2026-05-18T00:11:45.369714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:45.369714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.01093","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:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l6w1NY9htNm/Um8dSk6f0+sggAGyzYrI7SWP3NzhEYiDGm1hyoWv76xv9f7I99AID4rtcZ2nMYHJoYhOdHpzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:49:43.168622Z"},"content_sha256":"dbd5169cfc6809cffca095896dd598e203819c239c59a9ea3d32b6ee5d10202b","schema_version":"1.0","event_id":"sha256:dbd5169cfc6809cffca095896dd598e203819c239c59a9ea3d32b6ee5d10202b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RG6SFCLPPT2GFZKYOXWDR2J52F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Capacity Provisioning for Fog Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abbas Kiani, Abdallah Khreishah, Nirwan Ansari","submitted_at":"2018-07-03T11:37:09Z","abstract_excerpt":"The concept of fog computing is centered around providing computation resources at the edge of network, thereby reducing the latency and improving the quality of service. However, it is still desirable to investigate how and where at the edge of the network the computation capacity should be provisioned. To this end, we propose a hierarchical capacity provisioning scheme. In particular, we consider a two-tier network architecture consisting of shallow and deep cloudlets and explore the benefits of hierarchical capacity based on queueing analysis. Moreover, we explore two different network scen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01093","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:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dfXd5ccUDiFqtJ0ECsNXo+c4SaI9U5CgVu7O5hQxjYZFgZtG0m9VgkgbpVzgvNnsR7yXLxUwoXJNSXyiosY0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:49:43.169002Z"},"content_sha256":"e5444797d1142187e4907372dc1a9959f3f34cab83b7453a15a836dec5871ea9","schema_version":"1.0","event_id":"sha256:e5444797d1142187e4907372dc1a9959f3f34cab83b7453a15a836dec5871ea9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RG6SFCLPPT2GFZKYOXWDR2J52F/bundle.json","state_url":"https://pith.science/pith/RG6SFCLPPT2GFZKYOXWDR2J52F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RG6SFCLPPT2GFZKYOXWDR2J52F/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-27T11:49:43Z","links":{"resolver":"https://pith.science/pith/RG6SFCLPPT2GFZKYOXWDR2J52F","bundle":"https://pith.science/pith/RG6SFCLPPT2GFZKYOXWDR2J52F/bundle.json","state":"https://pith.science/pith/RG6SFCLPPT2GFZKYOXWDR2J52F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RG6SFCLPPT2GFZKYOXWDR2J52F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RG6SFCLPPT2GFZKYOXWDR2J52F","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":"7dd807143a7cf9872cb31fcf15d9ddb27e22b81bf67d722ff8490b4aef0d0efd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-03T11:37:09Z","title_canon_sha256":"23b9c7f607a0ed8dee7b2b90b48e49aeca5c94ebd6aab5741d0d928a43e8e405"},"schema_version":"1.0","source":{"id":"1807.01093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01093","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01093v1","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01093","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"RG6SFCLPPT2G","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RG6SFCLPPT2GFZKY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RG6SFCLP","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:e5444797d1142187e4907372dc1a9959f3f34cab83b7453a15a836dec5871ea9","target":"graph","created_at":"2026-05-18T00:11:45Z","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":"The concept of fog computing is centered around providing computation resources at the edge of network, thereby reducing the latency and improving the quality of service. However, it is still desirable to investigate how and where at the edge of the network the computation capacity should be provisioned. To this end, we propose a hierarchical capacity provisioning scheme. In particular, we consider a two-tier network architecture consisting of shallow and deep cloudlets and explore the benefits of hierarchical capacity based on queueing analysis. Moreover, we explore two different network scen","authors_text":"Abbas Kiani, Abdallah Khreishah, Nirwan Ansari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-03T11:37:09Z","title":"Hierarchical Capacity Provisioning for Fog Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01093","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:dbd5169cfc6809cffca095896dd598e203819c239c59a9ea3d32b6ee5d10202b","target":"record","created_at":"2026-05-18T00:11:45Z","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":"7dd807143a7cf9872cb31fcf15d9ddb27e22b81bf67d722ff8490b4aef0d0efd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-03T11:37:09Z","title_canon_sha256":"23b9c7f607a0ed8dee7b2b90b48e49aeca5c94ebd6aab5741d0d928a43e8e405"},"schema_version":"1.0","source":{"id":"1807.01093","kind":"arxiv","version":1}},"canonical_sha256":"89bd22896f7cf462e55875ec38e93dd170de0e3a29d9886eb919c770a695451a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89bd22896f7cf462e55875ec38e93dd170de0e3a29d9886eb919c770a695451a","first_computed_at":"2026-05-18T00:11:45.369714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:45.369714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n4s4NQcsqgjo59D3UmJq92PRrbjdRZywvYYAFSY3JM4jrh8Dvb6k9bXeuMBeKQxfaeDTBqY2A1XVDFttijnjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:45.370458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbd5169cfc6809cffca095896dd598e203819c239c59a9ea3d32b6ee5d10202b","sha256:e5444797d1142187e4907372dc1a9959f3f34cab83b7453a15a836dec5871ea9"],"state_sha256":"b5eb147be82d7305af6e293e889926c013e3c74a0e68db13d1bec8cf28050167"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YyP/VrDV+UcdtMf/7MDo2XMHZQU7mQyJfR5r7zEaYjoUvQ4nYc6FxgFC56qFh2hoB8OvQfsQTSWWvq0pB7xaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:49:43.171550Z","bundle_sha256":"48d9267828910dece31a585eb876e489ef1fa7719d37fe7cd081cdc2db878a1d"}}