{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KC66BX7PW5UFIIJMQ6RFOUMDBJ","short_pith_number":"pith:KC66BX7P","canonical_record":{"source":{"id":"1712.01044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-04T12:44:28Z","cross_cats_sorted":[],"title_canon_sha256":"48f9c1493b34a26d3e867a926aaee42b4dd76400075f5c0dcead33d8447dc3bc","abstract_canon_sha256":"88e08c2ec2370da0636c536624f2295153464d22540b611493fcf62c121ce507"},"schema_version":"1.0"},"canonical_sha256":"50bde0dfefb76854212c87a25751830a7a9833e70938ac18a5dfc3427f9816a7","source":{"kind":"arxiv","id":"1712.01044","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01044","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01044v1","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01044","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"pith_short_12","alias_value":"KC66BX7PW5UF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KC66BX7PW5UFIIJM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KC66BX7P","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KC66BX7PW5UFIIJMQ6RFOUMDBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-04T12:44:28Z","cross_cats_sorted":[],"title_canon_sha256":"48f9c1493b34a26d3e867a926aaee42b4dd76400075f5c0dcead33d8447dc3bc","abstract_canon_sha256":"88e08c2ec2370da0636c536624f2295153464d22540b611493fcf62c121ce507"},"schema_version":"1.0"},"canonical_sha256":"50bde0dfefb76854212c87a25751830a7a9833e70938ac18a5dfc3427f9816a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:59.649473Z","signature_b64":"9GIWDd/7dBoYqc5FQWhQMbVZwPHQYImr73nzGmVnHNfX/b1SqloxPWKbObImII9wa1wWytelQh1IO9zmrDIyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50bde0dfefb76854212c87a25751830a7a9833e70938ac18a5dfc3427f9816a7","last_reissued_at":"2026-05-18T00:28:59.649074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:59.649074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01044","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:28:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lB1N94VS2x1WthY0gr0ISbIj/seIwKV001SQhFPnNRskDeBwtimK2qBJXAFQ0fcX6mYXWEArJ7WmSo5Mt7HKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:18:48.316876Z"},"content_sha256":"075296507a4ff2967ba5490ce1ee707efbab8beb40fbe9dae7c0f610e71460e2","schema_version":"1.0","event_id":"sha256:075296507a4ff2967ba5490ce1ee707efbab8beb40fbe9dae7c0f610e71460e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KC66BX7PW5UFIIJMQ6RFOUMDBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reclaiming memory for lock-free data structures: there has to be a better way","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Trevor Brown","submitted_at":"2017-12-04T12:44:28Z","abstract_excerpt":"Memory reclamation for lock-based data structures is typically easy. However, it is a significant challenge for lock-free data structures. Automatic techniques such as garbage collection are inefficient or use locks, and non-automatic techniques either have high overhead, or do not work for many data structures. For example, subtle problems can arise when hazard pointers, one of the most common non-automatic techniques, are applied to many lock-free data structures. Epoch based reclamation (EBR), which is by far the most efficient non-automatic technique, allows the number of unreclaimed objec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01044","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:28:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ul5Q+vm3pCAy67Cfh/0dY4l8hwJwEYw0J+rJ8c/jUM7R1o6zYBX4sjkEB4g/6FQk1fqQb9vxwX/SQTssLJVWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:18:48.317217Z"},"content_sha256":"00ba5601baae34ca10d0d56411ced0fab93569985d1d4fea8c2bd0fc38890c17","schema_version":"1.0","event_id":"sha256:00ba5601baae34ca10d0d56411ced0fab93569985d1d4fea8c2bd0fc38890c17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KC66BX7PW5UFIIJMQ6RFOUMDBJ/bundle.json","state_url":"https://pith.science/pith/KC66BX7PW5UFIIJMQ6RFOUMDBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KC66BX7PW5UFIIJMQ6RFOUMDBJ/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-08T10:18:48Z","links":{"resolver":"https://pith.science/pith/KC66BX7PW5UFIIJMQ6RFOUMDBJ","bundle":"https://pith.science/pith/KC66BX7PW5UFIIJMQ6RFOUMDBJ/bundle.json","state":"https://pith.science/pith/KC66BX7PW5UFIIJMQ6RFOUMDBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KC66BX7PW5UFIIJMQ6RFOUMDBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KC66BX7PW5UFIIJMQ6RFOUMDBJ","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":"88e08c2ec2370da0636c536624f2295153464d22540b611493fcf62c121ce507","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-04T12:44:28Z","title_canon_sha256":"48f9c1493b34a26d3e867a926aaee42b4dd76400075f5c0dcead33d8447dc3bc"},"schema_version":"1.0","source":{"id":"1712.01044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01044","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01044v1","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01044","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"pith_short_12","alias_value":"KC66BX7PW5UF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KC66BX7PW5UFIIJM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KC66BX7P","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:00ba5601baae34ca10d0d56411ced0fab93569985d1d4fea8c2bd0fc38890c17","target":"graph","created_at":"2026-05-18T00:28:59Z","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 reclamation for lock-based data structures is typically easy. However, it is a significant challenge for lock-free data structures. Automatic techniques such as garbage collection are inefficient or use locks, and non-automatic techniques either have high overhead, or do not work for many data structures. For example, subtle problems can arise when hazard pointers, one of the most common non-automatic techniques, are applied to many lock-free data structures. Epoch based reclamation (EBR), which is by far the most efficient non-automatic technique, allows the number of unreclaimed objec","authors_text":"Trevor Brown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-04T12:44:28Z","title":"Reclaiming memory for lock-free data structures: there has to be a better way"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01044","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:075296507a4ff2967ba5490ce1ee707efbab8beb40fbe9dae7c0f610e71460e2","target":"record","created_at":"2026-05-18T00:28:59Z","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":"88e08c2ec2370da0636c536624f2295153464d22540b611493fcf62c121ce507","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-04T12:44:28Z","title_canon_sha256":"48f9c1493b34a26d3e867a926aaee42b4dd76400075f5c0dcead33d8447dc3bc"},"schema_version":"1.0","source":{"id":"1712.01044","kind":"arxiv","version":1}},"canonical_sha256":"50bde0dfefb76854212c87a25751830a7a9833e70938ac18a5dfc3427f9816a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50bde0dfefb76854212c87a25751830a7a9833e70938ac18a5dfc3427f9816a7","first_computed_at":"2026-05-18T00:28:59.649074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:59.649074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9GIWDd/7dBoYqc5FQWhQMbVZwPHQYImr73nzGmVnHNfX/b1SqloxPWKbObImII9wa1wWytelQh1IO9zmrDIyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:59.649473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:075296507a4ff2967ba5490ce1ee707efbab8beb40fbe9dae7c0f610e71460e2","sha256:00ba5601baae34ca10d0d56411ced0fab93569985d1d4fea8c2bd0fc38890c17"],"state_sha256":"795c9c3078c6c5deb95c3a8d390b2bd7684f315c514cddfc5ba303d4cb190f93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkBY3N99IXtCC1LUXwvVa25tT0hwc7vxvFDwBy4DecXQIC5TbGm1FM2dMVYJUpeO+uz3gjI6L9/zNBttWHKYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:18:48.319111Z","bundle_sha256":"63872c0d9ef52bc109438543391edecfa4cff1f4c2262def9b800a5cb5fe9d90"}}