{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:HQP2YSQWLH2ECP3H6FXIJ2UDQ7","short_pith_number":"pith:HQP2YSQW","canonical_record":{"source":{"id":"2008.00553","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-02T19:53:52Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"a2ed694f43e13fcfe8cce195a0deb8280780e843af9e10a421202dadabd3413f","abstract_canon_sha256":"f10c7fa6462aa56da52603eadeb2dc28e373a49075d25b2641e6fd2987249fcb"},"schema_version":"1.0"},"canonical_sha256":"3c1fac4a1659f4413f67f16e84ea8387c6e63d71756e19a222ed48881aaa5c16","source":{"kind":"arxiv","id":"2008.00553","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.00553","created_at":"2026-07-05T03:30:49Z"},{"alias_kind":"arxiv_version","alias_value":"2008.00553v4","created_at":"2026-07-05T03:30:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.00553","created_at":"2026-07-05T03:30:49Z"},{"alias_kind":"pith_short_12","alias_value":"HQP2YSQWLH2E","created_at":"2026-07-05T03:30:49Z"},{"alias_kind":"pith_short_16","alias_value":"HQP2YSQWLH2ECP3H","created_at":"2026-07-05T03:30:49Z"},{"alias_kind":"pith_short_8","alias_value":"HQP2YSQW","created_at":"2026-07-05T03:30:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:HQP2YSQWLH2ECP3H6FXIJ2UDQ7","target":"record","payload":{"canonical_record":{"source":{"id":"2008.00553","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-02T19:53:52Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"a2ed694f43e13fcfe8cce195a0deb8280780e843af9e10a421202dadabd3413f","abstract_canon_sha256":"f10c7fa6462aa56da52603eadeb2dc28e373a49075d25b2641e6fd2987249fcb"},"schema_version":"1.0"},"canonical_sha256":"3c1fac4a1659f4413f67f16e84ea8387c6e63d71756e19a222ed48881aaa5c16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:30:49.989022Z","signature_b64":"xQo4SHkg3saeU/EjS4MuvpnueM78QHCuZ8+wOXMnDlCP+349wCKyX+cN4WjriKh9CZr0/3B05MMTBsp7gbUOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c1fac4a1659f4413f67f16e84ea8387c6e63d71756e19a222ed48881aaa5c16","last_reissued_at":"2026-07-05T03:30:49.988594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:30:49.988594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.00553","source_version":4,"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-05T03:30:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uWegj6x6lf8AfFd/8U3REdp/J5mxReHzeDnTeAYgBvOXb+tnHrUoNbE3aFvwIWo5b0RfhEcTEdkNRcx+bMiVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:31:24.125068Z"},"content_sha256":"36721a33be08bb7da48490bdabee950d312399e21143f55a74ce33b7ce0b1587","schema_version":"1.0","event_id":"sha256:36721a33be08bb7da48490bdabee950d312399e21143f55a74ce33b7ce0b1587"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:HQP2YSQWLH2ECP3H6FXIJ2UDQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unifying Framework for Parallel and Distributed Processing in R using Futures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.DC","authors_text":"Henrik Bengtsson","submitted_at":"2020-08-02T19:53:52Z","abstract_excerpt":"A future is a programming construct designed for concurrent and asynchronous evaluation of code, making it particularly useful for parallel processing. The future package implements the Future API for programming with futures in R. This minimal API provides sufficient constructs for implementing parallel versions of well-established, high-level map-reduce APIs. The future ecosystem supports exception handling, output and condition relaying, parallel random number generation, and automatic identification of globals lowering the threshold to parallelize code. The Future API bridges parallel fron"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.00553","kind":"arxiv","version":4},"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/2008.00553/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-05T03:30:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rIpqfnPqnLu9rpTeR91z/8uqOdIf4zS8YE7x4Xvo5d44R4nVmt8ylIHrXsN3R4tEgpUT1ZlUiq8nOHIgOMd+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:31:24.130370Z"},"content_sha256":"fc32f5d98a1e6cb568fa5b65b5941737a184de963e8bbcb2c884ebb855608e10","schema_version":"1.0","event_id":"sha256:fc32f5d98a1e6cb568fa5b65b5941737a184de963e8bbcb2c884ebb855608e10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQP2YSQWLH2ECP3H6FXIJ2UDQ7/bundle.json","state_url":"https://pith.science/pith/HQP2YSQWLH2ECP3H6FXIJ2UDQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQP2YSQWLH2ECP3H6FXIJ2UDQ7/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-08-07T18:31:24Z","links":{"resolver":"https://pith.science/pith/HQP2YSQWLH2ECP3H6FXIJ2UDQ7","bundle":"https://pith.science/pith/HQP2YSQWLH2ECP3H6FXIJ2UDQ7/bundle.json","state":"https://pith.science/pith/HQP2YSQWLH2ECP3H6FXIJ2UDQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQP2YSQWLH2ECP3H6FXIJ2UDQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HQP2YSQWLH2ECP3H6FXIJ2UDQ7","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":"f10c7fa6462aa56da52603eadeb2dc28e373a49075d25b2641e6fd2987249fcb","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-02T19:53:52Z","title_canon_sha256":"a2ed694f43e13fcfe8cce195a0deb8280780e843af9e10a421202dadabd3413f"},"schema_version":"1.0","source":{"id":"2008.00553","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.00553","created_at":"2026-07-05T03:30:49Z"},{"alias_kind":"arxiv_version","alias_value":"2008.00553v4","created_at":"2026-07-05T03:30:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.00553","created_at":"2026-07-05T03:30:49Z"},{"alias_kind":"pith_short_12","alias_value":"HQP2YSQWLH2E","created_at":"2026-07-05T03:30:49Z"},{"alias_kind":"pith_short_16","alias_value":"HQP2YSQWLH2ECP3H","created_at":"2026-07-05T03:30:49Z"},{"alias_kind":"pith_short_8","alias_value":"HQP2YSQW","created_at":"2026-07-05T03:30:49Z"}],"graph_snapshots":[{"event_id":"sha256:fc32f5d98a1e6cb568fa5b65b5941737a184de963e8bbcb2c884ebb855608e10","target":"graph","created_at":"2026-07-05T03:30:49Z","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/2008.00553/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A future is a programming construct designed for concurrent and asynchronous evaluation of code, making it particularly useful for parallel processing. The future package implements the Future API for programming with futures in R. This minimal API provides sufficient constructs for implementing parallel versions of well-established, high-level map-reduce APIs. The future ecosystem supports exception handling, output and condition relaying, parallel random number generation, and automatic identification of globals lowering the threshold to parallelize code. The Future API bridges parallel fron","authors_text":"Henrik Bengtsson","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-02T19:53:52Z","title":"A Unifying Framework for Parallel and Distributed Processing in R using Futures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.00553","kind":"arxiv","version":4},"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:36721a33be08bb7da48490bdabee950d312399e21143f55a74ce33b7ce0b1587","target":"record","created_at":"2026-07-05T03:30:49Z","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":"f10c7fa6462aa56da52603eadeb2dc28e373a49075d25b2641e6fd2987249fcb","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-02T19:53:52Z","title_canon_sha256":"a2ed694f43e13fcfe8cce195a0deb8280780e843af9e10a421202dadabd3413f"},"schema_version":"1.0","source":{"id":"2008.00553","kind":"arxiv","version":4}},"canonical_sha256":"3c1fac4a1659f4413f67f16e84ea8387c6e63d71756e19a222ed48881aaa5c16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c1fac4a1659f4413f67f16e84ea8387c6e63d71756e19a222ed48881aaa5c16","first_computed_at":"2026-07-05T03:30:49.988594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:30:49.988594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xQo4SHkg3saeU/EjS4MuvpnueM78QHCuZ8+wOXMnDlCP+349wCKyX+cN4WjriKh9CZr0/3B05MMTBsp7gbUOBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:30:49.989022Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.00553","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36721a33be08bb7da48490bdabee950d312399e21143f55a74ce33b7ce0b1587","sha256:fc32f5d98a1e6cb568fa5b65b5941737a184de963e8bbcb2c884ebb855608e10"],"state_sha256":"d6af41590183c1582daba10503c9e0f246f265571ef91a296b5ecc6a84ccf990"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUHmJkfPK6b4BbV+ACWQr9yWzlq4EhEfDEeawIOQkEyXuGYWEC6wFBAnKmkLVtrch2qAUnVZPG1dM6ue/ugLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T18:31:24.153652Z","bundle_sha256":"2154f5fca7148d579f580bf03ac5e4de3406c5e2344a14abc8322b6f99a637d6"}}