{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WOZ447GRWKH4G6W54L7XZJZ3BU","short_pith_number":"pith:WOZ447GR","schema_version":"1.0","canonical_sha256":"b3b3ce7cd1b28fc37adde2ff7ca73b0d2a9afadd76651b9e5ad342268cf55299","source":{"kind":"arxiv","id":"1112.1141","version":1},"attestation_state":"computed","paper":{"title":"Highly-Concurrent Doubly-Linked Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Ed Zhu, Fabiano C. Botelho, Nitin Garg","submitted_at":"2011-12-06T01:37:51Z","abstract_excerpt":"As file systems are increasingly being deployed on ever larger systems with many cores and multi-gigabytes of memory, scaling the internal data structures of file systems has taken greater importance and urgency. A doubly-linked list is a simple and very commonly used data structure in file systems but it is not very friendly to multi-threaded use. While special cases of lists, such as queues and stacks, have lock-free versions that scale reasonably well, the general form of a doubly-linked list offers no such solution. Using a mutex to serialize all operations remains the de-facto method of m"},"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":"1112.1141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T01:37:51Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d2e2ef937e39abccd2c2a86894c35d10df7403f1edaf93ecae2852baa1a0d532","abstract_canon_sha256":"7e093063d5910d141cfa097a05cc555df62f771705963c3b7f0d9fa377f04125"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:56.182173Z","signature_b64":"zsTaeiFVdtRYOA1PJh7AORVql+d88QSN1OVUeluflvmpzdpGPWssCrIltTsDT31cX5ewolwOLJ+DmGjZkFIrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3b3ce7cd1b28fc37adde2ff7ca73b0d2a9afadd76651b9e5ad342268cf55299","last_reissued_at":"2026-05-18T04:06:56.181484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:56.181484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Highly-Concurrent Doubly-Linked Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Ed Zhu, Fabiano C. Botelho, Nitin Garg","submitted_at":"2011-12-06T01:37:51Z","abstract_excerpt":"As file systems are increasingly being deployed on ever larger systems with many cores and multi-gigabytes of memory, scaling the internal data structures of file systems has taken greater importance and urgency. A doubly-linked list is a simple and very commonly used data structure in file systems but it is not very friendly to multi-threaded use. While special cases of lists, such as queues and stacks, have lock-free versions that scale reasonably well, the general form of a doubly-linked list offers no such solution. Using a mutex to serialize all operations remains the de-facto method of m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1141","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":"1112.1141","created_at":"2026-05-18T04:06:56.181600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1141v1","created_at":"2026-05-18T04:06:56.181600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1141","created_at":"2026-05-18T04:06:56.181600+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOZ447GRWKH4","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOZ447GRWKH4G6W5","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOZ447GR","created_at":"2026-05-18T12:26:44.992195+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/WOZ447GRWKH4G6W54L7XZJZ3BU","json":"https://pith.science/pith/WOZ447GRWKH4G6W54L7XZJZ3BU.json","graph_json":"https://pith.science/api/pith-number/WOZ447GRWKH4G6W54L7XZJZ3BU/graph.json","events_json":"https://pith.science/api/pith-number/WOZ447GRWKH4G6W54L7XZJZ3BU/events.json","paper":"https://pith.science/paper/WOZ447GR"},"agent_actions":{"view_html":"https://pith.science/pith/WOZ447GRWKH4G6W54L7XZJZ3BU","download_json":"https://pith.science/pith/WOZ447GRWKH4G6W54L7XZJZ3BU.json","view_paper":"https://pith.science/paper/WOZ447GR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1141&json=true","fetch_graph":"https://pith.science/api/pith-number/WOZ447GRWKH4G6W54L7XZJZ3BU/graph.json","fetch_events":"https://pith.science/api/pith-number/WOZ447GRWKH4G6W54L7XZJZ3BU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOZ447GRWKH4G6W54L7XZJZ3BU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOZ447GRWKH4G6W54L7XZJZ3BU/action/storage_attestation","attest_author":"https://pith.science/pith/WOZ447GRWKH4G6W54L7XZJZ3BU/action/author_attestation","sign_citation":"https://pith.science/pith/WOZ447GRWKH4G6W54L7XZJZ3BU/action/citation_signature","submit_replication":"https://pith.science/pith/WOZ447GRWKH4G6W54L7XZJZ3BU/action/replication_record"}},"created_at":"2026-05-18T04:06:56.181600+00:00","updated_at":"2026-05-18T04:06:56.181600+00:00"}