{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6ZEB6IBRPDHSEYXDVI7X6W3JU7","short_pith_number":"pith:6ZEB6IBR","schema_version":"1.0","canonical_sha256":"f6481f203178cf2262e3aa3f7f5b69a7d6ecf0aee8beb5a4fbdeb8a311d9e882","source":{"kind":"arxiv","id":"1712.05406","version":1},"attestation_state":"computed","paper":{"title":"Techniques for Constructing Efficient Lock-free Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Trevor Brown","submitted_at":"2017-12-14T18:25:12Z","abstract_excerpt":"Building a library of concurrent data structures is an essential way to simplify the difficult task of developing concurrent software. Lock-free data structures, in which processes can help one another to complete operations, offer the following progress guarantee: If processes take infinitely many steps, then infinitely many operations are performed. Handcrafted lock-free data structures can be very efficient, but are notoriously difficult to implement. We introduce numerous tools that support the development of efficient lock-free data structures, and especially trees."},"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.05406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-14T18:25:12Z","cross_cats_sorted":[],"title_canon_sha256":"f3eebcd73b49998e8ce2275b17420b6a0dc233675cfac447575813bae7aa8174","abstract_canon_sha256":"003cf5a851d7c27f0b5cd1caa3db91f19324465d1a6f607e68171c72f2da3376"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:56.550955Z","signature_b64":"JuD456h4YfSu5uF/lh3UIN0pILPCPoRd1H6UFA2cSbIUCPnlxx9aYA6UxuHc+Q9PhHYddAFQi49p69Rmms69Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6481f203178cf2262e3aa3f7f5b69a7d6ecf0aee8beb5a4fbdeb8a311d9e882","last_reissued_at":"2026-05-18T00:27:56.550154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:56.550154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Techniques for Constructing Efficient Lock-free Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Trevor Brown","submitted_at":"2017-12-14T18:25:12Z","abstract_excerpt":"Building a library of concurrent data structures is an essential way to simplify the difficult task of developing concurrent software. Lock-free data structures, in which processes can help one another to complete operations, offer the following progress guarantee: If processes take infinitely many steps, then infinitely many operations are performed. Handcrafted lock-free data structures can be very efficient, but are notoriously difficult to implement. We introduce numerous tools that support the development of efficient lock-free data structures, and especially trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05406","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.05406","created_at":"2026-05-18T00:27:56.550267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05406v1","created_at":"2026-05-18T00:27:56.550267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05406","created_at":"2026-05-18T00:27:56.550267+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZEB6IBRPDHS","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZEB6IBRPDHSEYXD","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZEB6IBR","created_at":"2026-05-18T12:31:03.183658+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/6ZEB6IBRPDHSEYXDVI7X6W3JU7","json":"https://pith.science/pith/6ZEB6IBRPDHSEYXDVI7X6W3JU7.json","graph_json":"https://pith.science/api/pith-number/6ZEB6IBRPDHSEYXDVI7X6W3JU7/graph.json","events_json":"https://pith.science/api/pith-number/6ZEB6IBRPDHSEYXDVI7X6W3JU7/events.json","paper":"https://pith.science/paper/6ZEB6IBR"},"agent_actions":{"view_html":"https://pith.science/pith/6ZEB6IBRPDHSEYXDVI7X6W3JU7","download_json":"https://pith.science/pith/6ZEB6IBRPDHSEYXDVI7X6W3JU7.json","view_paper":"https://pith.science/paper/6ZEB6IBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05406&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZEB6IBRPDHSEYXDVI7X6W3JU7/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZEB6IBRPDHSEYXDVI7X6W3JU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZEB6IBRPDHSEYXDVI7X6W3JU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZEB6IBRPDHSEYXDVI7X6W3JU7/action/storage_attestation","attest_author":"https://pith.science/pith/6ZEB6IBRPDHSEYXDVI7X6W3JU7/action/author_attestation","sign_citation":"https://pith.science/pith/6ZEB6IBRPDHSEYXDVI7X6W3JU7/action/citation_signature","submit_replication":"https://pith.science/pith/6ZEB6IBRPDHSEYXDVI7X6W3JU7/action/replication_record"}},"created_at":"2026-05-18T00:27:56.550267+00:00","updated_at":"2026-05-18T00:27:56.550267+00:00"}