{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3OP5DQEFL4CGKX2BJHPGDLNLNC","short_pith_number":"pith:3OP5DQEF","canonical_record":{"source":{"id":"2402.18480","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-02-28T17:00:33Z","cross_cats_sorted":[],"title_canon_sha256":"240c772136aed7c29bfd85bf00fdf5f5d0dcd1ea151270294ed4cd9f462e6322","abstract_canon_sha256":"ce9aa8403e8ef4ab82b87a8ce02e503d3d9ffdbdf37b64fddd73ca31806586da"},"schema_version":"1.0"},"canonical_sha256":"db9fd1c0855f04655f4149de61adab6890f19144675a825f17c5adf3a34a4075","source":{"kind":"arxiv","id":"2402.18480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.18480","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"arxiv_version","alias_value":"2402.18480v1","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18480","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_12","alias_value":"3OP5DQEFL4CG","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_16","alias_value":"3OP5DQEFL4CGKX2B","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_8","alias_value":"3OP5DQEF","created_at":"2026-07-05T07:50:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3OP5DQEFL4CGKX2BJHPGDLNLNC","target":"record","payload":{"canonical_record":{"source":{"id":"2402.18480","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-02-28T17:00:33Z","cross_cats_sorted":[],"title_canon_sha256":"240c772136aed7c29bfd85bf00fdf5f5d0dcd1ea151270294ed4cd9f462e6322","abstract_canon_sha256":"ce9aa8403e8ef4ab82b87a8ce02e503d3d9ffdbdf37b64fddd73ca31806586da"},"schema_version":"1.0"},"canonical_sha256":"db9fd1c0855f04655f4149de61adab6890f19144675a825f17c5adf3a34a4075","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:16.615433Z","signature_b64":"Y0A1qpp6gjxoYGeFq8wYbcoLUviVnp327SVCO3mLhxpJ9wGDtQEfDxmvs0y7BEhYdCAba9lM59qeYqFnOe0FBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db9fd1c0855f04655f4149de61adab6890f19144675a825f17c5adf3a34a4075","last_reissued_at":"2026-07-05T07:50:16.614938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:16.614938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.18480","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-05T07:50:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3q1ErJ45ghAIjuqLyeo3L0Md3UDIz5UgazEjDSMUHUbgYqzdDePO1sTK1LFjVCaoGWIBGvEE+KI0yh6gb6vtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T21:33:16.381633Z"},"content_sha256":"a5d7069f7fd34d258cb86ca78a0d9516b014fc6030520d13774dcce6f26dd81e","schema_version":"1.0","event_id":"sha256:a5d7069f7fd34d258cb86ca78a0d9516b014fc6030520d13774dcce6f26dd81e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3OP5DQEFL4CGKX2BJHPGDLNLNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Libfork: portable continuation-stealing with stackless coroutines","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Conor John Williams, James Elliott","submitted_at":"2024-02-28T17:00:33Z","abstract_excerpt":"Fully-strict fork-join parallelism is a powerful model for shared-memory programming due to its optimal time scaling and strong bounds on memory scaling. The latter is rarely achieved due to the difficulty of implementing continuation stealing in traditional High Performance Computing (HPC) languages -- where it is often impossible without modifying the compiler or resorting to non-portable techniques. We demonstrate how stackless coroutines (a new feature in C++20) can enable fully-portable continuation stealing and present libfork a lock-free fine-grained parallelism library, combining corou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18480","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/2402.18480/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-05T07:50:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+z0mQvHWSCKGKomx0fwuOLhPQxal1pOA4rdvW6BAiF34yIsP8Hyf2NJud1tyLEDByVk6ORMWAqZ5FtjjYNgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T21:33:16.382147Z"},"content_sha256":"489c2fb51d69a7f281cbeb8f5ee50445e27cb671ab11eeb1f92226cfcda07ba5","schema_version":"1.0","event_id":"sha256:489c2fb51d69a7f281cbeb8f5ee50445e27cb671ab11eeb1f92226cfcda07ba5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OP5DQEFL4CGKX2BJHPGDLNLNC/bundle.json","state_url":"https://pith.science/pith/3OP5DQEFL4CGKX2BJHPGDLNLNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OP5DQEFL4CGKX2BJHPGDLNLNC/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-19T21:33:16Z","links":{"resolver":"https://pith.science/pith/3OP5DQEFL4CGKX2BJHPGDLNLNC","bundle":"https://pith.science/pith/3OP5DQEFL4CGKX2BJHPGDLNLNC/bundle.json","state":"https://pith.science/pith/3OP5DQEFL4CGKX2BJHPGDLNLNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OP5DQEFL4CGKX2BJHPGDLNLNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3OP5DQEFL4CGKX2BJHPGDLNLNC","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":"ce9aa8403e8ef4ab82b87a8ce02e503d3d9ffdbdf37b64fddd73ca31806586da","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-02-28T17:00:33Z","title_canon_sha256":"240c772136aed7c29bfd85bf00fdf5f5d0dcd1ea151270294ed4cd9f462e6322"},"schema_version":"1.0","source":{"id":"2402.18480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.18480","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"arxiv_version","alias_value":"2402.18480v1","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18480","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_12","alias_value":"3OP5DQEFL4CG","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_16","alias_value":"3OP5DQEFL4CGKX2B","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_8","alias_value":"3OP5DQEF","created_at":"2026-07-05T07:50:16Z"}],"graph_snapshots":[{"event_id":"sha256:489c2fb51d69a7f281cbeb8f5ee50445e27cb671ab11eeb1f92226cfcda07ba5","target":"graph","created_at":"2026-07-05T07:50:16Z","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/2402.18480/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fully-strict fork-join parallelism is a powerful model for shared-memory programming due to its optimal time scaling and strong bounds on memory scaling. The latter is rarely achieved due to the difficulty of implementing continuation stealing in traditional High Performance Computing (HPC) languages -- where it is often impossible without modifying the compiler or resorting to non-portable techniques. We demonstrate how stackless coroutines (a new feature in C++20) can enable fully-portable continuation stealing and present libfork a lock-free fine-grained parallelism library, combining corou","authors_text":"Conor John Williams, James Elliott","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-02-28T17:00:33Z","title":"Libfork: portable continuation-stealing with stackless coroutines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18480","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:a5d7069f7fd34d258cb86ca78a0d9516b014fc6030520d13774dcce6f26dd81e","target":"record","created_at":"2026-07-05T07:50:16Z","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":"ce9aa8403e8ef4ab82b87a8ce02e503d3d9ffdbdf37b64fddd73ca31806586da","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-02-28T17:00:33Z","title_canon_sha256":"240c772136aed7c29bfd85bf00fdf5f5d0dcd1ea151270294ed4cd9f462e6322"},"schema_version":"1.0","source":{"id":"2402.18480","kind":"arxiv","version":1}},"canonical_sha256":"db9fd1c0855f04655f4149de61adab6890f19144675a825f17c5adf3a34a4075","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db9fd1c0855f04655f4149de61adab6890f19144675a825f17c5adf3a34a4075","first_computed_at":"2026-07-05T07:50:16.614938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:50:16.614938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y0A1qpp6gjxoYGeFq8wYbcoLUviVnp327SVCO3mLhxpJ9wGDtQEfDxmvs0y7BEhYdCAba9lM59qeYqFnOe0FBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:50:16.615433Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.18480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5d7069f7fd34d258cb86ca78a0d9516b014fc6030520d13774dcce6f26dd81e","sha256:489c2fb51d69a7f281cbeb8f5ee50445e27cb671ab11eeb1f92226cfcda07ba5"],"state_sha256":"9341cee4dbe832ce63abdfbbbaba87923bb82918472fd423de31882314881545"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OP8QpBMnZ6GuIc9E6FoZe7+URIVhIffMnlcAQK7FVkTpEJAXIudUCh8QMxGd3PKytkwDP5XCvtDaXNNX3eF4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T21:33:16.387143Z","bundle_sha256":"abec33050a9c5dc8f6919ca6398bcf757f86b9ffe50129e102f550d217ff58f2"}}