{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2SOY52EWNGHNWBQKSZRYA2SOYC","short_pith_number":"pith:2SOY52EW","canonical_record":{"source":{"id":"1906.03196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-07T16:05:21Z","cross_cats_sorted":[],"title_canon_sha256":"1dfbe55aa6d8c4b21cd8fbc36e0b5ec75383c232567dcd85be719dc41bfea192","abstract_canon_sha256":"6788b590908e33c53467a9e76a515c7b3d255829d2f9e93dbf466cac23849662"},"schema_version":"1.0"},"canonical_sha256":"d49d8ee896698edb060a9663806a4ec0a0aa6d8687ba2f9bc4afd50cf0846841","source":{"kind":"arxiv","id":"1906.03196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03196","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03196v1","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03196","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"2SOY52EWNGHN","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2SOY52EWNGHNWBQK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2SOY52EW","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2SOY52EWNGHNWBQKSZRYA2SOYC","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-07T16:05:21Z","cross_cats_sorted":[],"title_canon_sha256":"1dfbe55aa6d8c4b21cd8fbc36e0b5ec75383c232567dcd85be719dc41bfea192","abstract_canon_sha256":"6788b590908e33c53467a9e76a515c7b3d255829d2f9e93dbf466cac23849662"},"schema_version":"1.0"},"canonical_sha256":"d49d8ee896698edb060a9663806a4ec0a0aa6d8687ba2f9bc4afd50cf0846841","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:54.704244Z","signature_b64":"NW6tSFGqd84wHDGvrrgm68G+gu5NMqEQc3ycKXRHjjt/eoFLOeKtLbWx5kBKSdWxLGPu5B2jbg7xsH6LMDNVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d49d8ee896698edb060a9663806a4ec0a0aa6d8687ba2f9bc4afd50cf0846841","last_reissued_at":"2026-05-17T23:43:54.703618Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:54.703618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03196","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-17T23:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMvwRb/mijoEWglgwbLaxyJJ/lkVsPe/sMlInqzF0SR215VrXuJnoCFm3zMkMuO7EYBWj/pIAIq2G+Nd7EBXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:32:00.498235Z"},"content_sha256":"261f81e3fff0f216b9fa229a72147a25384d0711048209b7be6c01abebc826c4","schema_version":"1.0","event_id":"sha256:261f81e3fff0f216b9fa229a72147a25384d0711048209b7be6c01abebc826c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2SOY52EWNGHNWBQKSZRYA2SOYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lightweight Parallel Foundations: a model-compliant communication layer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"A. N. Yzelman, Wijnand Suijlen","submitted_at":"2019-06-07T16:05:21Z","abstract_excerpt":"We present the Lightweight Parallel Foundations (LPF), an interoperable and model-compliant communication layer adhering to a strict performance model of parallel computations. LPF consists of twelve primitives, each with strict performance guarantees, two of which enable interoperability.\n  We argue that the principles of interoperability and model compliance suffice for the practical use of immortal algorithms: algorithms that are proven optimal once, and valid forever. These are ideally also implemented once, and usable from a wide range of sequential and parallel environments. This paradig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03196","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-17T23:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nXQk1nawhDiHONxDVrgnPgr9BGiqHx0ZEbOTv5Lh3r5+An74ReJnjX5JFHZ83wGR0OI8emgmh6PATfwd583/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:32:00.498657Z"},"content_sha256":"3d86d0ac942e3a81433053466186844732c631403c93e52ff2835cad19296ac0","schema_version":"1.0","event_id":"sha256:3d86d0ac942e3a81433053466186844732c631403c93e52ff2835cad19296ac0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SOY52EWNGHNWBQKSZRYA2SOYC/bundle.json","state_url":"https://pith.science/pith/2SOY52EWNGHNWBQKSZRYA2SOYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SOY52EWNGHNWBQKSZRYA2SOYC/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-25T23:32:00Z","links":{"resolver":"https://pith.science/pith/2SOY52EWNGHNWBQKSZRYA2SOYC","bundle":"https://pith.science/pith/2SOY52EWNGHNWBQKSZRYA2SOYC/bundle.json","state":"https://pith.science/pith/2SOY52EWNGHNWBQKSZRYA2SOYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SOY52EWNGHNWBQKSZRYA2SOYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2SOY52EWNGHNWBQKSZRYA2SOYC","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":"6788b590908e33c53467a9e76a515c7b3d255829d2f9e93dbf466cac23849662","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-07T16:05:21Z","title_canon_sha256":"1dfbe55aa6d8c4b21cd8fbc36e0b5ec75383c232567dcd85be719dc41bfea192"},"schema_version":"1.0","source":{"id":"1906.03196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03196","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03196v1","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03196","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"2SOY52EWNGHN","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2SOY52EWNGHNWBQK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2SOY52EW","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:3d86d0ac942e3a81433053466186844732c631403c93e52ff2835cad19296ac0","target":"graph","created_at":"2026-05-17T23:43:54Z","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":"We present the Lightweight Parallel Foundations (LPF), an interoperable and model-compliant communication layer adhering to a strict performance model of parallel computations. LPF consists of twelve primitives, each with strict performance guarantees, two of which enable interoperability.\n  We argue that the principles of interoperability and model compliance suffice for the practical use of immortal algorithms: algorithms that are proven optimal once, and valid forever. These are ideally also implemented once, and usable from a wide range of sequential and parallel environments. This paradig","authors_text":"A. N. Yzelman, Wijnand Suijlen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-07T16:05:21Z","title":"Lightweight Parallel Foundations: a model-compliant communication layer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03196","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:261f81e3fff0f216b9fa229a72147a25384d0711048209b7be6c01abebc826c4","target":"record","created_at":"2026-05-17T23:43:54Z","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":"6788b590908e33c53467a9e76a515c7b3d255829d2f9e93dbf466cac23849662","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-07T16:05:21Z","title_canon_sha256":"1dfbe55aa6d8c4b21cd8fbc36e0b5ec75383c232567dcd85be719dc41bfea192"},"schema_version":"1.0","source":{"id":"1906.03196","kind":"arxiv","version":1}},"canonical_sha256":"d49d8ee896698edb060a9663806a4ec0a0aa6d8687ba2f9bc4afd50cf0846841","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d49d8ee896698edb060a9663806a4ec0a0aa6d8687ba2f9bc4afd50cf0846841","first_computed_at":"2026-05-17T23:43:54.703618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:54.703618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NW6tSFGqd84wHDGvrrgm68G+gu5NMqEQc3ycKXRHjjt/eoFLOeKtLbWx5kBKSdWxLGPu5B2jbg7xsH6LMDNVAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:54.704244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:261f81e3fff0f216b9fa229a72147a25384d0711048209b7be6c01abebc826c4","sha256:3d86d0ac942e3a81433053466186844732c631403c93e52ff2835cad19296ac0"],"state_sha256":"bb44e44cc964791ce40e1542c83a8685d5d722594c6434abee1e739117c46bee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eytibKBR+DDPlbS2ViwH+RzJ67WQhyJRPRmtrE0INXt7lifWdn5IGKle6JGi1KDmbnXvqWm+SRhLQh1IBaz5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:32:00.500931Z","bundle_sha256":"c8a37b7224a2bd30796e44f60f70d35591bef046b20669c25529ad29b8c24e51"}}