{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4BRJOSSGDN2XY5DQKR6HUMBLOV","short_pith_number":"pith:4BRJOSSG","schema_version":"1.0","canonical_sha256":"e062974a461b757c7470547c7a302b756660e09703f5fc99e1bc363d9baa545d","source":{"kind":"arxiv","id":"2507.20312","version":1},"attestation_state":"computed","paper":{"title":"A Comparative Study of OpenMP Scheduling Algorithm Selection Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PF"],"primary_cat":"cs.DC","authors_text":"Ahmed Eleliemy, Ali Mohammed, Florina M. Ciorba, Jonas H. M\\\"uller Kornd\\\"orfer, Quentin Guilloteau, Reto Krummenacher","submitted_at":"2025-07-27T15:10:30Z","abstract_excerpt":"Scientific and data science applications are becoming increasingly complex, with growing computational and memory demands. Modern high performance computing (HPC) systems provide high parallelism and heterogeneity across nodes, devices, and cores. To achieve good performance, effective scheduling and load balancing techniques are essential. Parallel programming frameworks such as OpenMP now offer a variety of advanced scheduling algorithms to support diverse applications and platforms. This creates an instance of the scheduling algorithm selection problem, which involves identifying the most s"},"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":"2507.20312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-07-27T15:10:30Z","cross_cats_sorted":["cs.AI","cs.LG","cs.PF"],"title_canon_sha256":"1093ef471e496b2689e88aef4ca1db2e44275ca5c9e35f0b252bd6af8da64e53","abstract_canon_sha256":"0c20c6ee67431d8d377b101379105edf542e50f03ac59baa9fe8b0ad6b2dc7d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:16.901263Z","signature_b64":"pnp9VEmCtIP4lPlUUWQj9PsJYI/JKldZyjsnKVv/rBhUJdfeylN1ho0VVlGTrdNooM+MsIARgsm0/ORCD26eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e062974a461b757c7470547c7a302b756660e09703f5fc99e1bc363d9baa545d","last_reissued_at":"2026-07-05T11:44:16.900786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:16.900786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparative Study of OpenMP Scheduling Algorithm Selection Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PF"],"primary_cat":"cs.DC","authors_text":"Ahmed Eleliemy, Ali Mohammed, Florina M. Ciorba, Jonas H. M\\\"uller Kornd\\\"orfer, Quentin Guilloteau, Reto Krummenacher","submitted_at":"2025-07-27T15:10:30Z","abstract_excerpt":"Scientific and data science applications are becoming increasingly complex, with growing computational and memory demands. Modern high performance computing (HPC) systems provide high parallelism and heterogeneity across nodes, devices, and cores. To achieve good performance, effective scheduling and load balancing techniques are essential. Parallel programming frameworks such as OpenMP now offer a variety of advanced scheduling algorithms to support diverse applications and platforms. This creates an instance of the scheduling algorithm selection problem, which involves identifying the most s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20312","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/2507.20312/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.20312","created_at":"2026-07-05T11:44:16.900850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.20312v1","created_at":"2026-07-05T11:44:16.900850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20312","created_at":"2026-07-05T11:44:16.900850+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BRJOSSGDN2X","created_at":"2026-07-05T11:44:16.900850+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BRJOSSGDN2XY5DQ","created_at":"2026-07-05T11:44:16.900850+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BRJOSSG","created_at":"2026-07-05T11:44:16.900850+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/4BRJOSSGDN2XY5DQKR6HUMBLOV","json":"https://pith.science/pith/4BRJOSSGDN2XY5DQKR6HUMBLOV.json","graph_json":"https://pith.science/api/pith-number/4BRJOSSGDN2XY5DQKR6HUMBLOV/graph.json","events_json":"https://pith.science/api/pith-number/4BRJOSSGDN2XY5DQKR6HUMBLOV/events.json","paper":"https://pith.science/paper/4BRJOSSG"},"agent_actions":{"view_html":"https://pith.science/pith/4BRJOSSGDN2XY5DQKR6HUMBLOV","download_json":"https://pith.science/pith/4BRJOSSGDN2XY5DQKR6HUMBLOV.json","view_paper":"https://pith.science/paper/4BRJOSSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.20312&json=true","fetch_graph":"https://pith.science/api/pith-number/4BRJOSSGDN2XY5DQKR6HUMBLOV/graph.json","fetch_events":"https://pith.science/api/pith-number/4BRJOSSGDN2XY5DQKR6HUMBLOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BRJOSSGDN2XY5DQKR6HUMBLOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BRJOSSGDN2XY5DQKR6HUMBLOV/action/storage_attestation","attest_author":"https://pith.science/pith/4BRJOSSGDN2XY5DQKR6HUMBLOV/action/author_attestation","sign_citation":"https://pith.science/pith/4BRJOSSGDN2XY5DQKR6HUMBLOV/action/citation_signature","submit_replication":"https://pith.science/pith/4BRJOSSGDN2XY5DQKR6HUMBLOV/action/replication_record"}},"created_at":"2026-07-05T11:44:16.900850+00:00","updated_at":"2026-07-05T11:44:16.900850+00:00"}