{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HSQZ4ZNTOEHSMBD2HTRFTFL2PU","short_pith_number":"pith:HSQZ4ZNT","canonical_record":{"source":{"id":"1710.09756","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2017-10-26T15:28:32Z","cross_cats_sorted":[],"title_canon_sha256":"2f1cc55a1d4e9f9111a269ce9fa48f7ea0295da8b818c7803e249e7017a97513","abstract_canon_sha256":"bda2ff3597e19d41893e22570155d86259065489d88b50baff7b8a1ab9ff0dfb"},"schema_version":"1.0"},"canonical_sha256":"3ca19e65b3710f26047a3ce259957a7d33858c5cab25a01316bd06f99080d845","source":{"kind":"arxiv","id":"1710.09756","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09756","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09756v2","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09756","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"HSQZ4ZNTOEHS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HSQZ4ZNTOEHSMBD2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HSQZ4ZNT","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HSQZ4ZNTOEHSMBD2HTRFTFL2PU","target":"record","payload":{"canonical_record":{"source":{"id":"1710.09756","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2017-10-26T15:28:32Z","cross_cats_sorted":[],"title_canon_sha256":"2f1cc55a1d4e9f9111a269ce9fa48f7ea0295da8b818c7803e249e7017a97513","abstract_canon_sha256":"bda2ff3597e19d41893e22570155d86259065489d88b50baff7b8a1ab9ff0dfb"},"schema_version":"1.0"},"canonical_sha256":"3ca19e65b3710f26047a3ce259957a7d33858c5cab25a01316bd06f99080d845","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:02.260446Z","signature_b64":"RhX8lGkrRrtA4VanyUDblEX0I8euJkA0PFTrc+ohiuvmtiGfyZ8uJo8JH/kBG+dAHaku1Z4xKKNM3zVzgEsvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ca19e65b3710f26047a3ce259957a7d33858c5cab25a01316bd06f99080d845","last_reissued_at":"2026-05-18T00:31:02.259747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:02.259747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.09756","source_version":2,"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-18T00:31:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpNrz7TjQATtjgQHfrN9u3csbl1K94+6yllcEjS5jhZk+MPVQsce0+1EZKHkuoce4nOm8xyN9y9aITHkHmyPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:42:46.515287Z"},"content_sha256":"d1e3d441110fdf32b38a0a2754c73d4b2a881a4efe6ab4d752a904fa9488e354","schema_version":"1.0","event_id":"sha256:d1e3d441110fdf32b38a0a2754c73d4b2a881a4efe6ab4d752a904fa9488e354"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HSQZ4ZNTOEHSMBD2HTRFTFL2PU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Haskell: practical linearity in a higher-order polymorphic language","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arnaud Spiwack, Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones","submitted_at":"2017-10-26T15:28:32Z","abstract_excerpt":"Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind: backwards-compatibility and code reuse across linear and non-linear users of a library. Only then can the benefits of linear types permeate conventional functional programming. Rather than bifurcate types into linear and non-linear counterparts, we instead attach linearity to function arrows. Linear functions can receive inputs from linearly-bound values, but ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09756","kind":"arxiv","version":2},"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-18T00:31:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zt5U5PQHu2fp8GUEdTgwsd/1o/fp/lhWgcohp62gKzIpdP4C7ktdvIOsNitWlj6oXx4iZKbyk4Hn2+Hq7rLzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:42:46.515653Z"},"content_sha256":"042987a49b5b45763e355431dc361917a75cd3161394f3aef5e63e63d30c4016","schema_version":"1.0","event_id":"sha256:042987a49b5b45763e355431dc361917a75cd3161394f3aef5e63e63d30c4016"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/bundle.json","state_url":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/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-06-25T03:42:46Z","links":{"resolver":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU","bundle":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/bundle.json","state":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HSQZ4ZNTOEHSMBD2HTRFTFL2PU","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":"bda2ff3597e19d41893e22570155d86259065489d88b50baff7b8a1ab9ff0dfb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2017-10-26T15:28:32Z","title_canon_sha256":"2f1cc55a1d4e9f9111a269ce9fa48f7ea0295da8b818c7803e249e7017a97513"},"schema_version":"1.0","source":{"id":"1710.09756","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09756","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09756v2","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09756","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"HSQZ4ZNTOEHS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HSQZ4ZNTOEHSMBD2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HSQZ4ZNT","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:042987a49b5b45763e355431dc361917a75cd3161394f3aef5e63e63d30c4016","target":"graph","created_at":"2026-05-18T00:31:02Z","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":"Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind: backwards-compatibility and code reuse across linear and non-linear users of a library. Only then can the benefits of linear types permeate conventional functional programming. Rather than bifurcate types into linear and non-linear counterparts, we instead attach linearity to function arrows. Linear functions can receive inputs from linearly-bound values, but ca","authors_text":"Arnaud Spiwack, Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2017-10-26T15:28:32Z","title":"Linear Haskell: practical linearity in a higher-order polymorphic language"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09756","kind":"arxiv","version":2},"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:d1e3d441110fdf32b38a0a2754c73d4b2a881a4efe6ab4d752a904fa9488e354","target":"record","created_at":"2026-05-18T00:31:02Z","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":"bda2ff3597e19d41893e22570155d86259065489d88b50baff7b8a1ab9ff0dfb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2017-10-26T15:28:32Z","title_canon_sha256":"2f1cc55a1d4e9f9111a269ce9fa48f7ea0295da8b818c7803e249e7017a97513"},"schema_version":"1.0","source":{"id":"1710.09756","kind":"arxiv","version":2}},"canonical_sha256":"3ca19e65b3710f26047a3ce259957a7d33858c5cab25a01316bd06f99080d845","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ca19e65b3710f26047a3ce259957a7d33858c5cab25a01316bd06f99080d845","first_computed_at":"2026-05-18T00:31:02.259747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:02.259747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RhX8lGkrRrtA4VanyUDblEX0I8euJkA0PFTrc+ohiuvmtiGfyZ8uJo8JH/kBG+dAHaku1Z4xKKNM3zVzgEsvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:02.260446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09756","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1e3d441110fdf32b38a0a2754c73d4b2a881a4efe6ab4d752a904fa9488e354","sha256:042987a49b5b45763e355431dc361917a75cd3161394f3aef5e63e63d30c4016"],"state_sha256":"4705a6fac35a1347f62ea24deb1b39bd6d306dfba62ee40e2d1a4c3215c3764c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLKHKn/pn/LsGiKtMrktYB5SGxHbYi5SvsXz/HXHVswUS14jJUX45rQVNBAVwdvvMCQVR4NivZYTEIStP9L3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T03:42:46.517660Z","bundle_sha256":"c1afe76611f7db09a2495202c9b16a7f19f751dce4e0f9ac87d2e070c8e2a9f2"}}