{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QAGLOR2YR3TX4UUSRROAPETE2C","short_pith_number":"pith:QAGLOR2Y","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"},"canonical_sha256":"800cb747588ee77e52928c5c079264d0af596f953a2a80095e541eae6620b443","source":{"kind":"arxiv","id":"1708.02318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02318","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02318v1","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02318","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"QAGLOR2YR3TX","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QAGLOR2YR3TX4UUS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QAGLOR2Y","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QAGLOR2YR3TX4UUSRROAPETE2C","target":"record","payload":{"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"},"canonical_sha256":"800cb747588ee77e52928c5c079264d0af596f953a2a80095e541eae6620b443","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"},"source_kind":"arxiv","source_id":"1708.02318","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-05-18T00:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MfD9FkZLZyXWzKk1KqJuKpTc6asz/eYa4vPOILq2zHJjOWCsCTQOSsd6iczJSQvEpLyz4yi/RuA42S/J1vXNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:49:21.058958Z"},"content_sha256":"e50db319a8d0d367afcba2919c200279c163d7d14c82891eaa2ae5257eb2613d","schema_version":"1.0","event_id":"sha256:e50db319a8d0d367afcba2919c200279c163d7d14c82891eaa2ae5257eb2613d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QAGLOR2YR3TX4UUSRROAPETE2C","target":"graph","payload":{"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"},"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-05-18T00:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Az49xY05fyPC2xL70y/fWg6rgQn7zc0wwCb22xrqL1XvMbQUUasR6O0TRmF8IgauFqVVkFNZiIhYEUOm//M3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:49:21.059302Z"},"content_sha256":"9524a8bc487fa465e0a2f52dd4e3b90a87acd4dc84f57839373dc1d92ff42dd2","schema_version":"1.0","event_id":"sha256:9524a8bc487fa465e0a2f52dd4e3b90a87acd4dc84f57839373dc1d92ff42dd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C/bundle.json","state_url":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAGLOR2YR3TX4UUSRROAPETE2C/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-06-23T07:49:21Z","links":{"resolver":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C","bundle":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C/bundle.json","state":"https://pith.science/pith/QAGLOR2YR3TX4UUSRROAPETE2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAGLOR2YR3TX4UUSRROAPETE2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QAGLOR2YR3TX4UUSRROAPETE2C","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":"7426ca18057c4db27dd7d4bf420a7c83042b6dc66aeb17800a8631cc51c5c723","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-07T22:00:49Z","title_canon_sha256":"6f0bdf2ea3d5dd2c2a42d276ff43f1c245027bfb6778883960c0bf9730386ef9"},"schema_version":"1.0","source":{"id":"1708.02318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02318","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02318v1","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02318","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"QAGLOR2YR3TX","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QAGLOR2YR3TX4UUS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QAGLOR2Y","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:9524a8bc487fa465e0a2f52dd4e3b90a87acd4dc84f57839373dc1d92ff42dd2","target":"graph","created_at":"2026-05-18T00:38:24Z","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"},"paper":{"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","authors_text":"Chao-Hong Chen, Ryan R. Newton, Vikraman Choudhury","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-07T22:00:49Z","title":"Adaptive Lock-Free Data Structures in Haskell: A General Method for Concurrent Implementation Swapping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02318","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:e50db319a8d0d367afcba2919c200279c163d7d14c82891eaa2ae5257eb2613d","target":"record","created_at":"2026-05-18T00:38:24Z","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":"7426ca18057c4db27dd7d4bf420a7c83042b6dc66aeb17800a8631cc51c5c723","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-07T22:00:49Z","title_canon_sha256":"6f0bdf2ea3d5dd2c2a42d276ff43f1c245027bfb6778883960c0bf9730386ef9"},"schema_version":"1.0","source":{"id":"1708.02318","kind":"arxiv","version":1}},"canonical_sha256":"800cb747588ee77e52928c5c079264d0af596f953a2a80095e541eae6620b443","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"800cb747588ee77e52928c5c079264d0af596f953a2a80095e541eae6620b443","first_computed_at":"2026-05-18T00:38:24.777436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:24.777436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/83MShLHEUfMUGEOGQQfxmn1stpqCpncW8+tK9Drah61/PI86s0jwAnhDfFiCHKqZVM/sZEH2UOSA3SAisxuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:24.778351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e50db319a8d0d367afcba2919c200279c163d7d14c82891eaa2ae5257eb2613d","sha256:9524a8bc487fa465e0a2f52dd4e3b90a87acd4dc84f57839373dc1d92ff42dd2"],"state_sha256":"6aed2e19992b9c2ea8a7f541d95c8e3260248fd7115bda4cac4975993b614da6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwEHFC1xbUPajsY0pQ485C73Z+yt9wPmAXggFrlkqLQrSj7s0/fK+P81JUCFLspdIuktKxqplDxNAd7FbytxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:49:21.061271Z","bundle_sha256":"7624bbceb4d65e23da19e4fb1272e7d5e1aff7cd06f94bb8ba4870cdf5265094"}}