{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3R55GKAPN4WH5PNQ76MB7QM5UX","short_pith_number":"pith:3R55GKAP","schema_version":"1.0","canonical_sha256":"dc7bd3280f6f2c7ebdb0ff981fc19da5ddefde91160691929938dee57c7ee26a","source":{"kind":"arxiv","id":"1803.04432","version":1},"attestation_state":"computed","paper":{"title":"Memory Models for C/C++ Programmers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jesper Larsson Tr\\\"aff, Manuel P\\\"oter","submitted_at":"2018-03-12T18:08:03Z","abstract_excerpt":"The memory model is the crux of the concurrency semantics of shared-memory systems. It defines the possible values that a read operation is allowed to return for any given set of write operations performed by a concurrent program, thereby defining the basic semantics of shared variables. It is therefore impossible to meaningfully reason about a program or any part of the programming language implementation without an unambiguous memory model.\n  This note provides a brief introduction into the topic of memory models, explaining why it is essential for concurrent programs and covering well known"},"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":"1803.04432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T18:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"8a35ea20d8b27674930c3b2bcac848b90b623ea243e41f26499661a9caf9ea8e","abstract_canon_sha256":"dabfd41178485d8cc7013e14fa98361e1655df839d271c73dd94ff020710cc70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:19.086042Z","signature_b64":"SuCnScmHUZdidReu4nX6xu0ZU+v7wvywJZpZtvFqSsufPCiRAfkhup+cvkc3Hhvpo7UJa6k0Sy+rwyc3f123Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc7bd3280f6f2c7ebdb0ff981fc19da5ddefde91160691929938dee57c7ee26a","last_reissued_at":"2026-05-18T00:21:19.084990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:19.084990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory Models for C/C++ Programmers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jesper Larsson Tr\\\"aff, Manuel P\\\"oter","submitted_at":"2018-03-12T18:08:03Z","abstract_excerpt":"The memory model is the crux of the concurrency semantics of shared-memory systems. It defines the possible values that a read operation is allowed to return for any given set of write operations performed by a concurrent program, thereby defining the basic semantics of shared variables. It is therefore impossible to meaningfully reason about a program or any part of the programming language implementation without an unambiguous memory model.\n  This note provides a brief introduction into the topic of memory models, explaining why it is essential for concurrent programs and covering well known"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04432","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":"1803.04432","created_at":"2026-05-18T00:21:19.085378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04432v1","created_at":"2026-05-18T00:21:19.085378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04432","created_at":"2026-05-18T00:21:19.085378+00:00"},{"alias_kind":"pith_short_12","alias_value":"3R55GKAPN4WH","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3R55GKAPN4WH5PNQ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3R55GKAP","created_at":"2026-05-18T12:32:02.567920+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/3R55GKAPN4WH5PNQ76MB7QM5UX","json":"https://pith.science/pith/3R55GKAPN4WH5PNQ76MB7QM5UX.json","graph_json":"https://pith.science/api/pith-number/3R55GKAPN4WH5PNQ76MB7QM5UX/graph.json","events_json":"https://pith.science/api/pith-number/3R55GKAPN4WH5PNQ76MB7QM5UX/events.json","paper":"https://pith.science/paper/3R55GKAP"},"agent_actions":{"view_html":"https://pith.science/pith/3R55GKAPN4WH5PNQ76MB7QM5UX","download_json":"https://pith.science/pith/3R55GKAPN4WH5PNQ76MB7QM5UX.json","view_paper":"https://pith.science/paper/3R55GKAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04432&json=true","fetch_graph":"https://pith.science/api/pith-number/3R55GKAPN4WH5PNQ76MB7QM5UX/graph.json","fetch_events":"https://pith.science/api/pith-number/3R55GKAPN4WH5PNQ76MB7QM5UX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3R55GKAPN4WH5PNQ76MB7QM5UX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3R55GKAPN4WH5PNQ76MB7QM5UX/action/storage_attestation","attest_author":"https://pith.science/pith/3R55GKAPN4WH5PNQ76MB7QM5UX/action/author_attestation","sign_citation":"https://pith.science/pith/3R55GKAPN4WH5PNQ76MB7QM5UX/action/citation_signature","submit_replication":"https://pith.science/pith/3R55GKAPN4WH5PNQ76MB7QM5UX/action/replication_record"}},"created_at":"2026-05-18T00:21:19.085378+00:00","updated_at":"2026-05-18T00:21:19.085378+00:00"}