{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GAQ3IGJRHCKVU4HDITBYJHS4R5","short_pith_number":"pith:GAQ3IGJR","schema_version":"1.0","canonical_sha256":"3021b4193138955a70e344c3849e5c8f53d06bb78d732ba7cdfd3025f6d21487","source":{"kind":"arxiv","id":"1712.06134","version":1},"attestation_state":"computed","paper":{"title":"A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it)","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":"2017-12-17T16:21:49Z","abstract_excerpt":"Memory management is a critical component in almost all shared-memory, concurrent data structures and algorithms, consisting in the efficient allocation and the subsequent reclamation of shared memory resources. This paper contributes a new, lock-free, amortized constant-time memory reclamation scheme called \\emph{Stamp-it}, and compares it to five well-known, selectively efficient schemes from the literature, namely Lock-free Reference Counting, Hazard Pointers, Quiescent State-based Reclamation, Epoch-based Reclamation, and New Epoch-based Reclamation. An extensive, experimental evaluation w"},"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":"1712.06134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-17T16:21:49Z","cross_cats_sorted":[],"title_canon_sha256":"6f96f3ffe7672f186efcbb933ea27747d1bdea388456823b01a9b53899fffb52","abstract_canon_sha256":"9fa00891fdbea2ab43a6fb43f41819fb4f0d15aaba507a36e8c1b1a93db02074"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:51.001847Z","signature_b64":"kp1CdyNiTgMAWMny/wRrBsMyq2kddcs6dDQeOX6FeU3Vv+oGkkXa1lFooxOO1gZPTMTffy0EcQcG5rPQDhgyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3021b4193138955a70e344c3849e5c8f53d06bb78d732ba7cdfd3025f6d21487","last_reissued_at":"2026-05-18T00:27:51.001411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:51.001411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it)","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":"2017-12-17T16:21:49Z","abstract_excerpt":"Memory management is a critical component in almost all shared-memory, concurrent data structures and algorithms, consisting in the efficient allocation and the subsequent reclamation of shared memory resources. This paper contributes a new, lock-free, amortized constant-time memory reclamation scheme called \\emph{Stamp-it}, and compares it to five well-known, selectively efficient schemes from the literature, namely Lock-free Reference Counting, Hazard Pointers, Quiescent State-based Reclamation, Epoch-based Reclamation, and New Epoch-based Reclamation. An extensive, experimental evaluation w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06134","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":"1712.06134","created_at":"2026-05-18T00:27:51.001477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06134v1","created_at":"2026-05-18T00:27:51.001477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06134","created_at":"2026-05-18T00:27:51.001477+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAQ3IGJRHCKV","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAQ3IGJRHCKVU4HD","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAQ3IGJR","created_at":"2026-05-18T12:31:15.632608+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/GAQ3IGJRHCKVU4HDITBYJHS4R5","json":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5.json","graph_json":"https://pith.science/api/pith-number/GAQ3IGJRHCKVU4HDITBYJHS4R5/graph.json","events_json":"https://pith.science/api/pith-number/GAQ3IGJRHCKVU4HDITBYJHS4R5/events.json","paper":"https://pith.science/paper/GAQ3IGJR"},"agent_actions":{"view_html":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5","download_json":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5.json","view_paper":"https://pith.science/paper/GAQ3IGJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06134&json=true","fetch_graph":"https://pith.science/api/pith-number/GAQ3IGJRHCKVU4HDITBYJHS4R5/graph.json","fetch_events":"https://pith.science/api/pith-number/GAQ3IGJRHCKVU4HDITBYJHS4R5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/action/storage_attestation","attest_author":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/action/author_attestation","sign_citation":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/action/citation_signature","submit_replication":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/action/replication_record"}},"created_at":"2026-05-18T00:27:51.001477+00:00","updated_at":"2026-05-18T00:27:51.001477+00:00"}