{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WT4LSBRPQGYIQAC457XN5WT5G4","short_pith_number":"pith:WT4LSBRP","schema_version":"1.0","canonical_sha256":"b4f8b9062f81b088005cefeededa7d370ca0a72a8b8733f9de12297af2fba654","source":{"kind":"arxiv","id":"1807.09756","version":4},"attestation_state":"computed","paper":{"title":"A Market-Based Framework for Multi-Resource Allocation in Fog Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Duong Tung Nguyen, Long Bao Le, Vijay Bhargava","submitted_at":"2018-07-25T17:56:59Z","abstract_excerpt":"Fog computing is transforming the network edge into an intelligent platform by bringing storage, computing, control, and networking functions closer to end-users, things, and sensors. How to allocate multiple resource types (e.g., CPU, memory, bandwidth) of capacity-limited heterogeneous fog nodes to competing services with diverse requirements and preferences in a fair and efficient manner is a challenging task. To this end, we propose a novel market-based resource allocation framework in which the services act as buyers and fog resources act as divisible goods in the market. The proposed fra"},"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":"1807.09756","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-07-25T17:56:59Z","cross_cats_sorted":[],"title_canon_sha256":"799e62cc65689ba961954f8cfe5906209a3258a0685e132b15fb4a2f97b30cb2","abstract_canon_sha256":"2c9d7b7f00cbda57f98e3a504568b5672e0410f722ca0d779ecc1aae058524f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:34.004627Z","signature_b64":"a5KGMwK9EuxpaeDyiJbqeyMnV+rCvwXj7riq3OXOxypkDlOeJd3d8wsiw6AXuiAlp91dJgljBV/A0ORd78g5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f8b9062f81b088005cefeededa7d370ca0a72a8b8733f9de12297af2fba654","last_reissued_at":"2026-05-17T23:48:34.004101Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:34.004101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Market-Based Framework for Multi-Resource Allocation in Fog Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Duong Tung Nguyen, Long Bao Le, Vijay Bhargava","submitted_at":"2018-07-25T17:56:59Z","abstract_excerpt":"Fog computing is transforming the network edge into an intelligent platform by bringing storage, computing, control, and networking functions closer to end-users, things, and sensors. How to allocate multiple resource types (e.g., CPU, memory, bandwidth) of capacity-limited heterogeneous fog nodes to competing services with diverse requirements and preferences in a fair and efficient manner is a challenging task. To this end, we propose a novel market-based resource allocation framework in which the services act as buyers and fog resources act as divisible goods in the market. The proposed fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09756","kind":"arxiv","version":4},"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":"1807.09756","created_at":"2026-05-17T23:48:34.004185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09756v4","created_at":"2026-05-17T23:48:34.004185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09756","created_at":"2026-05-17T23:48:34.004185+00:00"},{"alias_kind":"pith_short_12","alias_value":"WT4LSBRPQGYI","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WT4LSBRPQGYIQAC4","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WT4LSBRP","created_at":"2026-05-18T12:33:01.666342+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/WT4LSBRPQGYIQAC457XN5WT5G4","json":"https://pith.science/pith/WT4LSBRPQGYIQAC457XN5WT5G4.json","graph_json":"https://pith.science/api/pith-number/WT4LSBRPQGYIQAC457XN5WT5G4/graph.json","events_json":"https://pith.science/api/pith-number/WT4LSBRPQGYIQAC457XN5WT5G4/events.json","paper":"https://pith.science/paper/WT4LSBRP"},"agent_actions":{"view_html":"https://pith.science/pith/WT4LSBRPQGYIQAC457XN5WT5G4","download_json":"https://pith.science/pith/WT4LSBRPQGYIQAC457XN5WT5G4.json","view_paper":"https://pith.science/paper/WT4LSBRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09756&json=true","fetch_graph":"https://pith.science/api/pith-number/WT4LSBRPQGYIQAC457XN5WT5G4/graph.json","fetch_events":"https://pith.science/api/pith-number/WT4LSBRPQGYIQAC457XN5WT5G4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WT4LSBRPQGYIQAC457XN5WT5G4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WT4LSBRPQGYIQAC457XN5WT5G4/action/storage_attestation","attest_author":"https://pith.science/pith/WT4LSBRPQGYIQAC457XN5WT5G4/action/author_attestation","sign_citation":"https://pith.science/pith/WT4LSBRPQGYIQAC457XN5WT5G4/action/citation_signature","submit_replication":"https://pith.science/pith/WT4LSBRPQGYIQAC457XN5WT5G4/action/replication_record"}},"created_at":"2026-05-17T23:48:34.004185+00:00","updated_at":"2026-05-17T23:48:34.004185+00:00"}