{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BNMRK2Z42PFHIDVUUK3EI7D7KL","short_pith_number":"pith:BNMRK2Z4","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"},"canonical_sha256":"0b59156b3cd3ca740eb4a2b6447c7f52ff6eeab98256d01dc7b144e98b4fc879","source":{"kind":"arxiv","id":"1805.08639","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08639","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08639v2","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08639","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"BNMRK2Z42PFH","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BNMRK2Z42PFHIDVU","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BNMRK2Z4","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BNMRK2Z42PFHIDVUUK3EI7D7KL","target":"record","payload":{"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"},"canonical_sha256":"0b59156b3cd3ca740eb4a2b6447c7f52ff6eeab98256d01dc7b144e98b4fc879","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"},"source_kind":"arxiv","source_id":"1805.08639","source_version":2,"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:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nL5Hu/AL3//P3nZNl7vdrBSmDJVD/vBBiziWMw6OK3ZfMk9IXRKhepkvtK7Z5to66XRI22N/+IWkHz2lAMJuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:40:54.485256Z"},"content_sha256":"4068f05d9a3e11fa08c7ae0b6ddbacaba2f8015c1f9b614e1830be9604b2ea4c","schema_version":"1.0","event_id":"sha256:4068f05d9a3e11fa08c7ae0b6ddbacaba2f8015c1f9b614e1830be9604b2ea4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BNMRK2Z42PFHIDVUUK3EI7D7KL","target":"graph","payload":{"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"},"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:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QitY8gMtKsrKELxaulJ+zHtYOOlM7rYqDacOIDIA4xnEmd4XK+3NMhTQTyF39w6m9GL5Eq3eYNeN7AqBvsCZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:40:54.485640Z"},"content_sha256":"1c598a1669464af701f57beb3c0dc45129709a54a2ca483decb934ecfd4c3216","schema_version":"1.0","event_id":"sha256:1c598a1669464af701f57beb3c0dc45129709a54a2ca483decb934ecfd4c3216"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/bundle.json","state_url":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/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:40:54Z","links":{"resolver":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL","bundle":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/bundle.json","state":"https://pith.science/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNMRK2Z42PFHIDVUUK3EI7D7KL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BNMRK2Z42PFHIDVUUK3EI7D7KL","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":"4919163eea4dce9d63b27a640f1daa3e4a82c704cfb2bad82ce3b9649dc5a2bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-21T17:05:37Z","title_canon_sha256":"cc21e8d1ffa267825ba853efd7f4cc0aa35055e853ac3ded4825ed640903757a"},"schema_version":"1.0","source":{"id":"1805.08639","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08639","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08639v2","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08639","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"BNMRK2Z42PFH","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BNMRK2Z42PFHIDVU","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BNMRK2Z4","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:1c598a1669464af701f57beb3c0dc45129709a54a2ca483decb934ecfd4c3216","target":"graph","created_at":"2026-05-18T00:02:44Z","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":"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.","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":"2018-05-21T17:05:37Z","title":"Stamp-it: A more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08639","kind":"arxiv","version":2},"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:4068f05d9a3e11fa08c7ae0b6ddbacaba2f8015c1f9b614e1830be9604b2ea4c","target":"record","created_at":"2026-05-18T00:02:44Z","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":"4919163eea4dce9d63b27a640f1daa3e4a82c704cfb2bad82ce3b9649dc5a2bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-21T17:05:37Z","title_canon_sha256":"cc21e8d1ffa267825ba853efd7f4cc0aa35055e853ac3ded4825ed640903757a"},"schema_version":"1.0","source":{"id":"1805.08639","kind":"arxiv","version":2}},"canonical_sha256":"0b59156b3cd3ca740eb4a2b6447c7f52ff6eeab98256d01dc7b144e98b4fc879","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b59156b3cd3ca740eb4a2b6447c7f52ff6eeab98256d01dc7b144e98b4fc879","first_computed_at":"2026-05-18T00:02:44.821113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:44.821113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dqNIt61gXiZ0sRgRc4mwYQxyVP7qJXoE+deUrrCz7UXiKF6bCR/4XplEJ9bDZwzkIGWA6ikrRqWW45b9a/1PBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:44.821636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08639","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4068f05d9a3e11fa08c7ae0b6ddbacaba2f8015c1f9b614e1830be9604b2ea4c","sha256:1c598a1669464af701f57beb3c0dc45129709a54a2ca483decb934ecfd4c3216"],"state_sha256":"2e3b9aaa525c8231487ab217e03f06eb7433d59c4cb606114bda04f9e7016ab9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpHZKn4dE+Vg5Pm/+OzFcHm7KQ1mjejyeO4VzazFGifoyH+UCX8OTrIMmRk++Ant0dy/iy9e+6ex6cPsLVFfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:40:54.487635Z","bundle_sha256":"4a1501b265e00f4161761aea88c287e5cafc16b8c29c40db779ee3a8c4d3bfd8"}}