{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QNLR44VCZMU55OJGPL7343PVEQ","short_pith_number":"pith:QNLR44VC","schema_version":"1.0","canonical_sha256":"83571e72a2cb29deb9267affbe6df5241c6e6c16a0817088db4370e29e6df37f","source":{"kind":"arxiv","id":"1512.08258","version":1},"attestation_state":"computed","paper":{"title":"Eventual Wait-Free Synchronization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Tong Che","submitted_at":"2015-12-27T18:28:06Z","abstract_excerpt":"Eventually linearizable objects are novel shared memory programming constructs introduced as an analogy to eventual consistency in message-passing systems. However, their behaviors in shared memory systems are so mysterious that very little general theoretical properties of them is known.\n  In this paper, we lay the theoretical foundation of the study of eventually linearizable objects. We prove that the n-process eventually linearizable fetch-and-cons (n-FAC) object is universal and can be used to classify the eventually linearizable objects. In particular, we define the concept of eventual c"},"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":"1512.08258","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2015-12-27T18:28:06Z","cross_cats_sorted":[],"title_canon_sha256":"8b6ffc7df594fdd3d85dfd40f081c7a3dacd7527e60ea2249c9e9e41773c6aef","abstract_canon_sha256":"a32fe24253c38674afba2282730d8ec33de71370c4d90f5adf8c8999236b8064"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:42.781003Z","signature_b64":"yXuOi40IwHXkmtTaiXaLbSu1QlKIt5/62Iwj+HO53W3EWCvx+MXiSjVNtHcRnYj7lo9XSn2H56hoQMB/lfVCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83571e72a2cb29deb9267affbe6df5241c6e6c16a0817088db4370e29e6df37f","last_reissued_at":"2026-05-18T01:23:42.780328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:42.780328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Eventual Wait-Free Synchronization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Tong Che","submitted_at":"2015-12-27T18:28:06Z","abstract_excerpt":"Eventually linearizable objects are novel shared memory programming constructs introduced as an analogy to eventual consistency in message-passing systems. However, their behaviors in shared memory systems are so mysterious that very little general theoretical properties of them is known.\n  In this paper, we lay the theoretical foundation of the study of eventually linearizable objects. We prove that the n-process eventually linearizable fetch-and-cons (n-FAC) object is universal and can be used to classify the eventually linearizable objects. In particular, we define the concept of eventual c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08258","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":"1512.08258","created_at":"2026-05-18T01:23:42.780441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08258v1","created_at":"2026-05-18T01:23:42.780441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08258","created_at":"2026-05-18T01:23:42.780441+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNLR44VCZMU5","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNLR44VCZMU55OJG","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNLR44VC","created_at":"2026-05-18T12:29:37.295048+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/QNLR44VCZMU55OJGPL7343PVEQ","json":"https://pith.science/pith/QNLR44VCZMU55OJGPL7343PVEQ.json","graph_json":"https://pith.science/api/pith-number/QNLR44VCZMU55OJGPL7343PVEQ/graph.json","events_json":"https://pith.science/api/pith-number/QNLR44VCZMU55OJGPL7343PVEQ/events.json","paper":"https://pith.science/paper/QNLR44VC"},"agent_actions":{"view_html":"https://pith.science/pith/QNLR44VCZMU55OJGPL7343PVEQ","download_json":"https://pith.science/pith/QNLR44VCZMU55OJGPL7343PVEQ.json","view_paper":"https://pith.science/paper/QNLR44VC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08258&json=true","fetch_graph":"https://pith.science/api/pith-number/QNLR44VCZMU55OJGPL7343PVEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/QNLR44VCZMU55OJGPL7343PVEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNLR44VCZMU55OJGPL7343PVEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNLR44VCZMU55OJGPL7343PVEQ/action/storage_attestation","attest_author":"https://pith.science/pith/QNLR44VCZMU55OJGPL7343PVEQ/action/author_attestation","sign_citation":"https://pith.science/pith/QNLR44VCZMU55OJGPL7343PVEQ/action/citation_signature","submit_replication":"https://pith.science/pith/QNLR44VCZMU55OJGPL7343PVEQ/action/replication_record"}},"created_at":"2026-05-18T01:23:42.780441+00:00","updated_at":"2026-05-18T01:23:42.780441+00:00"}