{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RPD64W6CFL6RIDPPRW6L5LSELC","short_pith_number":"pith:RPD64W6C","canonical_record":{"source":{"id":"1805.07998","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-21T11:46:49Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"3876e83abc52c7db4bf7d8eaa153fb8ca91f4f7aac917e4a35bf856c2249badd","abstract_canon_sha256":"ec744bf91fa92a27822e8ea541e8d22a5452dee639691c89c24266926fad8056"},"schema_version":"1.0"},"canonical_sha256":"8bc7ee5bc22afd140def8dbcbeae44589443db4858f68f8fda2b0451fd395298","source":{"kind":"arxiv","id":"1805.07998","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07998","created_at":"2026-05-18T00:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07998v2","created_at":"2026-05-18T00:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07998","created_at":"2026-05-18T00:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"RPD64W6CFL6R","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RPD64W6CFL6RIDPP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RPD64W6C","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RPD64W6CFL6RIDPPRW6L5LSELC","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07998","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-21T11:46:49Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"3876e83abc52c7db4bf7d8eaa153fb8ca91f4f7aac917e4a35bf856c2249badd","abstract_canon_sha256":"ec744bf91fa92a27822e8ea541e8d22a5452dee639691c89c24266926fad8056"},"schema_version":"1.0"},"canonical_sha256":"8bc7ee5bc22afd140def8dbcbeae44589443db4858f68f8fda2b0451fd395298","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:57.477689Z","signature_b64":"JA+gQf20R9KZLbE6IaAwhYW0akoB+bc+1N9Bij9MDMOLSiC7q4oDRHRiZPU930AgkFW1Zgynug+tthngj3itDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc7ee5bc22afd140def8dbcbeae44589443db4858f68f8fda2b0451fd395298","last_reissued_at":"2026-05-18T00:13:57.476823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:57.476823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07998","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-05-18T00:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AkXN4MVh/4pLimiv0NX9h4f+Cc/JO7uEFJI9b/0JI1WEzGuo+nFNaF1loBHs7rwt04koAwws/xa2xYDrno4HDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:12:22.501765Z"},"content_sha256":"cb15945a5af540551ec514e3970b04874153b864adcf776221af09dd2a22bae8","schema_version":"1.0","event_id":"sha256:cb15945a5af540551ec514e3970b04874153b864adcf776221af09dd2a22bae8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RPD64W6CFL6RIDPPRW6L5LSELC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Reproduction and Prediction of Selected Dynamic Loop Scheduling Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Ahmed Eleliemy, Ali Mohammed, Florina M. Ciorba","submitted_at":"2018-05-21T11:46:49Z","abstract_excerpt":"Scientific applications are complex, large, and often exhibit irregular and stochastic behavior. The use of efficient loop scheduling techniques in computationally-intensive applications is crucial for improving their performance on high-performance computing (HPC) platforms. A number of dynamic loop scheduling (DLS) techniques have been proposed between the late 1980s and early 2000s, and efficiently used in scientific applications. In most cases, the computing systems on which they have been tested and validated are no longer available. This work is concerned with the minimization of the sou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07998","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":""},"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-18T00:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vza1EmBKk/WSVzW8G9/8uH5Bmy0/CftPBo7m0COlpyb7kyCiDtIctPdiopb+KJHmtQaifujmVV6MiSu6aX4UBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:12:22.502114Z"},"content_sha256":"b0703ef0bd34562b81e60532c2e026cdffdb9e358a04a1d4e2a6db1f2e6aa41d","schema_version":"1.0","event_id":"sha256:b0703ef0bd34562b81e60532c2e026cdffdb9e358a04a1d4e2a6db1f2e6aa41d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPD64W6CFL6RIDPPRW6L5LSELC/bundle.json","state_url":"https://pith.science/pith/RPD64W6CFL6RIDPPRW6L5LSELC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPD64W6CFL6RIDPPRW6L5LSELC/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-04T18:12:22Z","links":{"resolver":"https://pith.science/pith/RPD64W6CFL6RIDPPRW6L5LSELC","bundle":"https://pith.science/pith/RPD64W6CFL6RIDPPRW6L5LSELC/bundle.json","state":"https://pith.science/pith/RPD64W6CFL6RIDPPRW6L5LSELC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPD64W6CFL6RIDPPRW6L5LSELC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RPD64W6CFL6RIDPPRW6L5LSELC","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":"ec744bf91fa92a27822e8ea541e8d22a5452dee639691c89c24266926fad8056","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-21T11:46:49Z","title_canon_sha256":"3876e83abc52c7db4bf7d8eaa153fb8ca91f4f7aac917e4a35bf856c2249badd"},"schema_version":"1.0","source":{"id":"1805.07998","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07998","created_at":"2026-05-18T00:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07998v2","created_at":"2026-05-18T00:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07998","created_at":"2026-05-18T00:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"RPD64W6CFL6R","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RPD64W6CFL6RIDPP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RPD64W6C","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:b0703ef0bd34562b81e60532c2e026cdffdb9e358a04a1d4e2a6db1f2e6aa41d","target":"graph","created_at":"2026-05-18T00:13:57Z","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":"Scientific applications are complex, large, and often exhibit irregular and stochastic behavior. The use of efficient loop scheduling techniques in computationally-intensive applications is crucial for improving their performance on high-performance computing (HPC) platforms. A number of dynamic loop scheduling (DLS) techniques have been proposed between the late 1980s and early 2000s, and efficiently used in scientific applications. In most cases, the computing systems on which they have been tested and validated are no longer available. This work is concerned with the minimization of the sou","authors_text":"Ahmed Eleliemy, Ali Mohammed, Florina M. Ciorba","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-21T11:46:49Z","title":"Performance Reproduction and Prediction of Selected Dynamic Loop Scheduling Experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07998","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:cb15945a5af540551ec514e3970b04874153b864adcf776221af09dd2a22bae8","target":"record","created_at":"2026-05-18T00:13:57Z","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":"ec744bf91fa92a27822e8ea541e8d22a5452dee639691c89c24266926fad8056","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-21T11:46:49Z","title_canon_sha256":"3876e83abc52c7db4bf7d8eaa153fb8ca91f4f7aac917e4a35bf856c2249badd"},"schema_version":"1.0","source":{"id":"1805.07998","kind":"arxiv","version":2}},"canonical_sha256":"8bc7ee5bc22afd140def8dbcbeae44589443db4858f68f8fda2b0451fd395298","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bc7ee5bc22afd140def8dbcbeae44589443db4858f68f8fda2b0451fd395298","first_computed_at":"2026-05-18T00:13:57.476823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:57.476823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JA+gQf20R9KZLbE6IaAwhYW0akoB+bc+1N9Bij9MDMOLSiC7q4oDRHRiZPU930AgkFW1Zgynug+tthngj3itDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:57.477689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07998","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb15945a5af540551ec514e3970b04874153b864adcf776221af09dd2a22bae8","sha256:b0703ef0bd34562b81e60532c2e026cdffdb9e358a04a1d4e2a6db1f2e6aa41d"],"state_sha256":"8ba615637fcba026b79785901785a7d119046835a2966e1d363623703642a85f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s49H6QJvaGKNEJCKFoFfWGk7p4ua25I52y5b89fN5+fE3Sk743nDbAaEoyi83Pr2UE+rspudSh2yoopWk7TsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:12:22.504334Z","bundle_sha256":"dc5b269d572489f80fe2b51aa5f6064a9ab1cb8dd14a8b133ea4a5763c92ee04"}}