{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ILMQEAT25DZHSZIRZCEKNG2L5Z","short_pith_number":"pith:ILMQEAT2","canonical_record":{"source":{"id":"2403.18545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-03-27T13:24:56Z","cross_cats_sorted":[],"title_canon_sha256":"222b919829bcb7de1ddb34b5eb77c36eb726179f681f84e3fd4f460501f20792","abstract_canon_sha256":"ee08f42509c8577cf4fcc6f73e986ac088d1b33d1f25d61fdc94a4b978425e7f"},"schema_version":"1.0"},"canonical_sha256":"42d902027ae8f2796511c888a69b4bee55f1e0ccbddfaeb6ec3f92da3b3c5313","source":{"kind":"arxiv","id":"2403.18545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.18545","created_at":"2026-07-05T08:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"2403.18545v1","created_at":"2026-07-05T08:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18545","created_at":"2026-07-05T08:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"ILMQEAT25DZH","created_at":"2026-07-05T08:01:24Z"},{"alias_kind":"pith_short_16","alias_value":"ILMQEAT25DZHSZIR","created_at":"2026-07-05T08:01:24Z"},{"alias_kind":"pith_short_8","alias_value":"ILMQEAT2","created_at":"2026-07-05T08:01:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ILMQEAT25DZHSZIRZCEKNG2L5Z","target":"record","payload":{"canonical_record":{"source":{"id":"2403.18545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-03-27T13:24:56Z","cross_cats_sorted":[],"title_canon_sha256":"222b919829bcb7de1ddb34b5eb77c36eb726179f681f84e3fd4f460501f20792","abstract_canon_sha256":"ee08f42509c8577cf4fcc6f73e986ac088d1b33d1f25d61fdc94a4b978425e7f"},"schema_version":"1.0"},"canonical_sha256":"42d902027ae8f2796511c888a69b4bee55f1e0ccbddfaeb6ec3f92da3b3c5313","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:24.221621Z","signature_b64":"/VufkUmV35v5+LIX0cDnHnFpeU74bUTENA1fYXs5Dbg9Oq4ImeSvQQsenpQtq6MvaRu54GBLkbCu9s+2OiIkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42d902027ae8f2796511c888a69b4bee55f1e0ccbddfaeb6ec3f92da3b3c5313","last_reissued_at":"2026-07-05T08:01:24.221213Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:24.221213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.18545","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-07-05T08:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IvGi6WL1I2Qw+S33tYy3alNYj3DBczRAZtLX6eQQXI7aezb+m8ahADunt0AhN/uRWuQdgT5mlgN6uFAnjDI/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T16:43:33.970644Z"},"content_sha256":"c95c17b0b5b0062229aee769e22c72cec2a37555e6df3b4be720ece8c3a1cae7","schema_version":"1.0","event_id":"sha256:c95c17b0b5b0062229aee769e22c72cec2a37555e6df3b4be720ece8c3a1cae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ILMQEAT25DZHSZIRZCEKNG2L5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Resource Efficiency with Fairness in Heterogeneous GPU Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Huanle Xu, Wing Cheong Lau, Zizhao Mo","submitted_at":"2024-03-27T13:24:56Z","abstract_excerpt":"Ensuring the highest training throughput to maximize resource efficiency, while maintaining fairness among users, is critical for deep learning (DL) training in heterogeneous GPU clusters. However, current DL schedulers provide only limited fairness properties and suboptimal training throughput, impeding tenants from effectively leveraging heterogeneous resources. The underlying design challenge stems from inherent conflicts between efficiency and fairness properties.\n  In this paper, we introduce OEF, a new resource allocation framework specifically developed for achieving optimal resource ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18545","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.18545/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"207O5t1LjVfWZnkj/NqKp4GQKrBjOJGCdJOw9fAGIIxC9W7HHgwviSIRhQbljAJD9pkr/G7x3Qt4X8Y6WsKgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T16:43:33.971657Z"},"content_sha256":"9dd7cb82f6ebb1d1d8cdaa44dcef89f55b0a5730452011f5474d8ceca3d6f8f7","schema_version":"1.0","event_id":"sha256:9dd7cb82f6ebb1d1d8cdaa44dcef89f55b0a5730452011f5474d8ceca3d6f8f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILMQEAT25DZHSZIRZCEKNG2L5Z/bundle.json","state_url":"https://pith.science/pith/ILMQEAT25DZHSZIRZCEKNG2L5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILMQEAT25DZHSZIRZCEKNG2L5Z/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-08-07T16:43:33Z","links":{"resolver":"https://pith.science/pith/ILMQEAT25DZHSZIRZCEKNG2L5Z","bundle":"https://pith.science/pith/ILMQEAT25DZHSZIRZCEKNG2L5Z/bundle.json","state":"https://pith.science/pith/ILMQEAT25DZHSZIRZCEKNG2L5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILMQEAT25DZHSZIRZCEKNG2L5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ILMQEAT25DZHSZIRZCEKNG2L5Z","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":"ee08f42509c8577cf4fcc6f73e986ac088d1b33d1f25d61fdc94a4b978425e7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-03-27T13:24:56Z","title_canon_sha256":"222b919829bcb7de1ddb34b5eb77c36eb726179f681f84e3fd4f460501f20792"},"schema_version":"1.0","source":{"id":"2403.18545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.18545","created_at":"2026-07-05T08:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"2403.18545v1","created_at":"2026-07-05T08:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18545","created_at":"2026-07-05T08:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"ILMQEAT25DZH","created_at":"2026-07-05T08:01:24Z"},{"alias_kind":"pith_short_16","alias_value":"ILMQEAT25DZHSZIR","created_at":"2026-07-05T08:01:24Z"},{"alias_kind":"pith_short_8","alias_value":"ILMQEAT2","created_at":"2026-07-05T08:01:24Z"}],"graph_snapshots":[{"event_id":"sha256:9dd7cb82f6ebb1d1d8cdaa44dcef89f55b0a5730452011f5474d8ceca3d6f8f7","target":"graph","created_at":"2026-07-05T08:01:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.18545/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ensuring the highest training throughput to maximize resource efficiency, while maintaining fairness among users, is critical for deep learning (DL) training in heterogeneous GPU clusters. However, current DL schedulers provide only limited fairness properties and suboptimal training throughput, impeding tenants from effectively leveraging heterogeneous resources. The underlying design challenge stems from inherent conflicts between efficiency and fairness properties.\n  In this paper, we introduce OEF, a new resource allocation framework specifically developed for achieving optimal resource ef","authors_text":"Huanle Xu, Wing Cheong Lau, Zizhao Mo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-03-27T13:24:56Z","title":"Optimal Resource Efficiency with Fairness in Heterogeneous GPU Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18545","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:c95c17b0b5b0062229aee769e22c72cec2a37555e6df3b4be720ece8c3a1cae7","target":"record","created_at":"2026-07-05T08:01:24Z","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":"ee08f42509c8577cf4fcc6f73e986ac088d1b33d1f25d61fdc94a4b978425e7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-03-27T13:24:56Z","title_canon_sha256":"222b919829bcb7de1ddb34b5eb77c36eb726179f681f84e3fd4f460501f20792"},"schema_version":"1.0","source":{"id":"2403.18545","kind":"arxiv","version":1}},"canonical_sha256":"42d902027ae8f2796511c888a69b4bee55f1e0ccbddfaeb6ec3f92da3b3c5313","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42d902027ae8f2796511c888a69b4bee55f1e0ccbddfaeb6ec3f92da3b3c5313","first_computed_at":"2026-07-05T08:01:24.221213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:01:24.221213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/VufkUmV35v5+LIX0cDnHnFpeU74bUTENA1fYXs5Dbg9Oq4ImeSvQQsenpQtq6MvaRu54GBLkbCu9s+2OiIkDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:01:24.221621Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.18545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c95c17b0b5b0062229aee769e22c72cec2a37555e6df3b4be720ece8c3a1cae7","sha256:9dd7cb82f6ebb1d1d8cdaa44dcef89f55b0a5730452011f5474d8ceca3d6f8f7"],"state_sha256":"0a5cf4cc35f8c187af2e66634a5185d072e9fac395ed8b42a87a65e03a480435"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPkpKztFHMyzzRPSPYauYQg9pVayzwjtA8jrISlGvKdvQRJpFmX1wP/uJFrE/HTDpRv6VFugAcADLRNTrElaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T16:43:33.983945Z","bundle_sha256":"96dba3d99176c4e7b10928d4f53bafffed9288f1ff49e7862f750a676f385586"}}