{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RNUOLURTKACGBMGKDOKB27QBJB","short_pith_number":"pith:RNUOLURT","schema_version":"1.0","canonical_sha256":"8b68e5d233500460b0ca1b941d7e014858238b75c5deba2d95d5e49a365a940f","source":{"kind":"arxiv","id":"1811.00756","version":1},"attestation_state":"computed","paper":{"title":"On the Lazy Set object","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Uri Abraham","submitted_at":"2018-11-02T06:58:44Z","abstract_excerpt":"The aim of this article is to employ the Lazy Set algorithm as an example for a mathematical framework for proving the linearizability of distributed systems. The proof in this approach is divided into two stages of lower and higher abstraction level. At the higher level a list of \"axioms\" is formulated and a proof is given that any model theoretic structure that satisfies these axioms is linearizable. At this level the algorithm is not mentioned. At the lower level, a Simpler Lazy Set algorithm is described, and it is shown that any execution of this simpler algorithm generates a model of the"},"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":"1811.00756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-02T06:58:44Z","cross_cats_sorted":[],"title_canon_sha256":"b5248b755d1b1233c0c1ec9eb086559bbc3f6c712e97d6b7c95a636c22080013","abstract_canon_sha256":"244cdc77c199b9a2be1460e81dab2557734b0f75c4105658f55239f9f6d057af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:42.267300Z","signature_b64":"7Iyqxs6Vkim5V4afyoKzMNmK0uevK/PiTX7hemWauTdqC+l1yDIz5gsuSsLXItmrKo8MJh6ISe0EG3XOGOq3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b68e5d233500460b0ca1b941d7e014858238b75c5deba2d95d5e49a365a940f","last_reissued_at":"2026-05-18T00:01:42.266722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:42.266722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Lazy Set object","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Uri Abraham","submitted_at":"2018-11-02T06:58:44Z","abstract_excerpt":"The aim of this article is to employ the Lazy Set algorithm as an example for a mathematical framework for proving the linearizability of distributed systems. The proof in this approach is divided into two stages of lower and higher abstraction level. At the higher level a list of \"axioms\" is formulated and a proof is given that any model theoretic structure that satisfies these axioms is linearizable. At this level the algorithm is not mentioned. At the lower level, a Simpler Lazy Set algorithm is described, and it is shown that any execution of this simpler algorithm generates a model of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00756","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":"1811.00756","created_at":"2026-05-18T00:01:42.266811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00756v1","created_at":"2026-05-18T00:01:42.266811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00756","created_at":"2026-05-18T00:01:42.266811+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNUOLURTKACG","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNUOLURTKACGBMGK","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNUOLURT","created_at":"2026-05-18T12:32:50.500415+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/RNUOLURTKACGBMGKDOKB27QBJB","json":"https://pith.science/pith/RNUOLURTKACGBMGKDOKB27QBJB.json","graph_json":"https://pith.science/api/pith-number/RNUOLURTKACGBMGKDOKB27QBJB/graph.json","events_json":"https://pith.science/api/pith-number/RNUOLURTKACGBMGKDOKB27QBJB/events.json","paper":"https://pith.science/paper/RNUOLURT"},"agent_actions":{"view_html":"https://pith.science/pith/RNUOLURTKACGBMGKDOKB27QBJB","download_json":"https://pith.science/pith/RNUOLURTKACGBMGKDOKB27QBJB.json","view_paper":"https://pith.science/paper/RNUOLURT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00756&json=true","fetch_graph":"https://pith.science/api/pith-number/RNUOLURTKACGBMGKDOKB27QBJB/graph.json","fetch_events":"https://pith.science/api/pith-number/RNUOLURTKACGBMGKDOKB27QBJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNUOLURTKACGBMGKDOKB27QBJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNUOLURTKACGBMGKDOKB27QBJB/action/storage_attestation","attest_author":"https://pith.science/pith/RNUOLURTKACGBMGKDOKB27QBJB/action/author_attestation","sign_citation":"https://pith.science/pith/RNUOLURTKACGBMGKDOKB27QBJB/action/citation_signature","submit_replication":"https://pith.science/pith/RNUOLURTKACGBMGKDOKB27QBJB/action/replication_record"}},"created_at":"2026-05-18T00:01:42.266811+00:00","updated_at":"2026-05-18T00:01:42.266811+00:00"}