{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:M7FCAQFYCFSHWF7MATAYSAHBJN","short_pith_number":"pith:M7FCAQFY","schema_version":"1.0","canonical_sha256":"67ca2040b811647b17ec04c18900e14b6656335c6b91db122465e49055762a88","source":{"kind":"arxiv","id":"2309.03642","version":1},"attestation_state":"computed","paper":{"title":"Formal Verification of Chase-Lev Deque in Concurrent Separation Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Jaemin Choi","submitted_at":"2023-05-20T16:31:36Z","abstract_excerpt":"Chase-Lev deque is a concurrent data structure designed for efficient load balancing in multiprocessor scheduling. It employs a work-stealing strategy, where each thread possesses its own work-stealing deque to store tasks, and idle threads steal tasks from other threads. However, given the inherent risk of bugs in software, particularly in a multiprocessor environment, it is crucial to formally establish the correctness of programs and data structures. To our knowledge, no formal verification work for the Chase-Lev deque has met three key criteria: (1) utilizing a minimal trusted computing ba"},"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":"2309.03642","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-05-20T16:31:36Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"c202295229475e1cf53579b1b2cf49315923ba56f6fe2aeb60043873e647184d","abstract_canon_sha256":"e8a830d2e3c80f2a223bcb51fadd045a19897bd909889eb7447f537f0efcc870"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:48:39.858754Z","signature_b64":"AucEhYhuqlE0utKTOVGBVuGn9RZAjEBdgQTY7/Yiuhjal9oAHcW9njwa1ujvllvn4G5NR33FwtGF1WjcvbuTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67ca2040b811647b17ec04c18900e14b6656335c6b91db122465e49055762a88","last_reissued_at":"2026-07-05T06:48:39.858262Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:48:39.858262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Verification of Chase-Lev Deque in Concurrent Separation Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Jaemin Choi","submitted_at":"2023-05-20T16:31:36Z","abstract_excerpt":"Chase-Lev deque is a concurrent data structure designed for efficient load balancing in multiprocessor scheduling. It employs a work-stealing strategy, where each thread possesses its own work-stealing deque to store tasks, and idle threads steal tasks from other threads. However, given the inherent risk of bugs in software, particularly in a multiprocessor environment, it is crucial to formally establish the correctness of programs and data structures. To our knowledge, no formal verification work for the Chase-Lev deque has met three key criteria: (1) utilizing a minimal trusted computing ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.03642","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/2309.03642/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":"2309.03642","created_at":"2026-07-05T06:48:39.858324+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.03642v1","created_at":"2026-07-05T06:48:39.858324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.03642","created_at":"2026-07-05T06:48:39.858324+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7FCAQFYCFSH","created_at":"2026-07-05T06:48:39.858324+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7FCAQFYCFSHWF7M","created_at":"2026-07-05T06:48:39.858324+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7FCAQFY","created_at":"2026-07-05T06:48:39.858324+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/M7FCAQFYCFSHWF7MATAYSAHBJN","json":"https://pith.science/pith/M7FCAQFYCFSHWF7MATAYSAHBJN.json","graph_json":"https://pith.science/api/pith-number/M7FCAQFYCFSHWF7MATAYSAHBJN/graph.json","events_json":"https://pith.science/api/pith-number/M7FCAQFYCFSHWF7MATAYSAHBJN/events.json","paper":"https://pith.science/paper/M7FCAQFY"},"agent_actions":{"view_html":"https://pith.science/pith/M7FCAQFYCFSHWF7MATAYSAHBJN","download_json":"https://pith.science/pith/M7FCAQFYCFSHWF7MATAYSAHBJN.json","view_paper":"https://pith.science/paper/M7FCAQFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.03642&json=true","fetch_graph":"https://pith.science/api/pith-number/M7FCAQFYCFSHWF7MATAYSAHBJN/graph.json","fetch_events":"https://pith.science/api/pith-number/M7FCAQFYCFSHWF7MATAYSAHBJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7FCAQFYCFSHWF7MATAYSAHBJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7FCAQFYCFSHWF7MATAYSAHBJN/action/storage_attestation","attest_author":"https://pith.science/pith/M7FCAQFYCFSHWF7MATAYSAHBJN/action/author_attestation","sign_citation":"https://pith.science/pith/M7FCAQFYCFSHWF7MATAYSAHBJN/action/citation_signature","submit_replication":"https://pith.science/pith/M7FCAQFYCFSHWF7MATAYSAHBJN/action/replication_record"}},"created_at":"2026-07-05T06:48:39.858324+00:00","updated_at":"2026-07-05T06:48:39.858324+00:00"}