{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DT7RRYIYOL4Z2AAUWXWUGATWVD","short_pith_number":"pith:DT7RRYIY","canonical_record":{"source":{"id":"1502.05094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-02-18T01:06:43Z","cross_cats_sorted":[],"title_canon_sha256":"e38e3c52038864940bb2c8f2663de6704a94aadd7186ff58a50e9b2da82bd768","abstract_canon_sha256":"15311ac48c1a2bf1d38c515d5452ce9e3dea2fa96db7031942069a48f0abb19a"},"schema_version":"1.0"},"canonical_sha256":"1cff18e11872f99d0014b5ed430276a8d139dcc3baf61fca274d63c774ec5e62","source":{"kind":"arxiv","id":"1502.05094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05094","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05094v1","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05094","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"DT7RRYIYOL4Z","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DT7RRYIYOL4Z2AAU","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DT7RRYIY","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DT7RRYIYOL4Z2AAUWXWUGATWVD","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-02-18T01:06:43Z","cross_cats_sorted":[],"title_canon_sha256":"e38e3c52038864940bb2c8f2663de6704a94aadd7186ff58a50e9b2da82bd768","abstract_canon_sha256":"15311ac48c1a2bf1d38c515d5452ce9e3dea2fa96db7031942069a48f0abb19a"},"schema_version":"1.0"},"canonical_sha256":"1cff18e11872f99d0014b5ed430276a8d139dcc3baf61fca274d63c774ec5e62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:52.423452Z","signature_b64":"hWaZYtOdIFTIPcTfnfa3f0sHeMW4BYiMZfp2b8gdiaG36tM87oUd9kNEtSyQ5vqptmyaM8j3Ias0+soRiSk0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cff18e11872f99d0014b5ed430276a8d139dcc3baf61fca274d63c774ec5e62","last_reissued_at":"2026-05-18T02:26:52.423073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:52.423073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05094","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-18T02:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZowKm82znE/uSvxUZ+Axf+M0pvCxxSGR6p3wdjmAqVTziWnb4YrG89gC2bsgJfUpmiwC7wQdiJuocaJ5gvoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:07:38.316795Z"},"content_sha256":"5baa05fd0c5dbdad2d316013e6afd770683a9dbe53b711642e87a71392bf8aa0","schema_version":"1.0","event_id":"sha256:5baa05fd0c5dbdad2d316013e6afd770683a9dbe53b711642e87a71392bf8aa0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DT7RRYIYOL4Z2AAUWXWUGATWVD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Observationally Cooperative Multithreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Adam M. Cozzette, Ari D. Schumer, Christopher A. Stone, Julia Matsieva, Melissa E. O'Neill, M. Joe DeBlasio, Sonja A. Bohr, Stuart A. Pernsteiner","submitted_at":"2015-02-18T01:06:43Z","abstract_excerpt":"Despite widespread interest in multicore computing, concur- rency models in mainstream languages often lead to subtle, error-prone code.\n  Observationally Cooperative Multithreading (OCM) is a new approach to shared-memory parallelism. Programmers write code using the well-understood cooperative (i.e., nonpreemptive) multithreading model for uniprocessors. OCM then allows threads to run in parallel, so long as results remain consistent with the cooperative model.\n  Programmers benefit because they can reason largely sequentially. Remaining interthread interactions are far less chaotic than in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05094","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-18T02:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q22DiPBwKU+l1ev9o2IHWIFuL2JqjoJQVmGJ8BtGaxmAWpoMcY4yJZP6cyByHtWQFrH0fzfO0FkeUY7U5I7iCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:07:38.317149Z"},"content_sha256":"f5710e62565237be2d68ef23901ca27f03a320febe899146f2c35ea6df8d4a0b","schema_version":"1.0","event_id":"sha256:f5710e62565237be2d68ef23901ca27f03a320febe899146f2c35ea6df8d4a0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/bundle.json","state_url":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/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-01T12:07:38Z","links":{"resolver":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD","bundle":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/bundle.json","state":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DT7RRYIYOL4Z2AAUWXWUGATWVD","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":"15311ac48c1a2bf1d38c515d5452ce9e3dea2fa96db7031942069a48f0abb19a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-02-18T01:06:43Z","title_canon_sha256":"e38e3c52038864940bb2c8f2663de6704a94aadd7186ff58a50e9b2da82bd768"},"schema_version":"1.0","source":{"id":"1502.05094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05094","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05094v1","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05094","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"DT7RRYIYOL4Z","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DT7RRYIYOL4Z2AAU","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DT7RRYIY","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:f5710e62565237be2d68ef23901ca27f03a320febe899146f2c35ea6df8d4a0b","target":"graph","created_at":"2026-05-18T02:26:52Z","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":"Despite widespread interest in multicore computing, concur- rency models in mainstream languages often lead to subtle, error-prone code.\n  Observationally Cooperative Multithreading (OCM) is a new approach to shared-memory parallelism. Programmers write code using the well-understood cooperative (i.e., nonpreemptive) multithreading model for uniprocessors. OCM then allows threads to run in parallel, so long as results remain consistent with the cooperative model.\n  Programmers benefit because they can reason largely sequentially. Remaining interthread interactions are far less chaotic than in ","authors_text":"Adam M. Cozzette, Ari D. Schumer, Christopher A. Stone, Julia Matsieva, Melissa E. O'Neill, M. Joe DeBlasio, Sonja A. Bohr, Stuart A. Pernsteiner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-02-18T01:06:43Z","title":"Observationally Cooperative Multithreading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05094","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:5baa05fd0c5dbdad2d316013e6afd770683a9dbe53b711642e87a71392bf8aa0","target":"record","created_at":"2026-05-18T02:26:52Z","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":"15311ac48c1a2bf1d38c515d5452ce9e3dea2fa96db7031942069a48f0abb19a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-02-18T01:06:43Z","title_canon_sha256":"e38e3c52038864940bb2c8f2663de6704a94aadd7186ff58a50e9b2da82bd768"},"schema_version":"1.0","source":{"id":"1502.05094","kind":"arxiv","version":1}},"canonical_sha256":"1cff18e11872f99d0014b5ed430276a8d139dcc3baf61fca274d63c774ec5e62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cff18e11872f99d0014b5ed430276a8d139dcc3baf61fca274d63c774ec5e62","first_computed_at":"2026-05-18T02:26:52.423073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:52.423073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hWaZYtOdIFTIPcTfnfa3f0sHeMW4BYiMZfp2b8gdiaG36tM87oUd9kNEtSyQ5vqptmyaM8j3Ias0+soRiSk0DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:52.423452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5baa05fd0c5dbdad2d316013e6afd770683a9dbe53b711642e87a71392bf8aa0","sha256:f5710e62565237be2d68ef23901ca27f03a320febe899146f2c35ea6df8d4a0b"],"state_sha256":"4b5072fece1509f5ec233dcccb6b8c83cea6f2c932fb0550dc81492dd3ce5ae9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQT6XCejo0vjpVlR/elCrEzgl5HAu639zl3rWnMggBk8knpkI22bBw0cFrgoRTt+ese8ugnEG1Ry8mBMOZD8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:07:38.319196Z","bundle_sha256":"84dd54d3c6ab87bbe68f4ff7e5073e8d901f81618d711dab2af2af38bfb2e340"}}