{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:L7B55XRUOOLD6DEMAQNJVIG3KQ","short_pith_number":"pith:L7B55XRU","canonical_record":{"source":{"id":"2501.18191","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-30T08:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"696becc435396c0e429b0f0047fb7015fe97407ee9687299178dee3e0f5a80f4","abstract_canon_sha256":"89aeec5d2cd8bf3f6f3df32cc65671ec32a41aebd9d4c297eb7071f21eae1e95"},"schema_version":"1.0"},"canonical_sha256":"5fc3dede3473963f0c8c041a9aa0db5412a44d5ce231a9c0e4d3a1ee2c388e45","source":{"kind":"arxiv","id":"2501.18191","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.18191","created_at":"2026-07-05T10:07:30Z"},{"alias_kind":"arxiv_version","alias_value":"2501.18191v1","created_at":"2026-07-05T10:07:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18191","created_at":"2026-07-05T10:07:30Z"},{"alias_kind":"pith_short_12","alias_value":"L7B55XRUOOLD","created_at":"2026-07-05T10:07:30Z"},{"alias_kind":"pith_short_16","alias_value":"L7B55XRUOOLD6DEM","created_at":"2026-07-05T10:07:30Z"},{"alias_kind":"pith_short_8","alias_value":"L7B55XRU","created_at":"2026-07-05T10:07:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:L7B55XRUOOLD6DEMAQNJVIG3KQ","target":"record","payload":{"canonical_record":{"source":{"id":"2501.18191","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-30T08:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"696becc435396c0e429b0f0047fb7015fe97407ee9687299178dee3e0f5a80f4","abstract_canon_sha256":"89aeec5d2cd8bf3f6f3df32cc65671ec32a41aebd9d4c297eb7071f21eae1e95"},"schema_version":"1.0"},"canonical_sha256":"5fc3dede3473963f0c8c041a9aa0db5412a44d5ce231a9c0e4d3a1ee2c388e45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:30.790940Z","signature_b64":"8sPY2hbSoMuQIs8yYkRs2eOXD2ibiQ09qeuo0Xibt9L8v9Y2sfwvE4I+IfGUt6PPI/HLQMMat99O21eoWBxIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fc3dede3473963f0c8c041a9aa0db5412a44d5ce231a9c0e4d3a1ee2c388e45","last_reissued_at":"2026-07-05T10:07:30.790515Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:30.790515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.18191","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-05T10:07:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HiNr4g8/dZ/gdX8RNwvsotmgoxkxGXC29OENqQLNm9/Kt/t/8WuruvBN+mErbTmyqaJgme/I/SC8CUJ6mIydBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T05:55:15.033767Z"},"content_sha256":"eea4741d31273d3ae2bda0871498eb4fa1660fa73173e487ec009fc9ef608b8b","schema_version":"1.0","event_id":"sha256:eea4741d31273d3ae2bda0871498eb4fa1660fa73173e487ec009fc9ef608b8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:L7B55XRUOOLD6DEMAQNJVIG3KQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable HPC Job Scheduling and Resource Management in SST","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abrar Hossain, Abubeker Abdurahman, Kazutomo Yoshii, Kevin A Brown, Kishwar Ahmed","submitted_at":"2025-01-30T08:06:48Z","abstract_excerpt":"Efficient job scheduling and resource management contribute towards system throughput and efficiency maximization in high-performance computing (HPC) systems. In this paper, we introduce a scalable job scheduling and resource management component within the structural simulation toolkit (SST), a cycle-accurate and parallel discrete-event simulator. Our proposed simulator includes state-of-the-art job scheduling algorithms and resource management techniques. Additionally, it introduces workflow management components that support the simulation of task dependencies and resource allocations, cruc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18191","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/2501.18191/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-05T10:07:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBcBCgkdqtsgbga6+MPUWTDm7c1Dqr8gn4W8Rp569Qt+7ibGEQVH+PCxATMCebBJWmdqIjw6LKLpeaKATmgRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T05:55:15.034322Z"},"content_sha256":"d94891b193c0a5fb5c44e7db377bf2d6e60a923dedcd79b1da9d3b9b5bbb5032","schema_version":"1.0","event_id":"sha256:d94891b193c0a5fb5c44e7db377bf2d6e60a923dedcd79b1da9d3b9b5bbb5032"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7B55XRUOOLD6DEMAQNJVIG3KQ/bundle.json","state_url":"https://pith.science/pith/L7B55XRUOOLD6DEMAQNJVIG3KQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7B55XRUOOLD6DEMAQNJVIG3KQ/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-23T05:55:15Z","links":{"resolver":"https://pith.science/pith/L7B55XRUOOLD6DEMAQNJVIG3KQ","bundle":"https://pith.science/pith/L7B55XRUOOLD6DEMAQNJVIG3KQ/bundle.json","state":"https://pith.science/pith/L7B55XRUOOLD6DEMAQNJVIG3KQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7B55XRUOOLD6DEMAQNJVIG3KQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:L7B55XRUOOLD6DEMAQNJVIG3KQ","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":"89aeec5d2cd8bf3f6f3df32cc65671ec32a41aebd9d4c297eb7071f21eae1e95","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-30T08:06:48Z","title_canon_sha256":"696becc435396c0e429b0f0047fb7015fe97407ee9687299178dee3e0f5a80f4"},"schema_version":"1.0","source":{"id":"2501.18191","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.18191","created_at":"2026-07-05T10:07:30Z"},{"alias_kind":"arxiv_version","alias_value":"2501.18191v1","created_at":"2026-07-05T10:07:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18191","created_at":"2026-07-05T10:07:30Z"},{"alias_kind":"pith_short_12","alias_value":"L7B55XRUOOLD","created_at":"2026-07-05T10:07:30Z"},{"alias_kind":"pith_short_16","alias_value":"L7B55XRUOOLD6DEM","created_at":"2026-07-05T10:07:30Z"},{"alias_kind":"pith_short_8","alias_value":"L7B55XRU","created_at":"2026-07-05T10:07:30Z"}],"graph_snapshots":[{"event_id":"sha256:d94891b193c0a5fb5c44e7db377bf2d6e60a923dedcd79b1da9d3b9b5bbb5032","target":"graph","created_at":"2026-07-05T10:07:30Z","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/2501.18191/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient job scheduling and resource management contribute towards system throughput and efficiency maximization in high-performance computing (HPC) systems. In this paper, we introduce a scalable job scheduling and resource management component within the structural simulation toolkit (SST), a cycle-accurate and parallel discrete-event simulator. Our proposed simulator includes state-of-the-art job scheduling algorithms and resource management techniques. Additionally, it introduces workflow management components that support the simulation of task dependencies and resource allocations, cruc","authors_text":"Abrar Hossain, Abubeker Abdurahman, Kazutomo Yoshii, Kevin A Brown, Kishwar Ahmed","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-30T08:06:48Z","title":"Scalable HPC Job Scheduling and Resource Management in SST"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18191","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:eea4741d31273d3ae2bda0871498eb4fa1660fa73173e487ec009fc9ef608b8b","target":"record","created_at":"2026-07-05T10:07:30Z","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":"89aeec5d2cd8bf3f6f3df32cc65671ec32a41aebd9d4c297eb7071f21eae1e95","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-30T08:06:48Z","title_canon_sha256":"696becc435396c0e429b0f0047fb7015fe97407ee9687299178dee3e0f5a80f4"},"schema_version":"1.0","source":{"id":"2501.18191","kind":"arxiv","version":1}},"canonical_sha256":"5fc3dede3473963f0c8c041a9aa0db5412a44d5ce231a9c0e4d3a1ee2c388e45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fc3dede3473963f0c8c041a9aa0db5412a44d5ce231a9c0e4d3a1ee2c388e45","first_computed_at":"2026-07-05T10:07:30.790515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:07:30.790515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8sPY2hbSoMuQIs8yYkRs2eOXD2ibiQ09qeuo0Xibt9L8v9Y2sfwvE4I+IfGUt6PPI/HLQMMat99O21eoWBxIDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:07:30.790940Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.18191","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eea4741d31273d3ae2bda0871498eb4fa1660fa73173e487ec009fc9ef608b8b","sha256:d94891b193c0a5fb5c44e7db377bf2d6e60a923dedcd79b1da9d3b9b5bbb5032"],"state_sha256":"7d41e416d646d9a78ac1d98c9f32aea020b4336781409d7011640ae7d3e574cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"937oSNXrw8lgMYocvy47D2ihmbRHlMQTUt85zy22sd4pvp2tOR7zMrDvpsGwVTF9TeS205hiQRRkeDtmo5hqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T05:55:15.042166Z","bundle_sha256":"ba0f2896f26e47c3c2b458eee2716695a5f6d760528753ad0123031dba2a4001"}}