{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QG35VYHY23XMY4SVZ63SKSCATI","short_pith_number":"pith:QG35VYHY","schema_version":"1.0","canonical_sha256":"81b7dae0f8d6eecc7255cfb72548409a1ab1ac511513ed32bd825737dac14f16","source":{"kind":"arxiv","id":"1702.05569","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.05569","created_at":"2026-05-18T00:46:51.323328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05569v2","created_at":"2026-05-18T00:46:51.323328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05569","created_at":"2026-05-18T00:46:51.323328+00:00"},{"alias_kind":"pith_short_12","alias_value":"QG35VYHY23XM","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QG35VYHY23XMY4SV","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QG35VYHY","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI","json":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI.json","graph_json":"https://pith.science/api/pith-number/QG35VYHY23XMY4SVZ63SKSCATI/graph.json","events_json":"https://pith.science/api/pith-number/QG35VYHY23XMY4SVZ63SKSCATI/events.json","paper":"https://pith.science/paper/QG35VYHY"},"agent_actions":{"view_html":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI","download_json":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI.json","view_paper":"https://pith.science/paper/QG35VYHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05569&json=true","fetch_graph":"https://pith.science/api/pith-number/QG35VYHY23XMY4SVZ63SKSCATI/graph.json","fetch_events":"https://pith.science/api/pith-number/QG35VYHY23XMY4SVZ63SKSCATI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI/action/storage_attestation","attest_author":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI/action/author_attestation","sign_citation":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI/action/citation_signature","submit_replication":"https://pith.science/pith/QG35VYHY23XMY4SVZ63SKSCATI/action/replication_record"}},"created_at":"2026-05-18T00:46:51.323328+00:00","updated_at":"2026-05-18T00:46:51.323328+00:00"}