{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5WMHWSS6ALSZPS6CUORX26UH6A","short_pith_number":"pith:5WMHWSS6","schema_version":"1.0","canonical_sha256":"ed987b4a5e02e597cbc2a3a37d7a87f0303079be44697af6dc93f2101672e4f4","source":{"kind":"arxiv","id":"1308.2507","version":3},"attestation_state":"computed","paper":{"title":"Linearizability with Ownership Transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Alexey Gotsman (IMDEA Software Institute), Hongseok Yang (University of Oxford)","submitted_at":"2013-08-12T09:59:02Z","abstract_excerpt":"Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and its client, with interactions limited to passing values of a given data type. This is inappropriate for common programming languages, where libraries and their clients can communicate via the heap, transferring the ownership of data structures, and can even run in a shared address space without any memory protection. In this paper, we present the first definition of linearizability that lifts this limitation and establish an A"},"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":"1308.2507","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-08-12T09:59:02Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"874ac3d1a031b69c37688eeb1a564639553d21fce3ef129a2e871ad7a69e909a","abstract_canon_sha256":"f43a248c9c71c4ca88d69371a0b194ea80ff3959cf4c57a0404ac664ad1db7de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:37.937079Z","signature_b64":"dPxilU//JvTsVTOpfWR+Z73tevyQ6GtLEwbZdEVDCO5AUKpih7fAXIUdRfJjQzS7Mm8qpHn4oL2C6IggD9P0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed987b4a5e02e597cbc2a3a37d7a87f0303079be44697af6dc93f2101672e4f4","last_reissued_at":"2026-05-18T01:37:37.936654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:37.936654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linearizability with Ownership Transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Alexey Gotsman (IMDEA Software Institute), Hongseok Yang (University of Oxford)","submitted_at":"2013-08-12T09:59:02Z","abstract_excerpt":"Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and its client, with interactions limited to passing values of a given data type. This is inappropriate for common programming languages, where libraries and their clients can communicate via the heap, transferring the ownership of data structures, and can even run in a shared address space without any memory protection. In this paper, we present the first definition of linearizability that lifts this limitation and establish an A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2507","kind":"arxiv","version":3},"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":"1308.2507","created_at":"2026-05-18T01:37:37.936716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2507v3","created_at":"2026-05-18T01:37:37.936716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2507","created_at":"2026-05-18T01:37:37.936716+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WMHWSS6ALSZ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WMHWSS6ALSZPS6C","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WMHWSS6","created_at":"2026-05-18T12:27:34.582898+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/5WMHWSS6ALSZPS6CUORX26UH6A","json":"https://pith.science/pith/5WMHWSS6ALSZPS6CUORX26UH6A.json","graph_json":"https://pith.science/api/pith-number/5WMHWSS6ALSZPS6CUORX26UH6A/graph.json","events_json":"https://pith.science/api/pith-number/5WMHWSS6ALSZPS6CUORX26UH6A/events.json","paper":"https://pith.science/paper/5WMHWSS6"},"agent_actions":{"view_html":"https://pith.science/pith/5WMHWSS6ALSZPS6CUORX26UH6A","download_json":"https://pith.science/pith/5WMHWSS6ALSZPS6CUORX26UH6A.json","view_paper":"https://pith.science/paper/5WMHWSS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2507&json=true","fetch_graph":"https://pith.science/api/pith-number/5WMHWSS6ALSZPS6CUORX26UH6A/graph.json","fetch_events":"https://pith.science/api/pith-number/5WMHWSS6ALSZPS6CUORX26UH6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WMHWSS6ALSZPS6CUORX26UH6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WMHWSS6ALSZPS6CUORX26UH6A/action/storage_attestation","attest_author":"https://pith.science/pith/5WMHWSS6ALSZPS6CUORX26UH6A/action/author_attestation","sign_citation":"https://pith.science/pith/5WMHWSS6ALSZPS6CUORX26UH6A/action/citation_signature","submit_replication":"https://pith.science/pith/5WMHWSS6ALSZPS6CUORX26UH6A/action/replication_record"}},"created_at":"2026-05-18T01:37:37.936716+00:00","updated_at":"2026-05-18T01:37:37.936716+00:00"}