{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MBXQMM6VCEHGIXUMFFXP5DVOQ3","short_pith_number":"pith:MBXQMM6V","canonical_record":{"source":{"id":"1902.01906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-05T20:56:23Z","cross_cats_sorted":[],"title_canon_sha256":"ae906ea9e78560b3b08edcb6175987684de9e440e70cc89570ecc9e03e76a3dc","abstract_canon_sha256":"a3bc584058b4e8e492002b7278af7cc1509a7736d0adc0fb8b2c05ee8b7b2195"},"schema_version":"1.0"},"canonical_sha256":"606f0633d5110e645e8c296efe8eae86e0bebaff94c6e363bed53fe42a45c550","source":{"kind":"arxiv","id":"1902.01906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01906","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01906v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01906","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"MBXQMM6VCEHG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MBXQMM6VCEHGIXUM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MBXQMM6V","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MBXQMM6VCEHGIXUMFFXP5DVOQ3","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-05T20:56:23Z","cross_cats_sorted":[],"title_canon_sha256":"ae906ea9e78560b3b08edcb6175987684de9e440e70cc89570ecc9e03e76a3dc","abstract_canon_sha256":"a3bc584058b4e8e492002b7278af7cc1509a7736d0adc0fb8b2c05ee8b7b2195"},"schema_version":"1.0"},"canonical_sha256":"606f0633d5110e645e8c296efe8eae86e0bebaff94c6e363bed53fe42a45c550","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.458709Z","signature_b64":"mTulsmtnlRVdDBfEk/zvrposZEb/EelIlSByWoRd3oMa/NUrQFK37SHFCzZSh9Nbk1ZB+eb8fj5cm9zQha5LCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"606f0633d5110e645e8c296efe8eae86e0bebaff94c6e363bed53fe42a45c550","last_reissued_at":"2026-05-17T23:54:38.458125Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.458125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01906","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-17T23:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gztkvtedkrBADiW3/px1urQcnB5H8+rhS4SZiZE77mrK9xRO8CCljv8mNKG4iUWxZFrO1mpO+EermOXOjPpiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:08:29.913928Z"},"content_sha256":"acccac031bdad5b90015a0609c7a7192dbce8a78951e6e589d2394e6543e4a51","schema_version":"1.0","event_id":"sha256:acccac031bdad5b90015a0609c7a7192dbce8a78951e6e589d2394e6543e4a51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MBXQMM6VCEHGIXUMFFXP5DVOQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fearless Concurrency? Understanding Concurrent Programming Safety in Real-World Rust Software","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Linhai Song, Yiying Zhang, Zeming Yu","submitted_at":"2019-02-05T20:56:23Z","abstract_excerpt":"Rust is a popular programming language in building various low-level software in recent years. It aims to provide safe concurrency when implementing multi-threaded software through a suite of compiler checking rules. Unfortunately, there is limited understanding of how the checking rules influence the safety of concurrent programming in Rust applications.\n  In this paper, we perform a preliminary study on Rust's concurrency safety from two aspects: concurrency usage and concurrency bugs. Our study can provide better understanding on Rust's concurrency and can guide future researchers and pract"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01906","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-17T23:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rPZXivTwK6YVCXV6LWC7uAIe0Iwb543DsE3jh9kp/ZCbKr9eu4j2LNOQMYFvnpdAMTfBe7VfzsbhRFMty38Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:08:29.914601Z"},"content_sha256":"8c34040c5ff31844af9a1e3ddae95391d29e57fad1bef4ed630b12ee30ec8113","schema_version":"1.0","event_id":"sha256:8c34040c5ff31844af9a1e3ddae95391d29e57fad1bef4ed630b12ee30ec8113"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBXQMM6VCEHGIXUMFFXP5DVOQ3/bundle.json","state_url":"https://pith.science/pith/MBXQMM6VCEHGIXUMFFXP5DVOQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBXQMM6VCEHGIXUMFFXP5DVOQ3/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-06T13:08:29Z","links":{"resolver":"https://pith.science/pith/MBXQMM6VCEHGIXUMFFXP5DVOQ3","bundle":"https://pith.science/pith/MBXQMM6VCEHGIXUMFFXP5DVOQ3/bundle.json","state":"https://pith.science/pith/MBXQMM6VCEHGIXUMFFXP5DVOQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBXQMM6VCEHGIXUMFFXP5DVOQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MBXQMM6VCEHGIXUMFFXP5DVOQ3","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":"a3bc584058b4e8e492002b7278af7cc1509a7736d0adc0fb8b2c05ee8b7b2195","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-05T20:56:23Z","title_canon_sha256":"ae906ea9e78560b3b08edcb6175987684de9e440e70cc89570ecc9e03e76a3dc"},"schema_version":"1.0","source":{"id":"1902.01906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01906","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01906v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01906","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"MBXQMM6VCEHG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MBXQMM6VCEHGIXUM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MBXQMM6V","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:8c34040c5ff31844af9a1e3ddae95391d29e57fad1bef4ed630b12ee30ec8113","target":"graph","created_at":"2026-05-17T23:54:38Z","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":"Rust is a popular programming language in building various low-level software in recent years. It aims to provide safe concurrency when implementing multi-threaded software through a suite of compiler checking rules. Unfortunately, there is limited understanding of how the checking rules influence the safety of concurrent programming in Rust applications.\n  In this paper, we perform a preliminary study on Rust's concurrency safety from two aspects: concurrency usage and concurrency bugs. Our study can provide better understanding on Rust's concurrency and can guide future researchers and pract","authors_text":"Linhai Song, Yiying Zhang, Zeming Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-05T20:56:23Z","title":"Fearless Concurrency? Understanding Concurrent Programming Safety in Real-World Rust Software"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01906","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:acccac031bdad5b90015a0609c7a7192dbce8a78951e6e589d2394e6543e4a51","target":"record","created_at":"2026-05-17T23:54:38Z","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":"a3bc584058b4e8e492002b7278af7cc1509a7736d0adc0fb8b2c05ee8b7b2195","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-05T20:56:23Z","title_canon_sha256":"ae906ea9e78560b3b08edcb6175987684de9e440e70cc89570ecc9e03e76a3dc"},"schema_version":"1.0","source":{"id":"1902.01906","kind":"arxiv","version":1}},"canonical_sha256":"606f0633d5110e645e8c296efe8eae86e0bebaff94c6e363bed53fe42a45c550","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"606f0633d5110e645e8c296efe8eae86e0bebaff94c6e363bed53fe42a45c550","first_computed_at":"2026-05-17T23:54:38.458125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:38.458125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mTulsmtnlRVdDBfEk/zvrposZEb/EelIlSByWoRd3oMa/NUrQFK37SHFCzZSh9Nbk1ZB+eb8fj5cm9zQha5LCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:38.458709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acccac031bdad5b90015a0609c7a7192dbce8a78951e6e589d2394e6543e4a51","sha256:8c34040c5ff31844af9a1e3ddae95391d29e57fad1bef4ed630b12ee30ec8113"],"state_sha256":"949c1e46efd7919ed82313295fdac305340019e45a3f1eb944266d00b8a6be50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jn+Deu2WYq132bbX1mScAu9pA/VUhxX0ej7v86nqa2trHdE7Md5NRNaBEERi+PYmt4pVQ7ds24pqnzVlFS6gAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:08:29.918285Z","bundle_sha256":"9690689487353defecc0d94cd331c1914aa93ea1a16b3d8526348e650e64a011"}}