{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N5BDN4YGTGKK7JKFNDGIBFG4EA","short_pith_number":"pith:N5BDN4YG","schema_version":"1.0","canonical_sha256":"6f4236f3069994afa54568cc8094dc2011fb488dd4d1797ece8cc22a36e493b9","source":{"kind":"arxiv","id":"1708.04838","version":1},"attestation_state":"computed","paper":{"title":"A Template for Implementing Fast Lock-free Trees Using HTM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Trevor Brown","submitted_at":"2017-08-16T10:35:25Z","abstract_excerpt":"Algorithms that use hardware transactional memory (HTM) must provide a software-only fallback path to guarantee progress. The design of the fallback path can have a profound impact on performance. If the fallback path is allowed to run concurrently with hardware transactions, then hardware transactions must be instrumented, adding significant overhead. Otherwise, hardware transactions must wait for any processes on the fallback path, causing concurrency bottlenecks, or move to the fallback path. We introduce an approach that combines the best of both worlds. The key idea is to use three execut"},"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":"1708.04838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-16T10:35:25Z","cross_cats_sorted":[],"title_canon_sha256":"53ae9f0462d814d6a7029177db79502266b340bbb0f2ff52a5451b25a8fc7428","abstract_canon_sha256":"9c212f0bf801fdcd444c19b4a8441ba2f5f8b572d1cafe8ce82489c6ecc1f173"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:57.228562Z","signature_b64":"DsovuhL0CR9qlIsQWKAp/ql8VBc3EvOsYLEa9D6/twxfq93WXX5RT9IZLBARaS/8b9+Y69OpVtI0bQE1WK+bDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f4236f3069994afa54568cc8094dc2011fb488dd4d1797ece8cc22a36e493b9","last_reissued_at":"2026-05-18T00:37:57.228024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:57.228024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Template for Implementing Fast Lock-free Trees Using HTM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Trevor Brown","submitted_at":"2017-08-16T10:35:25Z","abstract_excerpt":"Algorithms that use hardware transactional memory (HTM) must provide a software-only fallback path to guarantee progress. The design of the fallback path can have a profound impact on performance. If the fallback path is allowed to run concurrently with hardware transactions, then hardware transactions must be instrumented, adding significant overhead. Otherwise, hardware transactions must wait for any processes on the fallback path, causing concurrency bottlenecks, or move to the fallback path. We introduce an approach that combines the best of both worlds. The key idea is to use three execut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04838","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":"1708.04838","created_at":"2026-05-18T00:37:57.228124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04838v1","created_at":"2026-05-18T00:37:57.228124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04838","created_at":"2026-05-18T00:37:57.228124+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5BDN4YGTGKK","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5BDN4YGTGKK7JKF","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5BDN4YG","created_at":"2026-05-18T12:31:31.346846+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/N5BDN4YGTGKK7JKFNDGIBFG4EA","json":"https://pith.science/pith/N5BDN4YGTGKK7JKFNDGIBFG4EA.json","graph_json":"https://pith.science/api/pith-number/N5BDN4YGTGKK7JKFNDGIBFG4EA/graph.json","events_json":"https://pith.science/api/pith-number/N5BDN4YGTGKK7JKFNDGIBFG4EA/events.json","paper":"https://pith.science/paper/N5BDN4YG"},"agent_actions":{"view_html":"https://pith.science/pith/N5BDN4YGTGKK7JKFNDGIBFG4EA","download_json":"https://pith.science/pith/N5BDN4YGTGKK7JKFNDGIBFG4EA.json","view_paper":"https://pith.science/paper/N5BDN4YG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04838&json=true","fetch_graph":"https://pith.science/api/pith-number/N5BDN4YGTGKK7JKFNDGIBFG4EA/graph.json","fetch_events":"https://pith.science/api/pith-number/N5BDN4YGTGKK7JKFNDGIBFG4EA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5BDN4YGTGKK7JKFNDGIBFG4EA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5BDN4YGTGKK7JKFNDGIBFG4EA/action/storage_attestation","attest_author":"https://pith.science/pith/N5BDN4YGTGKK7JKFNDGIBFG4EA/action/author_attestation","sign_citation":"https://pith.science/pith/N5BDN4YGTGKK7JKFNDGIBFG4EA/action/citation_signature","submit_replication":"https://pith.science/pith/N5BDN4YGTGKK7JKFNDGIBFG4EA/action/replication_record"}},"created_at":"2026-05-18T00:37:57.228124+00:00","updated_at":"2026-05-18T00:37:57.228124+00:00"}