{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GXPZJY73AJW5VKNJB73TSKVLTR","short_pith_number":"pith:GXPZJY73","schema_version":"1.0","canonical_sha256":"35df94e3fb026ddaa9a90ff7392aab9c6afefad1ffbaa82496c04bc0b99d211d","source":{"kind":"arxiv","id":"2408.13779","version":1},"attestation_state":"computed","paper":{"title":"Concurrent Data Structures Made Easy (Extended Version)","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Callista Le, Ilya Sergey, Kiran Gopinathan, Koon Wen Lee, Seth Gilbert","submitted_at":"2024-08-25T09:13:56Z","abstract_excerpt":"Design of an efficient thread-safe concurrent data structure is a balancing act between its implementation complexity and performance. Lock-based concurrent data structures, which are relatively easy to derive from their sequential counterparts and to prove thread-safe, suffer from poor throughput under even light multi-threaded workload. At the same time, lock-free concurrent structures allow for high throughput, but are notoriously difficult to get right and require careful reasoning to formally establish their correctness.\n  We explore a solution to this conundrum based on batch parallelism"},"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":"2408.13779","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2024-08-25T09:13:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d8c8dd1941b1660486c5363f7cd601e9d4b56434c5b6dbe51d80dd5c3144a7e8","abstract_canon_sha256":"d515295bfeca3af23560e2f27c0d00f071bbf4646dfe442f79ab9dcf5a500230"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:55.490124Z","signature_b64":"Mb45Mp/Vqk0ySUYzSHtgLD3wN48ajQiztMPhbvIzO94vs2azdwklEGDMgBpF4GdKcQlyWjhXAmXdgnPBVypHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35df94e3fb026ddaa9a90ff7392aab9c6afefad1ffbaa82496c04bc0b99d211d","last_reissued_at":"2026-07-05T08:58:55.489661Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:55.489661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concurrent Data Structures Made Easy (Extended Version)","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Callista Le, Ilya Sergey, Kiran Gopinathan, Koon Wen Lee, Seth Gilbert","submitted_at":"2024-08-25T09:13:56Z","abstract_excerpt":"Design of an efficient thread-safe concurrent data structure is a balancing act between its implementation complexity and performance. Lock-based concurrent data structures, which are relatively easy to derive from their sequential counterparts and to prove thread-safe, suffer from poor throughput under even light multi-threaded workload. At the same time, lock-free concurrent structures allow for high throughput, but are notoriously difficult to get right and require careful reasoning to formally establish their correctness.\n  We explore a solution to this conundrum based on batch parallelism"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.13779","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.13779/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2408.13779","created_at":"2026-07-05T08:58:55.489717+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.13779v1","created_at":"2026-07-05T08:58:55.489717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.13779","created_at":"2026-07-05T08:58:55.489717+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXPZJY73AJW5","created_at":"2026-07-05T08:58:55.489717+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXPZJY73AJW5VKNJ","created_at":"2026-07-05T08:58:55.489717+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXPZJY73","created_at":"2026-07-05T08:58:55.489717+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/GXPZJY73AJW5VKNJB73TSKVLTR","json":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR.json","graph_json":"https://pith.science/api/pith-number/GXPZJY73AJW5VKNJB73TSKVLTR/graph.json","events_json":"https://pith.science/api/pith-number/GXPZJY73AJW5VKNJB73TSKVLTR/events.json","paper":"https://pith.science/paper/GXPZJY73"},"agent_actions":{"view_html":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR","download_json":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR.json","view_paper":"https://pith.science/paper/GXPZJY73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.13779&json=true","fetch_graph":"https://pith.science/api/pith-number/GXPZJY73AJW5VKNJB73TSKVLTR/graph.json","fetch_events":"https://pith.science/api/pith-number/GXPZJY73AJW5VKNJB73TSKVLTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR/action/storage_attestation","attest_author":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR/action/author_attestation","sign_citation":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR/action/citation_signature","submit_replication":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR/action/replication_record"}},"created_at":"2026-07-05T08:58:55.489717+00:00","updated_at":"2026-07-05T08:58:55.489717+00:00"}