{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:K25LK4SXPXCK3SO3JAVE3DJTPE","short_pith_number":"pith:K25LK4SX","canonical_record":{"source":{"id":"2010.14133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-10-27T08:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"64dc217d8a975d81656cb831f772487e3b158ce5721e1850c1b786d280cb393a","abstract_canon_sha256":"16f8c854216bc6a5fa8aa0e732582a4376469b296f329e2d67ba51cdf1209805"},"schema_version":"1.0"},"canonical_sha256":"56bab572577dc4adc9db482a4d8d337911283a08d300e3da41b45e36423dd0aa","source":{"kind":"arxiv","id":"2010.14133","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.14133","created_at":"2026-07-05T01:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"2010.14133v1","created_at":"2026-07-05T01:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.14133","created_at":"2026-07-05T01:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"K25LK4SXPXCK","created_at":"2026-07-05T01:46:31Z"},{"alias_kind":"pith_short_16","alias_value":"K25LK4SXPXCK3SO3","created_at":"2026-07-05T01:46:31Z"},{"alias_kind":"pith_short_8","alias_value":"K25LK4SX","created_at":"2026-07-05T01:46:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:K25LK4SXPXCK3SO3JAVE3DJTPE","target":"record","payload":{"canonical_record":{"source":{"id":"2010.14133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-10-27T08:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"64dc217d8a975d81656cb831f772487e3b158ce5721e1850c1b786d280cb393a","abstract_canon_sha256":"16f8c854216bc6a5fa8aa0e732582a4376469b296f329e2d67ba51cdf1209805"},"schema_version":"1.0"},"canonical_sha256":"56bab572577dc4adc9db482a4d8d337911283a08d300e3da41b45e36423dd0aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:46:31.738521Z","signature_b64":"HQtAv7cgcGsvJfJTFX7yK7ovfcc0dMEzy8sJM+nkv8NvMkKDmIdM4eJGuUDZA5P4uoijcyW/MfzPOznYsGOBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56bab572577dc4adc9db482a4d8d337911283a08d300e3da41b45e36423dd0aa","last_reissued_at":"2026-07-05T01:46:31.738150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:46:31.738150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.14133","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-07-05T01:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3W67cG45aX4PBtxUGWtLvLFdHjfNRsZZa/GZUm1vpzq3nmu3CVIOk9/2rqWzqf260OZmyR6t5VWY+UzDT95CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T07:23:43.409335Z"},"content_sha256":"4944a54b56b13add618e06cb8ccac67d8b950eb5763fcc646ad24ec90253a9c7","schema_version":"1.0","event_id":"sha256:4944a54b56b13add618e06cb8ccac67d8b950eb5763fcc646ad24ec90253a9c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:K25LK4SXPXCK3SO3JAVE3DJTPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extended abstract: Type oriented programming for task based parallelism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"J. Mark Bull, Ludovic Capelli, Nick Brown","submitted_at":"2020-10-27T08:49:19Z","abstract_excerpt":"Writing parallel codes is difficult and exhibits a fundamental trade-off between abstraction and performance. The high level language abstractions designed to simplify the complexities of parallelism make certain assumptions that impacts performance and scalability. On the other hand lower level languages, providing many opportunities for optimisation, require in-depth knowledge and the programmer to consider tricky details of parallelism. An approach is required which can bridge the gap and provide both the ease of programming and opportunities for control and optimisation. By optionally deco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.14133","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/2010.14133/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-05T01:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fO1gjfw62MaSIeNz5fYx8iKYG+gXjAQGtnChieeqhjV1SYFt4r2kX5ztJNe4D28v3YM2es+0DEVq/UFilQlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T07:23:43.409739Z"},"content_sha256":"6ef45490f92f59fc0901ef5fb5d7243de19d21668db3273f631b56965f965bcc","schema_version":"1.0","event_id":"sha256:6ef45490f92f59fc0901ef5fb5d7243de19d21668db3273f631b56965f965bcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K25LK4SXPXCK3SO3JAVE3DJTPE/bundle.json","state_url":"https://pith.science/pith/K25LK4SXPXCK3SO3JAVE3DJTPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K25LK4SXPXCK3SO3JAVE3DJTPE/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-07-21T07:23:43Z","links":{"resolver":"https://pith.science/pith/K25LK4SXPXCK3SO3JAVE3DJTPE","bundle":"https://pith.science/pith/K25LK4SXPXCK3SO3JAVE3DJTPE/bundle.json","state":"https://pith.science/pith/K25LK4SXPXCK3SO3JAVE3DJTPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K25LK4SXPXCK3SO3JAVE3DJTPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:K25LK4SXPXCK3SO3JAVE3DJTPE","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":"16f8c854216bc6a5fa8aa0e732582a4376469b296f329e2d67ba51cdf1209805","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-10-27T08:49:19Z","title_canon_sha256":"64dc217d8a975d81656cb831f772487e3b158ce5721e1850c1b786d280cb393a"},"schema_version":"1.0","source":{"id":"2010.14133","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.14133","created_at":"2026-07-05T01:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"2010.14133v1","created_at":"2026-07-05T01:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.14133","created_at":"2026-07-05T01:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"K25LK4SXPXCK","created_at":"2026-07-05T01:46:31Z"},{"alias_kind":"pith_short_16","alias_value":"K25LK4SXPXCK3SO3","created_at":"2026-07-05T01:46:31Z"},{"alias_kind":"pith_short_8","alias_value":"K25LK4SX","created_at":"2026-07-05T01:46:31Z"}],"graph_snapshots":[{"event_id":"sha256:6ef45490f92f59fc0901ef5fb5d7243de19d21668db3273f631b56965f965bcc","target":"graph","created_at":"2026-07-05T01:46:31Z","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/2010.14133/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Writing parallel codes is difficult and exhibits a fundamental trade-off between abstraction and performance. The high level language abstractions designed to simplify the complexities of parallelism make certain assumptions that impacts performance and scalability. On the other hand lower level languages, providing many opportunities for optimisation, require in-depth knowledge and the programmer to consider tricky details of parallelism. An approach is required which can bridge the gap and provide both the ease of programming and opportunities for control and optimisation. By optionally deco","authors_text":"J. Mark Bull, Ludovic Capelli, Nick Brown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-10-27T08:49:19Z","title":"Extended abstract: Type oriented programming for task based parallelism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.14133","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:4944a54b56b13add618e06cb8ccac67d8b950eb5763fcc646ad24ec90253a9c7","target":"record","created_at":"2026-07-05T01:46:31Z","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":"16f8c854216bc6a5fa8aa0e732582a4376469b296f329e2d67ba51cdf1209805","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-10-27T08:49:19Z","title_canon_sha256":"64dc217d8a975d81656cb831f772487e3b158ce5721e1850c1b786d280cb393a"},"schema_version":"1.0","source":{"id":"2010.14133","kind":"arxiv","version":1}},"canonical_sha256":"56bab572577dc4adc9db482a4d8d337911283a08d300e3da41b45e36423dd0aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56bab572577dc4adc9db482a4d8d337911283a08d300e3da41b45e36423dd0aa","first_computed_at":"2026-07-05T01:46:31.738150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:46:31.738150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HQtAv7cgcGsvJfJTFX7yK7ovfcc0dMEzy8sJM+nkv8NvMkKDmIdM4eJGuUDZA5P4uoijcyW/MfzPOznYsGOBDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:46:31.738521Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.14133","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4944a54b56b13add618e06cb8ccac67d8b950eb5763fcc646ad24ec90253a9c7","sha256:6ef45490f92f59fc0901ef5fb5d7243de19d21668db3273f631b56965f965bcc"],"state_sha256":"b903b6ecd7b520204b49e29864b5fc42bee4767cfe597533366a1457189492fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rOJD/8z/NyzwtHq3UkX5YUYSCMPBANnOWOuiC2JW8jJ8S0q9g9WYIBCKRNFsBCB7ZqpNvgHPihb+d+IS/9pvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T07:23:43.411986Z","bundle_sha256":"2555115f7177fcb563bee9beb3b2ea8b9f763be6f676e171eb2269806a8ed219"}}