{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BNMRK2Z42PFHIDVUUK3EI7D7KL","short_pith_number":"pith:BNMRK2Z4","schema_version":"1.0","canonical_sha256":"0b59156b3cd3ca740eb4a2b6447c7f52ff6eeab98256d01dc7b144e98b4fc879","source":{"kind":"arxiv","id":"1805.08639","version":2},"attestation_state":"computed","paper":{"title":"Stamp-it: A more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model","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-05-21T17:05:37Z","abstract_excerpt":"We present Stamp-it, a new, concurrent, lock-less memory reclamation scheme with amortized, constant-time (thread-count independent) reclamation overhead. Stamp-it has been implemented and proved correct in the C++ memory model using as weak memory-consistency assumptions as possible. We have likewise (re)implemented six other comparable reclamation schemes. We give a detailed performance comparison, showing that Stamp-it performs favorably (sometimes better, at least as good as) than most of these other schemes while being able to reclaim free memory nodes earlier."},"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":"1805.08639","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-21T17:05:37Z","cross_cats_sorted":[],"title_canon_sha256":"cc21e8d1ffa267825ba853efd7f4cc0aa35055e853ac3ded4825ed640903757a","abstract_canon_sha256":"4919163eea4dce9d63b27a640f1daa3e4a82c704cfb2bad82ce3b9649dc5a2bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:44.821636Z","signature_b64":"dqNIt61gXiZ0sRgRc4mwYQxyVP7qJXoE+deUrrCz7UXiKF6bCR/4XplEJ9bDZwzkIGWA6ikrRqWW45b9a/1PBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b59156b3cd3ca740eb4a2b6447c7f52ff6eeab98256d01dc7b144e98b4fc879","last_reissued_at":"2026-05-18T00:02:44.821113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:44.821113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stamp-it: A more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model","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-05-21T17:05:37Z","abstract_excerpt":"We present Stamp-it, a new, concurrent, lock-less memory reclamation scheme with amortized, constant-time (thread-count independent) reclamation overhead. Stamp-it has been implemented and proved correct in the C++ memory model using as weak memory-consistency assumptions as possible. We have likewise (re)implemented six other comparable reclamation schemes. We give a detailed performance comparison, showing that Stamp-it performs favorably (sometimes better, at least as good as) than most of these other schemes while being able to reclaim free memory nodes earlier."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08639","kind":"arxiv","version":2},"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":"1805.08639","created_at":"2026-05-18T00:02:44.821186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08639v2","created_at":"2026-05-18T00:02:44.821186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08639","created_at":"2026-05-18T00:02:44.821186+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNMRK2Z42PFH","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNMRK2Z42PFHIDVU","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNMRK2Z4","created_at":"2026-05-18T12:32:16.446611+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/BNMRK2Z42PFHIDVUUK3EI7D7KL","json":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL.json","graph_json":"https://pith.science/api/pith-number/BNMRK2Z42PFHIDVUUK3EI7D7KL/graph.json","events_json":"https://pith.science/api/pith-number/BNMRK2Z42PFHIDVUUK3EI7D7KL/events.json","paper":"https://pith.science/paper/BNMRK2Z4"},"agent_actions":{"view_html":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL","download_json":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL.json","view_paper":"https://pith.science/paper/BNMRK2Z4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08639&json=true","fetch_graph":"https://pith.science/api/pith-number/BNMRK2Z42PFHIDVUUK3EI7D7KL/graph.json","fetch_events":"https://pith.science/api/pith-number/BNMRK2Z42PFHIDVUUK3EI7D7KL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/action/storage_attestation","attest_author":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/action/author_attestation","sign_citation":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/action/citation_signature","submit_replication":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/action/replication_record"}},"created_at":"2026-05-18T00:02:44.821186+00:00","updated_at":"2026-05-18T00:02:44.821186+00:00"}