{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RNX76WDWBSE7TGGRLK6A23RSU6","short_pith_number":"pith:RNX76WDW","canonical_record":{"source":{"id":"1502.07118","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-02-25T10:40:13Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"ce25bf801ee470a07a0367e7461adcf305e3372b021ff1cb471d419c9e837316","abstract_canon_sha256":"e76838b666b8527feb9b4aaa8b62cef8f812b0fd3b5654c0a42e47e9553b81fb"},"schema_version":"1.0"},"canonical_sha256":"8b6fff58760c89f998d15abc0d6e32a7950187efec250c227e5064c11a549306","source":{"kind":"arxiv","id":"1502.07118","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07118","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07118v4","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07118","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"RNX76WDWBSE7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RNX76WDWBSE7TGGR","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RNX76WDW","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RNX76WDWBSE7TGGRLK6A23RSU6","target":"record","payload":{"canonical_record":{"source":{"id":"1502.07118","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-02-25T10:40:13Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"ce25bf801ee470a07a0367e7461adcf305e3372b021ff1cb471d419c9e837316","abstract_canon_sha256":"e76838b666b8527feb9b4aaa8b62cef8f812b0fd3b5654c0a42e47e9553b81fb"},"schema_version":"1.0"},"canonical_sha256":"8b6fff58760c89f998d15abc0d6e32a7950187efec250c227e5064c11a549306","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:57.885787Z","signature_b64":"0TGASnoGJNBDRG0IMOch6KQlrhUMawPZOfT0aJny5qYaQT2vMgGcrATa+Y1iQZ7Lp54tVrYJ73Tyu5Y21WtECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b6fff58760c89f998d15abc0d6e32a7950187efec250c227e5064c11a549306","last_reissued_at":"2026-05-18T01:11:57.885374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:57.885374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.07118","source_version":4,"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-18T01:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TrcKU+9pbvJTd9GVPupKuhIWzitB/Uxopz4qOGbaLkfhyTWyGXWQ9qypraFuxFvWvisTA4u+Z3I5mrbX9xU+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:22.669960Z"},"content_sha256":"048b6c575fa8e9a63f03198327eaf3f1d77215e2e2e8915049c7fc0ca5450816","schema_version":"1.0","event_id":"sha256:048b6c575fa8e9a63f03198327eaf3f1d77215e2e2e8915049c7fc0ca5450816"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RNX76WDWBSE7TGGRLK6A23RSU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Linearizability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.PL","authors_text":"Ali Sezgin, Ana Sokolova, Andreas Haas, Andreas Holzer, Christoph M. Kirsch, Hannes Payer, Helmut Veith, Michael Lippautz, Thomas A. Henzinger","submitted_at":"2015-02-25T10:40:13Z","abstract_excerpt":"The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition due to its simplicity and general applicability. Nevertheless, for applications that do not require all guarantees offered by linearizability, recent research has focused on improving performance and scalability of concurrent data structures by relaxing their semantics.\n  In this paper, we present local linearizability, a relaxed consistency condition that is applicable to container-type concurrent data structures like"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07118","kind":"arxiv","version":4},"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-18T01:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ZUe1E7SbRbCer4k6ltmqPgKYeKBc1dRpO7Of5nfHhg8v+EBjz7cYaeNq123GpeZIu1Txqle8cyTbx+kEnV5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:22.670660Z"},"content_sha256":"b967b5579072b187075830dab75e504d51da55d11874d428cbb3f6a503106b0f","schema_version":"1.0","event_id":"sha256:b967b5579072b187075830dab75e504d51da55d11874d428cbb3f6a503106b0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNX76WDWBSE7TGGRLK6A23RSU6/bundle.json","state_url":"https://pith.science/pith/RNX76WDWBSE7TGGRLK6A23RSU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNX76WDWBSE7TGGRLK6A23RSU6/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-05-27T23:20:22Z","links":{"resolver":"https://pith.science/pith/RNX76WDWBSE7TGGRLK6A23RSU6","bundle":"https://pith.science/pith/RNX76WDWBSE7TGGRLK6A23RSU6/bundle.json","state":"https://pith.science/pith/RNX76WDWBSE7TGGRLK6A23RSU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNX76WDWBSE7TGGRLK6A23RSU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RNX76WDWBSE7TGGRLK6A23RSU6","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":"e76838b666b8527feb9b4aaa8b62cef8f812b0fd3b5654c0a42e47e9553b81fb","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-02-25T10:40:13Z","title_canon_sha256":"ce25bf801ee470a07a0367e7461adcf305e3372b021ff1cb471d419c9e837316"},"schema_version":"1.0","source":{"id":"1502.07118","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07118","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07118v4","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07118","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"RNX76WDWBSE7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RNX76WDWBSE7TGGR","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RNX76WDW","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:b967b5579072b187075830dab75e504d51da55d11874d428cbb3f6a503106b0f","target":"graph","created_at":"2026-05-18T01:11:57Z","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":"The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition due to its simplicity and general applicability. Nevertheless, for applications that do not require all guarantees offered by linearizability, recent research has focused on improving performance and scalability of concurrent data structures by relaxing their semantics.\n  In this paper, we present local linearizability, a relaxed consistency condition that is applicable to container-type concurrent data structures like","authors_text":"Ali Sezgin, Ana Sokolova, Andreas Haas, Andreas Holzer, Christoph M. Kirsch, Hannes Payer, Helmut Veith, Michael Lippautz, Thomas A. Henzinger","cross_cats":["cs.DC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-02-25T10:40:13Z","title":"Local Linearizability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07118","kind":"arxiv","version":4},"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:048b6c575fa8e9a63f03198327eaf3f1d77215e2e2e8915049c7fc0ca5450816","target":"record","created_at":"2026-05-18T01:11:57Z","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":"e76838b666b8527feb9b4aaa8b62cef8f812b0fd3b5654c0a42e47e9553b81fb","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-02-25T10:40:13Z","title_canon_sha256":"ce25bf801ee470a07a0367e7461adcf305e3372b021ff1cb471d419c9e837316"},"schema_version":"1.0","source":{"id":"1502.07118","kind":"arxiv","version":4}},"canonical_sha256":"8b6fff58760c89f998d15abc0d6e32a7950187efec250c227e5064c11a549306","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b6fff58760c89f998d15abc0d6e32a7950187efec250c227e5064c11a549306","first_computed_at":"2026-05-18T01:11:57.885374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:57.885374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0TGASnoGJNBDRG0IMOch6KQlrhUMawPZOfT0aJny5qYaQT2vMgGcrATa+Y1iQZ7Lp54tVrYJ73Tyu5Y21WtECw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:57.885787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07118","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:048b6c575fa8e9a63f03198327eaf3f1d77215e2e2e8915049c7fc0ca5450816","sha256:b967b5579072b187075830dab75e504d51da55d11874d428cbb3f6a503106b0f"],"state_sha256":"27298a387e4dd5bd25a2662c2c4080d55b1a160090d5c4e1af22ace234374a64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhjTlvCp0nf2QSPCu6/ZavFW0vMSHQrPi5S7CSu3/h4qqGaDYfpphLwrKzVwfENXsd1BrkPpgT2sXq7As2EvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:20:22.674169Z","bundle_sha256":"9197c47a0607de405ee0fdd93babddbc88fce8906ceddd2fccda5a86388388fc"}}