{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A4KQRPSL72FDQMSRA3ADS6QILN","short_pith_number":"pith:A4KQRPSL","canonical_record":{"source":{"id":"1704.01513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-04-05T16:28:55Z","cross_cats_sorted":[],"title_canon_sha256":"a153d2c65b23bb90df69b1f486b29e849cc8bd2e6f5405d7d18dee95f7872ea4","abstract_canon_sha256":"abcf362deb75b63257844f7c86692bfd835c321e06fd7a8c3a0eb941bc040817"},"schema_version":"1.0"},"canonical_sha256":"071508be4bfe8a38325106c0397a085b4110a4de415a4fb2f9947d7ef4025d5d","source":{"kind":"arxiv","id":"1704.01513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01513","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01513v1","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01513","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"A4KQRPSL72FD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A4KQRPSL72FDQMSR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A4KQRPSL","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A4KQRPSL72FDQMSRA3ADS6QILN","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-04-05T16:28:55Z","cross_cats_sorted":[],"title_canon_sha256":"a153d2c65b23bb90df69b1f486b29e849cc8bd2e6f5405d7d18dee95f7872ea4","abstract_canon_sha256":"abcf362deb75b63257844f7c86692bfd835c321e06fd7a8c3a0eb941bc040817"},"schema_version":"1.0"},"canonical_sha256":"071508be4bfe8a38325106c0397a085b4110a4de415a4fb2f9947d7ef4025d5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:56.260588Z","signature_b64":"JxcVnIAfVqLH0GptzxbaVEZmI4Rw8OP1Pv+tKuujR2k2vkbCmbuRnv4pEkTlMM+V1JT1KVldVYoZcxTwJq9YBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"071508be4bfe8a38325106c0397a085b4110a4de415a4fb2f9947d7ef4025d5d","last_reissued_at":"2026-05-18T00:46:56.259943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:56.259943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01513","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-05-18T00:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Cu0NfawKND015auLNqUAZfoQbPCqR02mwAkwdpltvLFX/bbYf7P3YXYRLvkmW2S+PhEWY8IAM1R4egyfRK3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:56.010420Z"},"content_sha256":"2a683aac13b6ae0575a52389ace2e560becea9feafd3d195672de6e918f8450f","schema_version":"1.0","event_id":"sha256:2a683aac13b6ae0575a52389ace2e560becea9feafd3d195672de6e918f8450f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A4KQRPSL72FDQMSRA3ADS6QILN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Cognitive Computing for Learning Parallel Programming: An IBM Watson Solution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Adrian Calvo Chozas, Sabri Pllana, Suejb Memeti","submitted_at":"2017-04-05T16:28:55Z","abstract_excerpt":"While modern parallel computing systems provide high performance resources, utilizing them to the highest extent requires advanced programming expertise. Programming for parallel computing systems is much more difficult than programming for sequential systems. OpenMP is an extension of C++ programming language that enables to express parallelism using compiler directives. While OpenMP alleviates parallel programming by reducing the lines of code that the programmer needs to write, deciding how and when to use these compiler directives is up to the programmer. Novice programmers may make mistak"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01513","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":""},"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:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gKePRupuopGcxrmjkhABZArz0F05CdsrYIYrxnIrKzgKPu5yZ0TSN0Aftyz0C0xbjSisPrbHWFCUx5jrCW5sAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:56.010769Z"},"content_sha256":"5ea2c2954c89e85d8cc5b728266d4604c86988ef5392b7915ae2abd827993617","schema_version":"1.0","event_id":"sha256:5ea2c2954c89e85d8cc5b728266d4604c86988ef5392b7915ae2abd827993617"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4KQRPSL72FDQMSRA3ADS6QILN/bundle.json","state_url":"https://pith.science/pith/A4KQRPSL72FDQMSRA3ADS6QILN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4KQRPSL72FDQMSRA3ADS6QILN/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-05-27T13:49:56Z","links":{"resolver":"https://pith.science/pith/A4KQRPSL72FDQMSRA3ADS6QILN","bundle":"https://pith.science/pith/A4KQRPSL72FDQMSRA3ADS6QILN/bundle.json","state":"https://pith.science/pith/A4KQRPSL72FDQMSRA3ADS6QILN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4KQRPSL72FDQMSRA3ADS6QILN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A4KQRPSL72FDQMSRA3ADS6QILN","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":"abcf362deb75b63257844f7c86692bfd835c321e06fd7a8c3a0eb941bc040817","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-04-05T16:28:55Z","title_canon_sha256":"a153d2c65b23bb90df69b1f486b29e849cc8bd2e6f5405d7d18dee95f7872ea4"},"schema_version":"1.0","source":{"id":"1704.01513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01513","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01513v1","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01513","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"A4KQRPSL72FD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A4KQRPSL72FDQMSR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A4KQRPSL","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:5ea2c2954c89e85d8cc5b728266d4604c86988ef5392b7915ae2abd827993617","target":"graph","created_at":"2026-05-18T00:46:56Z","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":"While modern parallel computing systems provide high performance resources, utilizing them to the highest extent requires advanced programming expertise. Programming for parallel computing systems is much more difficult than programming for sequential systems. OpenMP is an extension of C++ programming language that enables to express parallelism using compiler directives. While OpenMP alleviates parallel programming by reducing the lines of code that the programmer needs to write, deciding how and when to use these compiler directives is up to the programmer. Novice programmers may make mistak","authors_text":"Adrian Calvo Chozas, Sabri Pllana, Suejb Memeti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-04-05T16:28:55Z","title":"Using Cognitive Computing for Learning Parallel Programming: An IBM Watson Solution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01513","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:2a683aac13b6ae0575a52389ace2e560becea9feafd3d195672de6e918f8450f","target":"record","created_at":"2026-05-18T00:46:56Z","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":"abcf362deb75b63257844f7c86692bfd835c321e06fd7a8c3a0eb941bc040817","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-04-05T16:28:55Z","title_canon_sha256":"a153d2c65b23bb90df69b1f486b29e849cc8bd2e6f5405d7d18dee95f7872ea4"},"schema_version":"1.0","source":{"id":"1704.01513","kind":"arxiv","version":1}},"canonical_sha256":"071508be4bfe8a38325106c0397a085b4110a4de415a4fb2f9947d7ef4025d5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"071508be4bfe8a38325106c0397a085b4110a4de415a4fb2f9947d7ef4025d5d","first_computed_at":"2026-05-18T00:46:56.259943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:56.259943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JxcVnIAfVqLH0GptzxbaVEZmI4Rw8OP1Pv+tKuujR2k2vkbCmbuRnv4pEkTlMM+V1JT1KVldVYoZcxTwJq9YBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:56.260588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a683aac13b6ae0575a52389ace2e560becea9feafd3d195672de6e918f8450f","sha256:5ea2c2954c89e85d8cc5b728266d4604c86988ef5392b7915ae2abd827993617"],"state_sha256":"32a4f8099f038136ae02bd0ac89a580d634315ad3b8235492f674dd1ed7082e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtH+NQSTT+/4wb8qavQlty2PR59RYdeYHW075RM4ifYVOL6V1d9J/Ux7gZTp2u/3DlNq1GTu2RpP2JYueDKODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:49:56.013447Z","bundle_sha256":"02e067d85239802ea324c83c6bdfb51d9c9876ac8f437284264490ca13215a11"}}