{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:P7QGGR4L3WROC2CDUMNLRIC7H7","short_pith_number":"pith:P7QGGR4L","schema_version":"1.0","canonical_sha256":"7fe063478bdda2e16843a31ab8a05f3fe9430d4fa85bdd600917d313a4c70fd4","source":{"kind":"arxiv","id":"1904.12210","version":1},"attestation_state":"computed","paper":{"title":"A Practical Analysis of Rust's Concurrency Story","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DC","authors_text":"Aditya Saligrama, Andrew Shen, Jon Gjengset","submitted_at":"2019-04-27T20:37:20Z","abstract_excerpt":"Correct concurrent programs are difficult to write; when multiple threads mutate shared data, they may lose writes, corrupt data, or produce erratic program behavior. While many of the data-race issues with concurrency can be avoided by the placing of locks throughout the code, these often serialize program execution, and can significantly slow down performance-critical applications. Programmers also make mistakes, and often forget locks in less-executed code paths, which leads to programs that misbehave only in rare situations.\n  Rust is a recent programming language from Mozilla that attempt"},"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":"1904.12210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-27T20:37:20Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"4eb3ab7397d50adf4ce8d7305090c95901d588998ec8f48053cf8e9ff9e1ef3e","abstract_canon_sha256":"5f3ca31b84b49da1d3b9055d94ecc417bf2b2c8c37829bdd836f67027fd505a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:38.672388Z","signature_b64":"5W5EHdsw8NMorER2JgW6+zgldfI0IGbrpbCUszr6AE6/fufWslrvR8hbn7jct7hkCWev42zOPjc6HM/vSBV6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fe063478bdda2e16843a31ab8a05f3fe9430d4fa85bdd600917d313a4c70fd4","last_reissued_at":"2026-05-17T23:47:38.671872Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:38.671872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Practical Analysis of Rust's Concurrency Story","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DC","authors_text":"Aditya Saligrama, Andrew Shen, Jon Gjengset","submitted_at":"2019-04-27T20:37:20Z","abstract_excerpt":"Correct concurrent programs are difficult to write; when multiple threads mutate shared data, they may lose writes, corrupt data, or produce erratic program behavior. While many of the data-race issues with concurrency can be avoided by the placing of locks throughout the code, these often serialize program execution, and can significantly slow down performance-critical applications. Programmers also make mistakes, and often forget locks in less-executed code paths, which leads to programs that misbehave only in rare situations.\n  Rust is a recent programming language from Mozilla that attempt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12210","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":"1904.12210","created_at":"2026-05-17T23:47:38.671945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12210v1","created_at":"2026-05-17T23:47:38.671945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12210","created_at":"2026-05-17T23:47:38.671945+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7QGGR4L3WRO","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7QGGR4L3WROC2CD","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7QGGR4L","created_at":"2026-05-18T12:33:24.271573+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/P7QGGR4L3WROC2CDUMNLRIC7H7","json":"https://pith.science/pith/P7QGGR4L3WROC2CDUMNLRIC7H7.json","graph_json":"https://pith.science/api/pith-number/P7QGGR4L3WROC2CDUMNLRIC7H7/graph.json","events_json":"https://pith.science/api/pith-number/P7QGGR4L3WROC2CDUMNLRIC7H7/events.json","paper":"https://pith.science/paper/P7QGGR4L"},"agent_actions":{"view_html":"https://pith.science/pith/P7QGGR4L3WROC2CDUMNLRIC7H7","download_json":"https://pith.science/pith/P7QGGR4L3WROC2CDUMNLRIC7H7.json","view_paper":"https://pith.science/paper/P7QGGR4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12210&json=true","fetch_graph":"https://pith.science/api/pith-number/P7QGGR4L3WROC2CDUMNLRIC7H7/graph.json","fetch_events":"https://pith.science/api/pith-number/P7QGGR4L3WROC2CDUMNLRIC7H7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7QGGR4L3WROC2CDUMNLRIC7H7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7QGGR4L3WROC2CDUMNLRIC7H7/action/storage_attestation","attest_author":"https://pith.science/pith/P7QGGR4L3WROC2CDUMNLRIC7H7/action/author_attestation","sign_citation":"https://pith.science/pith/P7QGGR4L3WROC2CDUMNLRIC7H7/action/citation_signature","submit_replication":"https://pith.science/pith/P7QGGR4L3WROC2CDUMNLRIC7H7/action/replication_record"}},"created_at":"2026-05-17T23:47:38.671945+00:00","updated_at":"2026-05-17T23:47:38.671945+00:00"}