{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GEBV3Y5IUEVE4RQNK6Z7GQIFRD","short_pith_number":"pith:GEBV3Y5I","canonical_record":{"source":{"id":"1906.08911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T01:47:32Z","cross_cats_sorted":["cs.CL","cs.PF","cs.PL"],"title_canon_sha256":"3503a49811adccae931b488e53122758df90f2e95357e19505516923e9059d66","abstract_canon_sha256":"192bbe40eab55b970de8a783a335cf7bc8979626739ac46b0fea9193feae95ed"},"schema_version":"1.0"},"canonical_sha256":"31035de3a8a12a4e460d57b3f3410588c42457b91b0e0cd529840c0361637fb8","source":{"kind":"arxiv","id":"1906.08911","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08911","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08911v2","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08911","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"pith_short_12","alias_value":"GEBV3Y5IUEVE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GEBV3Y5IUEVE4RQN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GEBV3Y5I","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GEBV3Y5IUEVE4RQNK6Z7GQIFRD","target":"record","payload":{"canonical_record":{"source":{"id":"1906.08911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T01:47:32Z","cross_cats_sorted":["cs.CL","cs.PF","cs.PL"],"title_canon_sha256":"3503a49811adccae931b488e53122758df90f2e95357e19505516923e9059d66","abstract_canon_sha256":"192bbe40eab55b970de8a783a335cf7bc8979626739ac46b0fea9193feae95ed"},"schema_version":"1.0"},"canonical_sha256":"31035de3a8a12a4e460d57b3f3410588c42457b91b0e0cd529840c0361637fb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:07.549546Z","signature_b64":"g2W88NSYsfFZQMa8OFFYSaJ+bUjmVvCsYJvG2Qxm2AoFjkUiNJRWkTdkyhPSsdP5iJK0G4OkG5Pw/sYLM50YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31035de3a8a12a4e460d57b3f3410588c42457b91b0e0cd529840c0361637fb8","last_reissued_at":"2026-05-17T23:41:07.548916Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:07.548916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.08911","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-17T23:41:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFZDPTEnYhs0zlBK//HGW3+PXwqANM77xOybnnYsD6IPYE9kIZ2NLqDJByGI1KS5JusfWMgmVw7xPHTou6SmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:09:38.582417Z"},"content_sha256":"424cd2a50646766ca65ada132c181633ee21189627c78cc9fa22da068e931f93","schema_version":"1.0","event_id":"sha256:424cd2a50646766ca65ada132c181633ee21189627c78cc9fa22da068e931f93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GEBV3Y5IUEVE4RQNK6Z7GQIFRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Toward a Standard Interface for User-Defined Scheduling in OpenMP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.PF","cs.PL"],"primary_cat":"cs.DC","authors_text":"Christian Iwainsky, Florina M. Ciorba, Jonas H. Muller Korndorfer, Michael Klemm, Vivek Kale","submitted_at":"2019-06-21T01:47:32Z","abstract_excerpt":"Parallel loops are an important part of OpenMP programs. Efficient scheduling of parallel loops can improve performance of the programs. The current OpenMP specification only offers three options for loop scheduling, which are insufficient in certain instances. Given the large number of other possible scheduling strategies, it is infeasible to standardize each one. A more viable approach is to extend the OpenMP standard to allow for users to define loop scheduling strategies. The approach will enable standard-compliant application-specific scheduling. This work analyzes the principal component"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08911","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-17T23:41:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLYvCbBI3DkoobiZmj7Oai6Eh++Y7ypsl3oXaIF5zJMY7dcXJcADDl3ySnTSSAdfCN7tWDQNcRBxHNGYspGXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:09:38.582812Z"},"content_sha256":"dedbfa5cd6087c5f974eb3a0c6ea9bef337b4f450ca3096db6d644cf1481b20c","schema_version":"1.0","event_id":"sha256:dedbfa5cd6087c5f974eb3a0c6ea9bef337b4f450ca3096db6d644cf1481b20c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEBV3Y5IUEVE4RQNK6Z7GQIFRD/bundle.json","state_url":"https://pith.science/pith/GEBV3Y5IUEVE4RQNK6Z7GQIFRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEBV3Y5IUEVE4RQNK6Z7GQIFRD/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-04T10:09:38Z","links":{"resolver":"https://pith.science/pith/GEBV3Y5IUEVE4RQNK6Z7GQIFRD","bundle":"https://pith.science/pith/GEBV3Y5IUEVE4RQNK6Z7GQIFRD/bundle.json","state":"https://pith.science/pith/GEBV3Y5IUEVE4RQNK6Z7GQIFRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEBV3Y5IUEVE4RQNK6Z7GQIFRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GEBV3Y5IUEVE4RQNK6Z7GQIFRD","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":"192bbe40eab55b970de8a783a335cf7bc8979626739ac46b0fea9193feae95ed","cross_cats_sorted":["cs.CL","cs.PF","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T01:47:32Z","title_canon_sha256":"3503a49811adccae931b488e53122758df90f2e95357e19505516923e9059d66"},"schema_version":"1.0","source":{"id":"1906.08911","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08911","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08911v2","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08911","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"pith_short_12","alias_value":"GEBV3Y5IUEVE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GEBV3Y5IUEVE4RQN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GEBV3Y5I","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:dedbfa5cd6087c5f974eb3a0c6ea9bef337b4f450ca3096db6d644cf1481b20c","target":"graph","created_at":"2026-05-17T23:41:07Z","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":"Parallel loops are an important part of OpenMP programs. Efficient scheduling of parallel loops can improve performance of the programs. The current OpenMP specification only offers three options for loop scheduling, which are insufficient in certain instances. Given the large number of other possible scheduling strategies, it is infeasible to standardize each one. A more viable approach is to extend the OpenMP standard to allow for users to define loop scheduling strategies. The approach will enable standard-compliant application-specific scheduling. This work analyzes the principal component","authors_text":"Christian Iwainsky, Florina M. Ciorba, Jonas H. Muller Korndorfer, Michael Klemm, Vivek Kale","cross_cats":["cs.CL","cs.PF","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T01:47:32Z","title":"Toward a Standard Interface for User-Defined Scheduling in OpenMP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08911","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:424cd2a50646766ca65ada132c181633ee21189627c78cc9fa22da068e931f93","target":"record","created_at":"2026-05-17T23:41:07Z","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":"192bbe40eab55b970de8a783a335cf7bc8979626739ac46b0fea9193feae95ed","cross_cats_sorted":["cs.CL","cs.PF","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T01:47:32Z","title_canon_sha256":"3503a49811adccae931b488e53122758df90f2e95357e19505516923e9059d66"},"schema_version":"1.0","source":{"id":"1906.08911","kind":"arxiv","version":2}},"canonical_sha256":"31035de3a8a12a4e460d57b3f3410588c42457b91b0e0cd529840c0361637fb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31035de3a8a12a4e460d57b3f3410588c42457b91b0e0cd529840c0361637fb8","first_computed_at":"2026-05-17T23:41:07.548916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:07.548916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g2W88NSYsfFZQMa8OFFYSaJ+bUjmVvCsYJvG2Qxm2AoFjkUiNJRWkTdkyhPSsdP5iJK0G4OkG5Pw/sYLM50YAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:07.549546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.08911","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:424cd2a50646766ca65ada132c181633ee21189627c78cc9fa22da068e931f93","sha256:dedbfa5cd6087c5f974eb3a0c6ea9bef337b4f450ca3096db6d644cf1481b20c"],"state_sha256":"d0476eb3cbe153c49d30d58dd219812864097a5024451ec9849609cbac8e827a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9z+vg4yzVo1nTETPQDBY8qbAR/MSh1x2h2CJGk8mlc1jEzJ07TqS2zeuOHUDfCiaoA8+nqK+YoNUcppwdd2ZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:09:38.584960Z","bundle_sha256":"e5cada0f08ca9644e90bd8516193468169653802d2edca5d9ba72c62c944da0a"}}