{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5EDA42TUNHDFXQLL3MBFCTNPXY","short_pith_number":"pith:5EDA42TU","schema_version":"1.0","canonical_sha256":"e9060e6a7469c65bc16bdb02514dafbe10d6bcc1d0e840056a05d713b78a0eb6","source":{"kind":"arxiv","id":"1808.06348","version":1},"attestation_state":"computed","paper":{"title":"Every Data Structure Deserves Lock-Free Memory Reclamation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Nachshon Cohen","submitted_at":"2018-08-20T08:48:48Z","abstract_excerpt":"Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes. However, applying memory-management support to a data structure remains complex and, in many cases, requires redesigning the data structure. In this paper, we present the first lock-free memory-management scheme that is applicable to general (arbitrary) lock-free data structures and that can be applied automatically via a compiler plug-in. In addition to the simplicity of incorporating to data structures, this scheme provides low overhe"},"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":"1808.06348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-20T08:48:48Z","cross_cats_sorted":[],"title_canon_sha256":"3fd165023b4e28b788df81c04c75af00c0c0743e32afb1ced01dbaea9d4135d1","abstract_canon_sha256":"c40a95673787514704923d51aa92a28fc544ce40009365ab55b4fe92c59688e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:45.248204Z","signature_b64":"R4A9n0HvVCjAdUNBAh2WeHdP6XShYb8JyIQHi12SdaEsqucUKVcsFZwQUkov38cZpdRXDnkNXecIRiS0iLcGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9060e6a7469c65bc16bdb02514dafbe10d6bcc1d0e840056a05d713b78a0eb6","last_reissued_at":"2026-05-18T00:07:45.247657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:45.247657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Every Data Structure Deserves Lock-Free Memory Reclamation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Nachshon Cohen","submitted_at":"2018-08-20T08:48:48Z","abstract_excerpt":"Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes. However, applying memory-management support to a data structure remains complex and, in many cases, requires redesigning the data structure. In this paper, we present the first lock-free memory-management scheme that is applicable to general (arbitrary) lock-free data structures and that can be applied automatically via a compiler plug-in. In addition to the simplicity of incorporating to data structures, this scheme provides low overhe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06348","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":"1808.06348","created_at":"2026-05-18T00:07:45.247749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06348v1","created_at":"2026-05-18T00:07:45.247749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06348","created_at":"2026-05-18T00:07:45.247749+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EDA42TUNHDF","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EDA42TUNHDFXQLL","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EDA42TU","created_at":"2026-05-18T12:32:08.215937+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/5EDA42TUNHDFXQLL3MBFCTNPXY","json":"https://pith.science/pith/5EDA42TUNHDFXQLL3MBFCTNPXY.json","graph_json":"https://pith.science/api/pith-number/5EDA42TUNHDFXQLL3MBFCTNPXY/graph.json","events_json":"https://pith.science/api/pith-number/5EDA42TUNHDFXQLL3MBFCTNPXY/events.json","paper":"https://pith.science/paper/5EDA42TU"},"agent_actions":{"view_html":"https://pith.science/pith/5EDA42TUNHDFXQLL3MBFCTNPXY","download_json":"https://pith.science/pith/5EDA42TUNHDFXQLL3MBFCTNPXY.json","view_paper":"https://pith.science/paper/5EDA42TU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06348&json=true","fetch_graph":"https://pith.science/api/pith-number/5EDA42TUNHDFXQLL3MBFCTNPXY/graph.json","fetch_events":"https://pith.science/api/pith-number/5EDA42TUNHDFXQLL3MBFCTNPXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EDA42TUNHDFXQLL3MBFCTNPXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EDA42TUNHDFXQLL3MBFCTNPXY/action/storage_attestation","attest_author":"https://pith.science/pith/5EDA42TUNHDFXQLL3MBFCTNPXY/action/author_attestation","sign_citation":"https://pith.science/pith/5EDA42TUNHDFXQLL3MBFCTNPXY/action/citation_signature","submit_replication":"https://pith.science/pith/5EDA42TUNHDFXQLL3MBFCTNPXY/action/replication_record"}},"created_at":"2026-05-18T00:07:45.247749+00:00","updated_at":"2026-05-18T00:07:45.247749+00:00"}