{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DT7RRYIYOL4Z2AAUWXWUGATWVD","short_pith_number":"pith:DT7RRYIY","schema_version":"1.0","canonical_sha256":"1cff18e11872f99d0014b5ed430276a8d139dcc3baf61fca274d63c774ec5e62","source":{"kind":"arxiv","id":"1502.05094","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.05094","created_at":"2026-05-18T02:26:52.423129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05094v1","created_at":"2026-05-18T02:26:52.423129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05094","created_at":"2026-05-18T02:26:52.423129+00:00"},{"alias_kind":"pith_short_12","alias_value":"DT7RRYIYOL4Z","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DT7RRYIYOL4Z2AAU","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DT7RRYIY","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD","json":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD.json","graph_json":"https://pith.science/api/pith-number/DT7RRYIYOL4Z2AAUWXWUGATWVD/graph.json","events_json":"https://pith.science/api/pith-number/DT7RRYIYOL4Z2AAUWXWUGATWVD/events.json","paper":"https://pith.science/paper/DT7RRYIY"},"agent_actions":{"view_html":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD","download_json":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD.json","view_paper":"https://pith.science/paper/DT7RRYIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05094&json=true","fetch_graph":"https://pith.science/api/pith-number/DT7RRYIYOL4Z2AAUWXWUGATWVD/graph.json","fetch_events":"https://pith.science/api/pith-number/DT7RRYIYOL4Z2AAUWXWUGATWVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/action/storage_attestation","attest_author":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/action/author_attestation","sign_citation":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/action/citation_signature","submit_replication":"https://pith.science/pith/DT7RRYIYOL4Z2AAUWXWUGATWVD/action/replication_record"}},"created_at":"2026-05-18T02:26:52.423129+00:00","updated_at":"2026-05-18T02:26:52.423129+00:00"}