{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:K5LH4IHU5FVBDDDF3TJ23PK6YI","short_pith_number":"pith:K5LH4IHU","canonical_record":{"source":{"id":"2506.02025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-29T14:25:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bbf108540cb28164d011202aee209d06053f888904307620aaa4325168c53081","abstract_canon_sha256":"387b064c0f05cbdfb5451e4c9735605b25b360781a089d933ffb85386186490f"},"schema_version":"1.0"},"canonical_sha256":"57567e20f4e96a118c65dcd3adbd5ec232927c154ca07438421517974024cada","source":{"kind":"arxiv","id":"2506.02025","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02025","created_at":"2026-07-05T12:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02025v2","created_at":"2026-07-05T12:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02025","created_at":"2026-07-05T12:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"K5LH4IHU5FVB","created_at":"2026-07-05T12:04:35Z"},{"alias_kind":"pith_short_16","alias_value":"K5LH4IHU5FVBDDDF","created_at":"2026-07-05T12:04:35Z"},{"alias_kind":"pith_short_8","alias_value":"K5LH4IHU","created_at":"2026-07-05T12:04:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:K5LH4IHU5FVBDDDF3TJ23PK6YI","target":"record","payload":{"canonical_record":{"source":{"id":"2506.02025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-29T14:25:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bbf108540cb28164d011202aee209d06053f888904307620aaa4325168c53081","abstract_canon_sha256":"387b064c0f05cbdfb5451e4c9735605b25b360781a089d933ffb85386186490f"},"schema_version":"1.0"},"canonical_sha256":"57567e20f4e96a118c65dcd3adbd5ec232927c154ca07438421517974024cada","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:35.455843Z","signature_b64":"8TagGX18C2BpSXkNUX5Dr7chgjD+yX5+YZRJ+VxCpn31UxgfTerEJnZpgtQAy0w0KdSeKXsoAXfuKfgeLDSwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57567e20f4e96a118c65dcd3adbd5ec232927c154ca07438421517974024cada","last_reissued_at":"2026-07-05T12:04:35.455255Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:35.455255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.02025","source_version":2,"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-05T12:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1HxM8vTVBoU3w314ShqWxuAL4o8kItafRIGPx/Tf6BCbABb8V7PdjhNYv3a5iFXCAZox7vvtve35AFAjQfzlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:19:45.136002Z"},"content_sha256":"50652381db7ff817ef4fbcc178b795fe993b5e02cb0f11b3e8637ae6c8c9eeb9","schema_version":"1.0","event_id":"sha256:50652381db7ff817ef4fbcc178b795fe993b5e02cb0f11b3e8637ae6c8c9eeb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:K5LH4IHU5FVBDDDF3TJ23PK6YI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evaluating the Efficacy of LLM-Based Reasoning for Multiobjective HPC Job Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DC","authors_text":"Ewa Deelman, Hongwei Jin, Prachi Jadhav, Prasanna Balaprakash","submitted_at":"2025-05-29T14:25:29Z","abstract_excerpt":"High-Performance Computing (HPC) job scheduling involves balancing conflicting objectives such as minimizing makespan, reducing wait times, optimizing resource use, and ensuring fairness. Traditional methods, including heuristic-based, e.g., First-Come-First-Served (FJFS) and Shortest Job First (SJF), or intensive optimization techniques, often lack adaptability to dynamic workloads and, more importantly, cannot simultaneously optimize multiple objectives in HPC systems. To address this, we propose a novel Large Language Model (LLM)-based scheduler using a ReAct-style framework (Reason + Act),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02025","kind":"arxiv","version":2},"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/2506.02025/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-05T12:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tm/OGCJAGTRzNlhoGgbQZswsFAaVNNwtSSHzuTeh4sk6SSYJk1oKFGg5pYy4wR++1OOPT2+QE9FcqL8OCIy9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:19:45.136902Z"},"content_sha256":"4c5cd497ed9d15215f1d7a13978d73aba62df4e024d84589c39e38c73c8b9bb7","schema_version":"1.0","event_id":"sha256:4c5cd497ed9d15215f1d7a13978d73aba62df4e024d84589c39e38c73c8b9bb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5LH4IHU5FVBDDDF3TJ23PK6YI/bundle.json","state_url":"https://pith.science/pith/K5LH4IHU5FVBDDDF3TJ23PK6YI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5LH4IHU5FVBDDDF3TJ23PK6YI/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-09T00:19:45Z","links":{"resolver":"https://pith.science/pith/K5LH4IHU5FVBDDDF3TJ23PK6YI","bundle":"https://pith.science/pith/K5LH4IHU5FVBDDDF3TJ23PK6YI/bundle.json","state":"https://pith.science/pith/K5LH4IHU5FVBDDDF3TJ23PK6YI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5LH4IHU5FVBDDDF3TJ23PK6YI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:K5LH4IHU5FVBDDDF3TJ23PK6YI","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":"387b064c0f05cbdfb5451e4c9735605b25b360781a089d933ffb85386186490f","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-29T14:25:29Z","title_canon_sha256":"bbf108540cb28164d011202aee209d06053f888904307620aaa4325168c53081"},"schema_version":"1.0","source":{"id":"2506.02025","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02025","created_at":"2026-07-05T12:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02025v2","created_at":"2026-07-05T12:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02025","created_at":"2026-07-05T12:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"K5LH4IHU5FVB","created_at":"2026-07-05T12:04:35Z"},{"alias_kind":"pith_short_16","alias_value":"K5LH4IHU5FVBDDDF","created_at":"2026-07-05T12:04:35Z"},{"alias_kind":"pith_short_8","alias_value":"K5LH4IHU","created_at":"2026-07-05T12:04:35Z"}],"graph_snapshots":[{"event_id":"sha256:4c5cd497ed9d15215f1d7a13978d73aba62df4e024d84589c39e38c73c8b9bb7","target":"graph","created_at":"2026-07-05T12:04:35Z","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/2506.02025/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"High-Performance Computing (HPC) job scheduling involves balancing conflicting objectives such as minimizing makespan, reducing wait times, optimizing resource use, and ensuring fairness. Traditional methods, including heuristic-based, e.g., First-Come-First-Served (FJFS) and Shortest Job First (SJF), or intensive optimization techniques, often lack adaptability to dynamic workloads and, more importantly, cannot simultaneously optimize multiple objectives in HPC systems. To address this, we propose a novel Large Language Model (LLM)-based scheduler using a ReAct-style framework (Reason + Act),","authors_text":"Ewa Deelman, Hongwei Jin, Prachi Jadhav, Prasanna Balaprakash","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-29T14:25:29Z","title":"Evaluating the Efficacy of LLM-Based Reasoning for Multiobjective HPC Job Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02025","kind":"arxiv","version":2},"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:50652381db7ff817ef4fbcc178b795fe993b5e02cb0f11b3e8637ae6c8c9eeb9","target":"record","created_at":"2026-07-05T12:04:35Z","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":"387b064c0f05cbdfb5451e4c9735605b25b360781a089d933ffb85386186490f","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-29T14:25:29Z","title_canon_sha256":"bbf108540cb28164d011202aee209d06053f888904307620aaa4325168c53081"},"schema_version":"1.0","source":{"id":"2506.02025","kind":"arxiv","version":2}},"canonical_sha256":"57567e20f4e96a118c65dcd3adbd5ec232927c154ca07438421517974024cada","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57567e20f4e96a118c65dcd3adbd5ec232927c154ca07438421517974024cada","first_computed_at":"2026-07-05T12:04:35.455255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:04:35.455255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8TagGX18C2BpSXkNUX5Dr7chgjD+yX5+YZRJ+VxCpn31UxgfTerEJnZpgtQAy0w0KdSeKXsoAXfuKfgeLDSwDg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:04:35.455843Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.02025","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50652381db7ff817ef4fbcc178b795fe993b5e02cb0f11b3e8637ae6c8c9eeb9","sha256:4c5cd497ed9d15215f1d7a13978d73aba62df4e024d84589c39e38c73c8b9bb7"],"state_sha256":"44970d2fdf303aef4ae9861824b22ec771c4b9e6b75dc5a53cc8772baaae9e1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+q/djlHnluBMDKE8G5YCtqKU/5oyeHvW1ItAeInSBZ0f8ydM/NHSWnzIcnkwx5I7FM1ThWgAt6euy1972HUXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:19:45.143891Z","bundle_sha256":"3731c524de9f5e5e8f5dfaa9a467e079c14012fe403af71a5350fb5a5fd714e6"}}