{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GAQ3IGJRHCKVU4HDITBYJHS4R5","short_pith_number":"pith:GAQ3IGJR","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"},"canonical_sha256":"3021b4193138955a70e344c3849e5c8f53d06bb78d732ba7cdfd3025f6d21487","source":{"kind":"arxiv","id":"1712.06134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06134","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06134v1","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06134","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"GAQ3IGJRHCKV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GAQ3IGJRHCKVU4HD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GAQ3IGJR","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GAQ3IGJRHCKVU4HDITBYJHS4R5","target":"record","payload":{"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"},"canonical_sha256":"3021b4193138955a70e344c3849e5c8f53d06bb78d732ba7cdfd3025f6d21487","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"},"source_kind":"arxiv","source_id":"1712.06134","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-18T00:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vG9/RIPABY+hfak5/Hy5Ge3WqneoHVGgOOdsHoEo0I3CifjMXfZOw5aBq+fGvATLbNPQqpKkFB6Dh4BOAfFsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:32:55.950443Z"},"content_sha256":"31de9d6c6ef4353b96a79e468b76e8bd58954fe137232ee23d829606abdd7267","schema_version":"1.0","event_id":"sha256:31de9d6c6ef4353b96a79e468b76e8bd58954fe137232ee23d829606abdd7267"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GAQ3IGJRHCKVU4HDITBYJHS4R5","target":"graph","payload":{"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"},"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-18T00:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5DmSlrGsouEHO4YUguSknig4Wg/kfu7dYtNVnOAj7nT//0WBc/ZQX3cAXMge1ocEMpMsNYo/HRzeHXpHBCDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:32:55.950788Z"},"content_sha256":"58400d6fd637dfb93ff4d9eed08ddaa568a4b86974fa705bebdfc40ef8e0dee4","schema_version":"1.0","event_id":"sha256:58400d6fd637dfb93ff4d9eed08ddaa568a4b86974fa705bebdfc40ef8e0dee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/bundle.json","state_url":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/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-24T06:32:55Z","links":{"resolver":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5","bundle":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/bundle.json","state":"https://pith.science/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAQ3IGJRHCKVU4HDITBYJHS4R5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GAQ3IGJRHCKVU4HDITBYJHS4R5","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":"9fa00891fdbea2ab43a6fb43f41819fb4f0d15aaba507a36e8c1b1a93db02074","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-17T16:21:49Z","title_canon_sha256":"6f96f3ffe7672f186efcbb933ea27747d1bdea388456823b01a9b53899fffb52"},"schema_version":"1.0","source":{"id":"1712.06134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06134","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06134v1","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06134","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"GAQ3IGJRHCKV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GAQ3IGJRHCKVU4HD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GAQ3IGJR","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:58400d6fd637dfb93ff4d9eed08ddaa568a4b86974fa705bebdfc40ef8e0dee4","target":"graph","created_at":"2026-05-18T00:27:51Z","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":"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","authors_text":"Jesper Larsson Tr\\\"aff, Manuel P\\\"oter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-17T16:21:49Z","title":"A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06134","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:31de9d6c6ef4353b96a79e468b76e8bd58954fe137232ee23d829606abdd7267","target":"record","created_at":"2026-05-18T00:27:51Z","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":"9fa00891fdbea2ab43a6fb43f41819fb4f0d15aaba507a36e8c1b1a93db02074","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-17T16:21:49Z","title_canon_sha256":"6f96f3ffe7672f186efcbb933ea27747d1bdea388456823b01a9b53899fffb52"},"schema_version":"1.0","source":{"id":"1712.06134","kind":"arxiv","version":1}},"canonical_sha256":"3021b4193138955a70e344c3849e5c8f53d06bb78d732ba7cdfd3025f6d21487","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3021b4193138955a70e344c3849e5c8f53d06bb78d732ba7cdfd3025f6d21487","first_computed_at":"2026-05-18T00:27:51.001411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:51.001411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kp1CdyNiTgMAWMny/wRrBsMyq2kddcs6dDQeOX6FeU3Vv+oGkkXa1lFooxOO1gZPTMTffy0EcQcG5rPQDhgyAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:51.001847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31de9d6c6ef4353b96a79e468b76e8bd58954fe137232ee23d829606abdd7267","sha256:58400d6fd637dfb93ff4d9eed08ddaa568a4b86974fa705bebdfc40ef8e0dee4"],"state_sha256":"44f2e26ee262f142a1cbad2ee2cee98cb3059bfafee1cf926fb737cdf9a26c89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eyONy65uOZ5IGmGeChnAndOoN1Q9zh/FrMFP5AT3M1E1YPkRHos4TBLDH5TyOI9IMlGuzw66y7eWaa6ZHGEZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:32:55.952659Z","bundle_sha256":"b519c6b9ee537b7c3a0492e98594684647ace1c705f9d02aba2df2c8fde0bcce"}}