{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QAGLOR2YR3TX4UUSRROAPETE2C","short_pith_number":"pith:QAGLOR2Y","schema_version":"1.0","canonical_sha256":"800cb747588ee77e52928c5c079264d0af596f953a2a80095e541eae6620b443","source":{"kind":"arxiv","id":"1708.02318","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Lock-Free Data Structures in Haskell: A General Method for Concurrent Implementation Swapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Chao-Hong Chen, Ryan R. Newton, Vikraman Choudhury","submitted_at":"2017-08-07T22:00:49Z","abstract_excerpt":"A key part of implementing high-level languages is providing built-in and default data structures. Yet selecting good defaults is hard. A mutable data structure's workload is not known in advance, and it may shift over its lifetime - e.g., between read-heavy and write-heavy, or from heavy contention by multiple threads to single-threaded or low-frequency use. One idea is to switch implementations adaptively, but it is nontrivial to switch the implementation of a concurrent data structure at runtime. Performing the transition requires a concurrent snapshot of data structure contents, which norm"},"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.02318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-07T22:00:49Z","cross_cats_sorted":[],"title_canon_sha256":"6f0bdf2ea3d5dd2c2a42d276ff43f1c245027bfb6778883960c0bf9730386ef9","abstract_canon_sha256":"7426ca18057c4db27dd7d4bf420a7c83042b6dc66aeb17800a8631cc51c5c723"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:24.778351Z","signature_b64":"/83MShLHEUfMUGEOGQQfxmn1stpqCpncW8+tK9Drah61/PI86s0jwAnhDfFiCHKqZVM/sZEH2UOSA3SAisxuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"800cb747588ee77e52928c5c079264d0af596f953a2a80095e541eae6620b443","last_reissued_at":"2026-05-18T00:38:24.777436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:24.777436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Lock-Free Data Structures in Haskell: A General Method for Concurrent Implementation Swapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Chao-Hong Chen, Ryan R. Newton, Vikraman Choudhury","submitted_at":"2017-08-07T22:00:49Z","abstract_excerpt":"A key part of implementing high-level languages is providing built-in and default data structures. Yet selecting good defaults is hard. A mutable data structure's workload is not known in advance, and it may shift over its lifetime - e.g., between read-heavy and write-heavy, or from heavy contention by multiple threads to single-threaded or low-frequency use. One idea is to switch implementations adaptively, but it is nontrivial to switch the implementation of a concurrent data structure at runtime. Performing the transition requires a concurrent snapshot of data structure contents, which norm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02318","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.02318","created_at":"2026-05-18T00:38:24.777595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02318v1","created_at":"2026-05-18T00:38:24.777595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02318","created_at":"2026-05-18T00:38:24.777595+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAGLOR2YR3TX","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAGLOR2YR3TX4UUS","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAGLOR2Y","created_at":"2026-05-18T12:31:37.085036+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/QAGLOR2YR3TX4UUSRROAPETE2C","json":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C.json","graph_json":"https://pith.science/api/pith-number/QAGLOR2YR3TX4UUSRROAPETE2C/graph.json","events_json":"https://pith.science/api/pith-number/QAGLOR2YR3TX4UUSRROAPETE2C/events.json","paper":"https://pith.science/paper/QAGLOR2Y"},"agent_actions":{"view_html":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C","download_json":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C.json","view_paper":"https://pith.science/paper/QAGLOR2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02318&json=true","fetch_graph":"https://pith.science/api/pith-number/QAGLOR2YR3TX4UUSRROAPETE2C/graph.json","fetch_events":"https://pith.science/api/pith-number/QAGLOR2YR3TX4UUSRROAPETE2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C/action/storage_attestation","attest_author":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C/action/author_attestation","sign_citation":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C/action/citation_signature","submit_replication":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C/action/replication_record"}},"created_at":"2026-05-18T00:38:24.777595+00:00","updated_at":"2026-05-18T00:38:24.777595+00:00"}