{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QG35VYHY23XMY4SVZ63SKSCATI","short_pith_number":"pith:QG35VYHY","canonical_record":{"source":{"id":"1702.05569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-18T04:40:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"12c92564ab713d4075f387ed66cbc35fd7b842a2fd7f81683ad085752eb70aab","abstract_canon_sha256":"902a9f7cb83dc8697a05ea6c3661bf1a65ef2c699a583b3855e8f3a6631961ac"},"schema_version":"1.0"},"canonical_sha256":"81b7dae0f8d6eecc7255cfb72548409a1ab1ac511513ed32bd825737dac14f16","source":{"kind":"arxiv","id":"1702.05569","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05569","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05569v2","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05569","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"QG35VYHY23XM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QG35VYHY23XMY4SV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QG35VYHY","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QG35VYHY23XMY4SVZ63SKSCATI","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-18T04:40:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"12c92564ab713d4075f387ed66cbc35fd7b842a2fd7f81683ad085752eb70aab","abstract_canon_sha256":"902a9f7cb83dc8697a05ea6c3661bf1a65ef2c699a583b3855e8f3a6631961ac"},"schema_version":"1.0"},"canonical_sha256":"81b7dae0f8d6eecc7255cfb72548409a1ab1ac511513ed32bd825737dac14f16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:51.323867Z","signature_b64":"NAQQWqRXLnRDSAMz+MDE8MUb72eSbBR5rM9yF++ef0P1PWjcHOoWBNTNuagImnnsfhviyrMtbcoaPEu5LgcKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81b7dae0f8d6eecc7255cfb72548409a1ab1ac511513ed32bd825737dac14f16","last_reissued_at":"2026-05-18T00:46:51.323226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:51.323226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05569","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:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1afKKq8bBZy6Hvns5IGaWWC6rQyHO6U34xx+DE99ncgByCoOHeTL3M5U6RDZh5xCnGKUEVl0Sq2AREAukgMRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:47:53.772308Z"},"content_sha256":"3071ea269cf68e2179d3677a6705fcb91dd5ebb3fdf7c0218a50807c67f2f302","schema_version":"1.0","event_id":"sha256:3071ea269cf68e2179d3677a6705fcb91dd5ebb3fdf7c0218a50807c67f2f302"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QG35VYHY23XMY4SVZ63SKSCATI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Online Secretary Framework for Fog Network Formation with Minimal Latency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gilsoo Lee, Mehdi Bennis, Walid Saad","submitted_at":"2017-02-18T04:40:50Z","abstract_excerpt":"Fog computing is seen as a promising approach to perform distributed, low-latency computation for supporting Internet of Things applications. However, due to the unpredictable arrival of available neighboring fog nodes, the dynamic formation of a fog network can be challenging. In essence, a given fog node must smartly select the set of neighboring fog nodes that can provide low-latency computations. In this paper, this problem of fog network formation and task distribution is studied considering a hybrid cloud-fog architecture. The goal of the proposed framework is to minimize the maximum com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05569","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:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aedez7EjJO8GZxGxtXYcSNgEvh1aJwVwXl+ZBExK/smt9TkRPVjOTX+vvinR49gPhZfDIJIawdZyA6BXdem3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:47:53.772726Z"},"content_sha256":"a48d7cf94fae5da0a1c40cdf33efe43ac525e5a83e57dec099ed539f31df09ed","schema_version":"1.0","event_id":"sha256:a48d7cf94fae5da0a1c40cdf33efe43ac525e5a83e57dec099ed539f31df09ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI/bundle.json","state_url":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QG35VYHY23XMY4SVZ63SKSCATI/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-28T20:47:53Z","links":{"resolver":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI","bundle":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI/bundle.json","state":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QG35VYHY23XMY4SVZ63SKSCATI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QG35VYHY23XMY4SVZ63SKSCATI","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":"902a9f7cb83dc8697a05ea6c3661bf1a65ef2c699a583b3855e8f3a6631961ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-18T04:40:50Z","title_canon_sha256":"12c92564ab713d4075f387ed66cbc35fd7b842a2fd7f81683ad085752eb70aab"},"schema_version":"1.0","source":{"id":"1702.05569","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05569","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05569v2","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05569","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"QG35VYHY23XM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QG35VYHY23XMY4SV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QG35VYHY","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:a48d7cf94fae5da0a1c40cdf33efe43ac525e5a83e57dec099ed539f31df09ed","target":"graph","created_at":"2026-05-18T00:46:51Z","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":"Fog computing is seen as a promising approach to perform distributed, low-latency computation for supporting Internet of Things applications. However, due to the unpredictable arrival of available neighboring fog nodes, the dynamic formation of a fog network can be challenging. In essence, a given fog node must smartly select the set of neighboring fog nodes that can provide low-latency computations. In this paper, this problem of fog network formation and task distribution is studied considering a hybrid cloud-fog architecture. The goal of the proposed framework is to minimize the maximum com","authors_text":"Gilsoo Lee, Mehdi Bennis, Walid Saad","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-18T04:40:50Z","title":"An Online Secretary Framework for Fog Network Formation with Minimal Latency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05569","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:3071ea269cf68e2179d3677a6705fcb91dd5ebb3fdf7c0218a50807c67f2f302","target":"record","created_at":"2026-05-18T00:46:51Z","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":"902a9f7cb83dc8697a05ea6c3661bf1a65ef2c699a583b3855e8f3a6631961ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-18T04:40:50Z","title_canon_sha256":"12c92564ab713d4075f387ed66cbc35fd7b842a2fd7f81683ad085752eb70aab"},"schema_version":"1.0","source":{"id":"1702.05569","kind":"arxiv","version":2}},"canonical_sha256":"81b7dae0f8d6eecc7255cfb72548409a1ab1ac511513ed32bd825737dac14f16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81b7dae0f8d6eecc7255cfb72548409a1ab1ac511513ed32bd825737dac14f16","first_computed_at":"2026-05-18T00:46:51.323226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:51.323226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NAQQWqRXLnRDSAMz+MDE8MUb72eSbBR5rM9yF++ef0P1PWjcHOoWBNTNuagImnnsfhviyrMtbcoaPEu5LgcKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:51.323867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05569","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3071ea269cf68e2179d3677a6705fcb91dd5ebb3fdf7c0218a50807c67f2f302","sha256:a48d7cf94fae5da0a1c40cdf33efe43ac525e5a83e57dec099ed539f31df09ed"],"state_sha256":"9c2657f29edd932ec03487b62303e513ef35fbd7e554c814613cf14562ceefb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJKydJt3ZmZjVg6Frd2AlmvwOeYyNh76Gf9CcB4KUVA/17i8DcutoZf2mK2TFRIe6LTrNcPL9gI1Uu6Nzw0hBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:47:53.776008Z","bundle_sha256":"5b07c3a90208e0468d4b113208edfd2014acfbd8eea812564ca5939a515c8c31"}}