{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GXPZJY73AJW5VKNJB73TSKVLTR","short_pith_number":"pith:GXPZJY73","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"},"canonical_sha256":"35df94e3fb026ddaa9a90ff7392aab9c6afefad1ffbaa82496c04bc0b99d211d","source":{"kind":"arxiv","id":"2408.13779","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.13779","created_at":"2026-07-05T08:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"2408.13779v1","created_at":"2026-07-05T08:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.13779","created_at":"2026-07-05T08:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"GXPZJY73AJW5","created_at":"2026-07-05T08:58:55Z"},{"alias_kind":"pith_short_16","alias_value":"GXPZJY73AJW5VKNJ","created_at":"2026-07-05T08:58:55Z"},{"alias_kind":"pith_short_8","alias_value":"GXPZJY73","created_at":"2026-07-05T08:58:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GXPZJY73AJW5VKNJB73TSKVLTR","target":"record","payload":{"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"},"canonical_sha256":"35df94e3fb026ddaa9a90ff7392aab9c6afefad1ffbaa82496c04bc0b99d211d","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"},"source_kind":"arxiv","source_id":"2408.13779","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-07-05T08:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tv631SLofRJI329L22M5yf44fOpQQLSbitQle/NwBlnYD2JJBPK4Bqf5bK7i7VQO4hevx1WRGDVMkoQJRNrYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T07:38:49.503392Z"},"content_sha256":"91fc0d1073ad020179975dd08810cbead65694ce0f78c80559e808ff5f4b7331","schema_version":"1.0","event_id":"sha256:91fc0d1073ad020179975dd08810cbead65694ce0f78c80559e808ff5f4b7331"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GXPZJY73AJW5VKNJB73TSKVLTR","target":"graph","payload":{"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"},"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-07-05T08:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZkfsgwEG6KWZ5dHQEzvtKmPRZg/82gYifDmQ4cCBwyeixX4ktPjpa5X9V85ML6CEpkmRE22ILqGvl5A4FXLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T07:38:49.503768Z"},"content_sha256":"b5aaba7c33414183005fd3f56c3548b9ec702f54bc552a72c4abd2870f3515d6","schema_version":"1.0","event_id":"sha256:b5aaba7c33414183005fd3f56c3548b9ec702f54bc552a72c4abd2870f3515d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR/bundle.json","state_url":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXPZJY73AJW5VKNJB73TSKVLTR/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-07-06T07:38:49Z","links":{"resolver":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR","bundle":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR/bundle.json","state":"https://pith.science/pith/GXPZJY73AJW5VKNJB73TSKVLTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXPZJY73AJW5VKNJB73TSKVLTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GXPZJY73AJW5VKNJB73TSKVLTR","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":"d515295bfeca3af23560e2f27c0d00f071bbf4646dfe442f79ab9dcf5a500230","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2024-08-25T09:13:56Z","title_canon_sha256":"d8c8dd1941b1660486c5363f7cd601e9d4b56434c5b6dbe51d80dd5c3144a7e8"},"schema_version":"1.0","source":{"id":"2408.13779","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.13779","created_at":"2026-07-05T08:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"2408.13779v1","created_at":"2026-07-05T08:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.13779","created_at":"2026-07-05T08:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"GXPZJY73AJW5","created_at":"2026-07-05T08:58:55Z"},{"alias_kind":"pith_short_16","alias_value":"GXPZJY73AJW5VKNJ","created_at":"2026-07-05T08:58:55Z"},{"alias_kind":"pith_short_8","alias_value":"GXPZJY73","created_at":"2026-07-05T08:58:55Z"}],"graph_snapshots":[{"event_id":"sha256:b5aaba7c33414183005fd3f56c3548b9ec702f54bc552a72c4abd2870f3515d6","target":"graph","created_at":"2026-07-05T08:58:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.13779/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Callista Le, Ilya Sergey, Kiran Gopinathan, Koon Wen Lee, Seth Gilbert","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2024-08-25T09:13:56Z","title":"Concurrent Data Structures Made Easy (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.13779","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:91fc0d1073ad020179975dd08810cbead65694ce0f78c80559e808ff5f4b7331","target":"record","created_at":"2026-07-05T08:58:55Z","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":"d515295bfeca3af23560e2f27c0d00f071bbf4646dfe442f79ab9dcf5a500230","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2024-08-25T09:13:56Z","title_canon_sha256":"d8c8dd1941b1660486c5363f7cd601e9d4b56434c5b6dbe51d80dd5c3144a7e8"},"schema_version":"1.0","source":{"id":"2408.13779","kind":"arxiv","version":1}},"canonical_sha256":"35df94e3fb026ddaa9a90ff7392aab9c6afefad1ffbaa82496c04bc0b99d211d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35df94e3fb026ddaa9a90ff7392aab9c6afefad1ffbaa82496c04bc0b99d211d","first_computed_at":"2026-07-05T08:58:55.489661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:58:55.489661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mb45Mp/Vqk0ySUYzSHtgLD3wN48ajQiztMPhbvIzO94vs2azdwklEGDMgBpF4GdKcQlyWjhXAmXdgnPBVypHDw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:58:55.490124Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.13779","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91fc0d1073ad020179975dd08810cbead65694ce0f78c80559e808ff5f4b7331","sha256:b5aaba7c33414183005fd3f56c3548b9ec702f54bc552a72c4abd2870f3515d6"],"state_sha256":"1119a36edfbbe73d0e3f28cd7500413c3b1f3e9aa601215382b06b90a1c4f8fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nEWGn8DcRVGI33d1ZAl3F5Nv0tuKm0pJSJSO5GN2nGzitr4c7wZr+D3fpWu16D50L37fc+uAPTFdvOil429QBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T07:38:49.505785Z","bundle_sha256":"38d7aa49b2e64fa200750d74e04b3a6c559772650d4a37372f8e31e9ab091703"}}