{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LLY4YGHEXO5OWEQJG7WVI3FU7S","short_pith_number":"pith:LLY4YGHE","canonical_record":{"source":{"id":"1907.03631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-08T14:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"6b5f1cf1d1810e319df68f2ecb2cb7525eacb60fcd6c355942057efa4bd85878","abstract_canon_sha256":"67b77899d02be01e21ad47e5d81269c33c57b8cb69d604396cb077039c811521"},"schema_version":"1.0"},"canonical_sha256":"5af1cc18e4bbbaeb120937ed546cb4fcb672db15a8b8ee847635aa5d8859fb27","source":{"kind":"arxiv","id":"1907.03631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03631","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03631v1","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03631","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"LLY4YGHEXO5O","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LLY4YGHEXO5OWEQJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LLY4YGHE","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LLY4YGHEXO5OWEQJG7WVI3FU7S","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-08T14:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"6b5f1cf1d1810e319df68f2ecb2cb7525eacb60fcd6c355942057efa4bd85878","abstract_canon_sha256":"67b77899d02be01e21ad47e5d81269c33c57b8cb69d604396cb077039c811521"},"schema_version":"1.0"},"canonical_sha256":"5af1cc18e4bbbaeb120937ed546cb4fcb672db15a8b8ee847635aa5d8859fb27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:14.135483Z","signature_b64":"gKXbt2PAX07+p7vvBFQzlP9+8ioOm9vIrtinPr2+oX9G5TRGwb4Gm4MCofc0RUr8qpSqpMvd70sowwM/uSP6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5af1cc18e4bbbaeb120937ed546cb4fcb672db15a8b8ee847635aa5d8859fb27","last_reissued_at":"2026-05-17T23:41:14.135025Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:14.135025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03631","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:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NS4gST2+6sEuHnyXDFmkJThX2tH/S6lxjid/kGKxhZuPK9CpbyyS0n+gG7ssuk/IQlxseyV3jzvsaDxAcq4sAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:19:31.789425Z"},"content_sha256":"9a94b392fa75756b1ff70205dae96ea18a0e36bcdb3818557a7d9920308da907","schema_version":"1.0","event_id":"sha256:9a94b392fa75756b1ff70205dae96ea18a0e36bcdb3818557a7d9920308da907"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LLY4YGHEXO5OWEQJG7WVI3FU7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$\\unicode{8523}$ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Federico Aschieri, Francesco A. Genco","submitted_at":"2019-07-08T14:08:53Z","abstract_excerpt":"Along the lines of the Abramsky ``Proofs-as-Processes'' program, we present an interpretation of multiplicative linear logic as typing system for concurrent functional programming. In particular, we study a linear multiple-conclusion natural deduction system and show it is isomorphic to a simple and natural extension of $\\lambda$-calculus with parallelism and communication primitives, called $\\lambda_{\\unicode{8523}}$. We shall prove that $\\lambda_{\\unicode{8523}}$ satisfies all the desirable properties for a typed programming language: subject reduction, progress, strong normalization and con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03631","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:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPJxnKU37z+ZVhY+Wveyzpi2cXNMOtoDsqMnPRnSEgJSh9uM6XOnaBqsy9oCjGMRbPLfapRmXtZq059aFp1KAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:19:31.790011Z"},"content_sha256":"98495b73c30cfe33ddb51ecdb68d0b7a4f0a81baf0ce497fb6625c265d19040c","schema_version":"1.0","event_id":"sha256:98495b73c30cfe33ddb51ecdb68d0b7a4f0a81baf0ce497fb6625c265d19040c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/bundle.json","state_url":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/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-25T21:19:31Z","links":{"resolver":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S","bundle":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/bundle.json","state":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LLY4YGHEXO5OWEQJG7WVI3FU7S","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":"67b77899d02be01e21ad47e5d81269c33c57b8cb69d604396cb077039c811521","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-08T14:08:53Z","title_canon_sha256":"6b5f1cf1d1810e319df68f2ecb2cb7525eacb60fcd6c355942057efa4bd85878"},"schema_version":"1.0","source":{"id":"1907.03631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03631","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03631v1","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03631","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"LLY4YGHEXO5O","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LLY4YGHEXO5OWEQJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LLY4YGHE","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:98495b73c30cfe33ddb51ecdb68d0b7a4f0a81baf0ce497fb6625c265d19040c","target":"graph","created_at":"2026-05-17T23:41:14Z","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":"Along the lines of the Abramsky ``Proofs-as-Processes'' program, we present an interpretation of multiplicative linear logic as typing system for concurrent functional programming. In particular, we study a linear multiple-conclusion natural deduction system and show it is isomorphic to a simple and natural extension of $\\lambda$-calculus with parallelism and communication primitives, called $\\lambda_{\\unicode{8523}}$. We shall prove that $\\lambda_{\\unicode{8523}}$ satisfies all the desirable properties for a typed programming language: subject reduction, progress, strong normalization and con","authors_text":"Federico Aschieri, Francesco A. Genco","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-08T14:08:53Z","title":"$\\unicode{8523}$ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03631","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:9a94b392fa75756b1ff70205dae96ea18a0e36bcdb3818557a7d9920308da907","target":"record","created_at":"2026-05-17T23:41:14Z","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":"67b77899d02be01e21ad47e5d81269c33c57b8cb69d604396cb077039c811521","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-08T14:08:53Z","title_canon_sha256":"6b5f1cf1d1810e319df68f2ecb2cb7525eacb60fcd6c355942057efa4bd85878"},"schema_version":"1.0","source":{"id":"1907.03631","kind":"arxiv","version":1}},"canonical_sha256":"5af1cc18e4bbbaeb120937ed546cb4fcb672db15a8b8ee847635aa5d8859fb27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5af1cc18e4bbbaeb120937ed546cb4fcb672db15a8b8ee847635aa5d8859fb27","first_computed_at":"2026-05-17T23:41:14.135025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:14.135025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gKXbt2PAX07+p7vvBFQzlP9+8ioOm9vIrtinPr2+oX9G5TRGwb4Gm4MCofc0RUr8qpSqpMvd70sowwM/uSP6DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:14.135483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a94b392fa75756b1ff70205dae96ea18a0e36bcdb3818557a7d9920308da907","sha256:98495b73c30cfe33ddb51ecdb68d0b7a4f0a81baf0ce497fb6625c265d19040c"],"state_sha256":"3f46b6b7ac0074c227573b96dda02ea7c3f4013c46c4321d60e18cf94b88d2ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Zmbr12pU0duxmTysk+uGPTjFlY+ujT2OZFAhlVXdyUwIFFhFMg3pPf4rpzdnTp3QjvxCyCOF3mdg+3E3ZiCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:19:31.793202Z","bundle_sha256":"7b01baf49873da433b7b892d626852f6537c35144b1d5827fe37e0a3d0136239"}}