{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:I7VW3OHMR7NHZVVSVONKB5YFFO","short_pith_number":"pith:I7VW3OHM","canonical_record":{"source":{"id":"1106.4985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-24T14:54:51Z","cross_cats_sorted":[],"title_canon_sha256":"24b7c8ed5e405f47a23b25e37dd363508ee2aa6f746c53b70938c26a1dba7684","abstract_canon_sha256":"9425137fa75c469f8e4d3088073fa3112fbec45ca730788a677a83b2f1153a43"},"schema_version":"1.0"},"canonical_sha256":"47eb6db8ec8fda7cd6b2ab9aa0f7052bbb4237fc16efa3cd095c9d26521b056e","source":{"kind":"arxiv","id":"1106.4985","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4985","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4985v1","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4985","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"I7VW3OHMR7NH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"I7VW3OHMR7NHZVVS","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"I7VW3OHM","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:I7VW3OHMR7NHZVVSVONKB5YFFO","target":"record","payload":{"canonical_record":{"source":{"id":"1106.4985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-24T14:54:51Z","cross_cats_sorted":[],"title_canon_sha256":"24b7c8ed5e405f47a23b25e37dd363508ee2aa6f746c53b70938c26a1dba7684","abstract_canon_sha256":"9425137fa75c469f8e4d3088073fa3112fbec45ca730788a677a83b2f1153a43"},"schema_version":"1.0"},"canonical_sha256":"47eb6db8ec8fda7cd6b2ab9aa0f7052bbb4237fc16efa3cd095c9d26521b056e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:22.620461Z","signature_b64":"l5duh6ChG8bzC7spwzyWNQOzeGwXlVI6+hl5uWX7iBLYy5lLGYKrk7MSKloAt8hFX9Mu/mWvUGFNp9IZDpkWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47eb6db8ec8fda7cd6b2ab9aa0f7052bbb4237fc16efa3cd095c9d26521b056e","last_reissued_at":"2026-05-18T04:19:22.620061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:22.620061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.4985","source_version":1,"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-18T04:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"squmXQoV8e57SFm7xNKFUo9E+PgeRpigfBwd5YHoRU1sPiUKlJasGML1UFzNFNcVBmvBVqMUEM0jVr57upXbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:52:32.718393Z"},"content_sha256":"85f3ff4bde49ca83a8265abc19b0f93c455c18c05b9fe0f0296d8010846bae6d","schema_version":"1.0","event_id":"sha256:85f3ff4bde49ca83a8265abc19b0f93c455c18c05b9fe0f0296d8010846bae6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:I7VW3OHMR7NHZVVSVONKB5YFFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Fractional Resource Scheduling vs. Batch Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fr\\'ed\\'eric Vivien (LIP, Henri Casanova (CoRG), INRIA Grenoble Rh\\^one-Alpes / LIP Laboratoire de l'Informatique du Parall\\'elisme), Mark Stillwell (LIP","submitted_at":"2011-06-24T14:54:51Z","abstract_excerpt":"We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or on extensions to existing batch scheduling systems, while we take a more aggressive approach and seek to find heuristics that maximize an objective metric correlated with job performance. We derive absolute performance bounds and develop algorithms for the online, non-clairvoyant version of our sched"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4985","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"},"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-18T04:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kfQiDtb32V8QIlvq8WRHKFhufqhD337JA00/fXKtJCx7N2tpfYWRgkhcN36FxGolF7fyNokbIZQ5AZxywgnTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:52:32.718736Z"},"content_sha256":"14fe7b2f3bc4ca1d6f783586078eec7a0923d4c237de8cc89e062dbb863c3a60","schema_version":"1.0","event_id":"sha256:14fe7b2f3bc4ca1d6f783586078eec7a0923d4c237de8cc89e062dbb863c3a60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7VW3OHMR7NHZVVSVONKB5YFFO/bundle.json","state_url":"https://pith.science/pith/I7VW3OHMR7NHZVVSVONKB5YFFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7VW3OHMR7NHZVVSVONKB5YFFO/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-06-01T12:52:32Z","links":{"resolver":"https://pith.science/pith/I7VW3OHMR7NHZVVSVONKB5YFFO","bundle":"https://pith.science/pith/I7VW3OHMR7NHZVVSVONKB5YFFO/bundle.json","state":"https://pith.science/pith/I7VW3OHMR7NHZVVSVONKB5YFFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7VW3OHMR7NHZVVSVONKB5YFFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:I7VW3OHMR7NHZVVSVONKB5YFFO","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":"9425137fa75c469f8e4d3088073fa3112fbec45ca730788a677a83b2f1153a43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-24T14:54:51Z","title_canon_sha256":"24b7c8ed5e405f47a23b25e37dd363508ee2aa6f746c53b70938c26a1dba7684"},"schema_version":"1.0","source":{"id":"1106.4985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4985","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4985v1","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4985","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"I7VW3OHMR7NH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"I7VW3OHMR7NHZVVS","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"I7VW3OHM","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:14fe7b2f3bc4ca1d6f783586078eec7a0923d4c237de8cc89e062dbb863c3a60","target":"graph","created_at":"2026-05-18T04:19:22Z","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":"We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or on extensions to existing batch scheduling systems, while we take a more aggressive approach and seek to find heuristics that maximize an objective metric correlated with job performance. We derive absolute performance bounds and develop algorithms for the online, non-clairvoyant version of our sched","authors_text":"Fr\\'ed\\'eric Vivien (LIP, Henri Casanova (CoRG), INRIA Grenoble Rh\\^one-Alpes / LIP Laboratoire de l'Informatique du Parall\\'elisme), Mark Stillwell (LIP","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-24T14:54:51Z","title":"Dynamic Fractional Resource Scheduling vs. Batch Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4985","kind":"arxiv","version":1},"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:85f3ff4bde49ca83a8265abc19b0f93c455c18c05b9fe0f0296d8010846bae6d","target":"record","created_at":"2026-05-18T04:19:22Z","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":"9425137fa75c469f8e4d3088073fa3112fbec45ca730788a677a83b2f1153a43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-24T14:54:51Z","title_canon_sha256":"24b7c8ed5e405f47a23b25e37dd363508ee2aa6f746c53b70938c26a1dba7684"},"schema_version":"1.0","source":{"id":"1106.4985","kind":"arxiv","version":1}},"canonical_sha256":"47eb6db8ec8fda7cd6b2ab9aa0f7052bbb4237fc16efa3cd095c9d26521b056e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47eb6db8ec8fda7cd6b2ab9aa0f7052bbb4237fc16efa3cd095c9d26521b056e","first_computed_at":"2026-05-18T04:19:22.620061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:22.620061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l5duh6ChG8bzC7spwzyWNQOzeGwXlVI6+hl5uWX7iBLYy5lLGYKrk7MSKloAt8hFX9Mu/mWvUGFNp9IZDpkWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:22.620461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.4985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85f3ff4bde49ca83a8265abc19b0f93c455c18c05b9fe0f0296d8010846bae6d","sha256:14fe7b2f3bc4ca1d6f783586078eec7a0923d4c237de8cc89e062dbb863c3a60"],"state_sha256":"6f96f2beeecfbf265aeb3c5176c389357343629990b30ae8a1fea5a85bfb4e24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rpOWIpQRxhslVNlLHkBNLSrOL3sb6wcDOduyuCY9mXeL5ea2Wbif+c/kdA1SmZMYJ0sCFW/OTohutW5LCbVnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:52:32.721846Z","bundle_sha256":"79fc6d5e21aacf4a4371b8c05fba39bcaa59d048775b35962869d55e37d3f6c5"}}