{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BUFNF5UMLJHELU7QZLSFZNWYPY","short_pith_number":"pith:BUFNF5UM","schema_version":"1.0","canonical_sha256":"0d0ad2f68c5a4e45d3f0cae45cb6d87e35ff1e62903ccb4a05adcb8aa0f4acef","source":{"kind":"arxiv","id":"1701.04763","version":1},"attestation_state":"computed","paper":{"title":"A Game-Theoretic Approach for Runtime Capacity Allocation in MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Danilo Ardagna, Eugenio Gianniti, Mauro Passacantando, Michele Ciavotta","submitted_at":"2017-01-17T16:57:15Z","abstract_excerpt":"Nowadays many companies have available large amounts of raw, unstructured data. Among Big Data enabling technologies, a central place is held by the MapReduce framework and, in particular, by its open source implementation, Apache Hadoop. For cost effectiveness considerations, a common approach entails sharing server clusters among multiple users. The underlying infrastructure should provide every user with a fair share of computational resources, ensuring that Service Level Agreements (SLAs) are met and avoiding wastes. In this paper we consider two mathematical programming problems that mode"},"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":"1701.04763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-17T16:57:15Z","cross_cats_sorted":[],"title_canon_sha256":"8c5ed6aa248a771f1b2c9039f4450f9f185d92fae39334419d12ae8b46062169","abstract_canon_sha256":"e9249e8abe7bdb742b934be6d72af0685fae533c42cf4dd06d5d780bc66fadbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:35.162602Z","signature_b64":"0Ncrw3+w254tST7aPifgeaNzan2czDr3zeHGMVSUz9Nw+/uT7Mf6ZWKFUFzMlgPkhtw+tQoDp7YeDxZIkjqdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d0ad2f68c5a4e45d3f0cae45cb6d87e35ff1e62903ccb4a05adcb8aa0f4acef","last_reissued_at":"2026-05-18T00:52:35.162161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:35.162161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Game-Theoretic Approach for Runtime Capacity Allocation in MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Danilo Ardagna, Eugenio Gianniti, Mauro Passacantando, Michele Ciavotta","submitted_at":"2017-01-17T16:57:15Z","abstract_excerpt":"Nowadays many companies have available large amounts of raw, unstructured data. Among Big Data enabling technologies, a central place is held by the MapReduce framework and, in particular, by its open source implementation, Apache Hadoop. For cost effectiveness considerations, a common approach entails sharing server clusters among multiple users. The underlying infrastructure should provide every user with a fair share of computational resources, ensuring that Service Level Agreements (SLAs) are met and avoiding wastes. In this paper we consider two mathematical programming problems that mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04763","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.04763","created_at":"2026-05-18T00:52:35.162235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04763v1","created_at":"2026-05-18T00:52:35.162235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04763","created_at":"2026-05-18T00:52:35.162235+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUFNF5UMLJHE","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUFNF5UMLJHELU7Q","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUFNF5UM","created_at":"2026-05-18T12:31:08.081275+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/BUFNF5UMLJHELU7QZLSFZNWYPY","json":"https://pith.science/pith/BUFNF5UMLJHELU7QZLSFZNWYPY.json","graph_json":"https://pith.science/api/pith-number/BUFNF5UMLJHELU7QZLSFZNWYPY/graph.json","events_json":"https://pith.science/api/pith-number/BUFNF5UMLJHELU7QZLSFZNWYPY/events.json","paper":"https://pith.science/paper/BUFNF5UM"},"agent_actions":{"view_html":"https://pith.science/pith/BUFNF5UMLJHELU7QZLSFZNWYPY","download_json":"https://pith.science/pith/BUFNF5UMLJHELU7QZLSFZNWYPY.json","view_paper":"https://pith.science/paper/BUFNF5UM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04763&json=true","fetch_graph":"https://pith.science/api/pith-number/BUFNF5UMLJHELU7QZLSFZNWYPY/graph.json","fetch_events":"https://pith.science/api/pith-number/BUFNF5UMLJHELU7QZLSFZNWYPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUFNF5UMLJHELU7QZLSFZNWYPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUFNF5UMLJHELU7QZLSFZNWYPY/action/storage_attestation","attest_author":"https://pith.science/pith/BUFNF5UMLJHELU7QZLSFZNWYPY/action/author_attestation","sign_citation":"https://pith.science/pith/BUFNF5UMLJHELU7QZLSFZNWYPY/action/citation_signature","submit_replication":"https://pith.science/pith/BUFNF5UMLJHELU7QZLSFZNWYPY/action/replication_record"}},"created_at":"2026-05-18T00:52:35.162235+00:00","updated_at":"2026-05-18T00:52:35.162235+00:00"}