{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3GZBU3QX4W7LYVZUOW3U63F3CR","short_pith_number":"pith:3GZBU3QX","canonical_record":{"source":{"id":"1602.05365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-02-17T10:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"a0893f699c5807d8d1505c40ea2928c6ff1b57a3ebb82a71072b74d61962dc87","abstract_canon_sha256":"9b32a6659d17993619083adaf2f7aa6069e8f8f0fdf47b2260d337cc590c1b26"},"schema_version":"1.0"},"canonical_sha256":"d9b21a6e17e5bebc573475b74f6cbb145b5cd1bba52e49143b231014bf321fe5","source":{"kind":"arxiv","id":"1602.05365","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05365","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05365v1","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05365","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"3GZBU3QX4W7L","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3GZBU3QX4W7LYVZU","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3GZBU3QX","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3GZBU3QX4W7LYVZUOW3U63F3CR","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-02-17T10:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"a0893f699c5807d8d1505c40ea2928c6ff1b57a3ebb82a71072b74d61962dc87","abstract_canon_sha256":"9b32a6659d17993619083adaf2f7aa6069e8f8f0fdf47b2260d337cc590c1b26"},"schema_version":"1.0"},"canonical_sha256":"d9b21a6e17e5bebc573475b74f6cbb145b5cd1bba52e49143b231014bf321fe5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:28.452030Z","signature_b64":"wD6r4YnsK1RntMa36ZJsUIGzV17D/L8gkJn4kX49/7JGx0bISAd+XrojEofum0yuF33PvZnKCbGcBw/k8GqXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9b21a6e17e5bebc573475b74f6cbb145b5cd1bba52e49143b231014bf321fe5","last_reissued_at":"2026-05-18T01:20:28.451415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:28.451415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05365","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-18T01:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hl5gSGGyZLlGDocIEaNzyjWdOvm0iTgReF2yiyFVe9UsDgArVrxvlMMyLjZfC28bk30sejngmzBcKHRzHHclDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:32:21.787193Z"},"content_sha256":"e4cedc6b54cd67649d08c5d743385c3831df1094b1615d477f17d60c13e8fc7f","schema_version":"1.0","event_id":"sha256:e4cedc6b54cd67649d08c5d743385c3831df1094b1615d477f17d60c13e8fc7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3GZBU3QX4W7LYVZUOW3U63F3CR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Specification of Open Transactional Memory for Haskell","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Marco Peressotti, Marino Miculan","submitted_at":"2016-02-17T10:46:45Z","abstract_excerpt":"Transactional memory (TM) has emerged as a promising abstraction for concurrent programming alternative to lock-based synchronizations. However, most TM models admit only isolated transactions, which are not adequate in multi-threaded programming where transactions have to interact via shared data before committing. In this paper, we present Open Transactional Memory (OTM), a programming abstraction supporting safe, data-driven interactions between composable memory transactions. This is achieved by relaxing isolation between transactions, still ensuring atomicity: threads of different transac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05365","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-18T01:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCIsUznfrN04XM3Nl2CwOrGtYn924WXnLL2xbGzBOkR1tdL3FSVQ3N477AvczR6uU3CzKy4q9b1QLLXtktOeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:32:21.787553Z"},"content_sha256":"e5b7f41046466d52fc6b2214700a466862c2f07272ae9cfbb7f8091484b0c0d3","schema_version":"1.0","event_id":"sha256:e5b7f41046466d52fc6b2214700a466862c2f07272ae9cfbb7f8091484b0c0d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GZBU3QX4W7LYVZUOW3U63F3CR/bundle.json","state_url":"https://pith.science/pith/3GZBU3QX4W7LYVZUOW3U63F3CR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GZBU3QX4W7LYVZUOW3U63F3CR/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-25T18:32:21Z","links":{"resolver":"https://pith.science/pith/3GZBU3QX4W7LYVZUOW3U63F3CR","bundle":"https://pith.science/pith/3GZBU3QX4W7LYVZUOW3U63F3CR/bundle.json","state":"https://pith.science/pith/3GZBU3QX4W7LYVZUOW3U63F3CR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GZBU3QX4W7LYVZUOW3U63F3CR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3GZBU3QX4W7LYVZUOW3U63F3CR","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":"9b32a6659d17993619083adaf2f7aa6069e8f8f0fdf47b2260d337cc590c1b26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-02-17T10:46:45Z","title_canon_sha256":"a0893f699c5807d8d1505c40ea2928c6ff1b57a3ebb82a71072b74d61962dc87"},"schema_version":"1.0","source":{"id":"1602.05365","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05365","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05365v1","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05365","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"3GZBU3QX4W7L","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3GZBU3QX4W7LYVZU","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3GZBU3QX","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:e5b7f41046466d52fc6b2214700a466862c2f07272ae9cfbb7f8091484b0c0d3","target":"graph","created_at":"2026-05-18T01:20:28Z","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":"Transactional memory (TM) has emerged as a promising abstraction for concurrent programming alternative to lock-based synchronizations. However, most TM models admit only isolated transactions, which are not adequate in multi-threaded programming where transactions have to interact via shared data before committing. In this paper, we present Open Transactional Memory (OTM), a programming abstraction supporting safe, data-driven interactions between composable memory transactions. This is achieved by relaxing isolation between transactions, still ensuring atomicity: threads of different transac","authors_text":"Marco Peressotti, Marino Miculan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-02-17T10:46:45Z","title":"A Specification of Open Transactional Memory for Haskell"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05365","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:e4cedc6b54cd67649d08c5d743385c3831df1094b1615d477f17d60c13e8fc7f","target":"record","created_at":"2026-05-18T01:20:28Z","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":"9b32a6659d17993619083adaf2f7aa6069e8f8f0fdf47b2260d337cc590c1b26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-02-17T10:46:45Z","title_canon_sha256":"a0893f699c5807d8d1505c40ea2928c6ff1b57a3ebb82a71072b74d61962dc87"},"schema_version":"1.0","source":{"id":"1602.05365","kind":"arxiv","version":1}},"canonical_sha256":"d9b21a6e17e5bebc573475b74f6cbb145b5cd1bba52e49143b231014bf321fe5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9b21a6e17e5bebc573475b74f6cbb145b5cd1bba52e49143b231014bf321fe5","first_computed_at":"2026-05-18T01:20:28.451415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:28.451415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wD6r4YnsK1RntMa36ZJsUIGzV17D/L8gkJn4kX49/7JGx0bISAd+XrojEofum0yuF33PvZnKCbGcBw/k8GqXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:28.452030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05365","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4cedc6b54cd67649d08c5d743385c3831df1094b1615d477f17d60c13e8fc7f","sha256:e5b7f41046466d52fc6b2214700a466862c2f07272ae9cfbb7f8091484b0c0d3"],"state_sha256":"5e7555c1005a9823efec399dcec50673b58f6fd0e2723506b9ed615a842003c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKzhkWGl8rEI7pKuVSymXKgswBZy+llops+BOa/Ejx9GolmCDgojcWD8wfdC047SRBHekcJSY3PF+pMpjLsVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:32:21.789481Z","bundle_sha256":"f0016799df359edf184228fa4c14b1154cefda70d470c2ec86ba1245f9e4bc5f"}}