{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ROAJQXIKN7FKRNLQ5MOMX63AF6","short_pith_number":"pith:ROAJQXIK","schema_version":"1.0","canonical_sha256":"8b80985d0a6fcaa8b570eb1ccbfb602f93067f153b53714def53cd7805c89b8e","source":{"kind":"arxiv","id":"1204.6631","version":1},"attestation_state":"computed","paper":{"title":"A new job migration algorithm to improve data center efficiency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Federico Calzolari, Silvia Volpe","submitted_at":"2012-04-30T13:44:03Z","abstract_excerpt":"The under exploitation of the available resources risks to be one of the main problems for a computing center. The growing demand of computational power necessarily entails more complex approaches in the management of the computing resources, with particular attention to the batch queue system scheduler. In a heterogeneous batch queue system, available for both serial single core processes and parallel multi core jobs, it may happen that one or more computational nodes composing the cluster are not fully occupied, running a number of jobs lower than their actual capability. A typical case is r"},"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":"1204.6631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-30T13:44:03Z","cross_cats_sorted":[],"title_canon_sha256":"b21723379c34a477e743b4f4453b5fdc4f209b83286ec39f1e833ac445f98729","abstract_canon_sha256":"f1a3623e3ad244811d52ea63939f418afba8ef4842f4b9078628297ef932dc07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:44.286851Z","signature_b64":"Bp8VDVwXV/Efr4bTGmk/JXrBgO9udE9hZEywy9TMIA/ZZJBlVnvAANYShpaAO+sNJhcIBNofAbf1HXGNpZ7eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b80985d0a6fcaa8b570eb1ccbfb602f93067f153b53714def53cd7805c89b8e","last_reissued_at":"2026-05-18T03:56:44.286332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:44.286332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new job migration algorithm to improve data center efficiency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Federico Calzolari, Silvia Volpe","submitted_at":"2012-04-30T13:44:03Z","abstract_excerpt":"The under exploitation of the available resources risks to be one of the main problems for a computing center. The growing demand of computational power necessarily entails more complex approaches in the management of the computing resources, with particular attention to the batch queue system scheduler. In a heterogeneous batch queue system, available for both serial single core processes and parallel multi core jobs, it may happen that one or more computational nodes composing the cluster are not fully occupied, running a number of jobs lower than their actual capability. A typical case is r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6631","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":"1204.6631","created_at":"2026-05-18T03:56:44.286432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.6631v1","created_at":"2026-05-18T03:56:44.286432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6631","created_at":"2026-05-18T03:56:44.286432+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROAJQXIKN7FK","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROAJQXIKN7FKRNLQ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROAJQXIK","created_at":"2026-05-18T12:27:20.899486+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/ROAJQXIKN7FKRNLQ5MOMX63AF6","json":"https://pith.science/pith/ROAJQXIKN7FKRNLQ5MOMX63AF6.json","graph_json":"https://pith.science/api/pith-number/ROAJQXIKN7FKRNLQ5MOMX63AF6/graph.json","events_json":"https://pith.science/api/pith-number/ROAJQXIKN7FKRNLQ5MOMX63AF6/events.json","paper":"https://pith.science/paper/ROAJQXIK"},"agent_actions":{"view_html":"https://pith.science/pith/ROAJQXIKN7FKRNLQ5MOMX63AF6","download_json":"https://pith.science/pith/ROAJQXIKN7FKRNLQ5MOMX63AF6.json","view_paper":"https://pith.science/paper/ROAJQXIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.6631&json=true","fetch_graph":"https://pith.science/api/pith-number/ROAJQXIKN7FKRNLQ5MOMX63AF6/graph.json","fetch_events":"https://pith.science/api/pith-number/ROAJQXIKN7FKRNLQ5MOMX63AF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROAJQXIKN7FKRNLQ5MOMX63AF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROAJQXIKN7FKRNLQ5MOMX63AF6/action/storage_attestation","attest_author":"https://pith.science/pith/ROAJQXIKN7FKRNLQ5MOMX63AF6/action/author_attestation","sign_citation":"https://pith.science/pith/ROAJQXIKN7FKRNLQ5MOMX63AF6/action/citation_signature","submit_replication":"https://pith.science/pith/ROAJQXIKN7FKRNLQ5MOMX63AF6/action/replication_record"}},"created_at":"2026-05-18T03:56:44.286432+00:00","updated_at":"2026-05-18T03:56:44.286432+00:00"}