{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LFZQGRSO7G6BG3LZXCJ7GUZYPG","short_pith_number":"pith:LFZQGRSO","schema_version":"1.0","canonical_sha256":"597303464ef9bc136d79b893f3533879afe4b5190478e2e3492a71c62b33ff99","source":{"kind":"arxiv","id":"2506.18401","version":3},"attestation_state":"computed","paper":{"title":"Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"(2) Universidad Nacional Aut\\'onoma de M\\'exico, (3) LIX, Armando Casta\\~neda (2), CNRS, Constantin Enea (3) ((1) Technion - Israel Institute of Technology, Ecole polytechnique, Hagit Attiya (1), Institut Polytechnique de Paris)","submitted_at":"2025-06-23T08:38:40Z","abstract_excerpt":"This paper studies the relation between agreement and strongly linearizable implementations of various objects. This leads to new results about implementations of concurrent objects from various primitives including window registers, interfering primitives and stacks.\n  We identify that lock-free, respectively, wait-free, strongly linearizable implementations of several concurrent objects entail a form of agreement that does not require full consensus but cannot be implemented in a strongly-linearizable manner with combinations of non-universal primitives. In both cases, lock-free and wait-fre"},"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":"2506.18401","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-23T08:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"abe7420a3f82c379471deee5a803a40a2e84abaa24bf5b50972ee1f4237eac2e","abstract_canon_sha256":"8610c9180f95f6497380505d845332a6d80e5c402443886eb27aa1b5aa4f57f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:14.564950Z","signature_b64":"JEAPlts/wfDbgfUkBfKo1Vf5Ju11bkzDzAAQsSzXYs5rKg7L/YNdeJjJKJGJmwF+aEg4keB2jLv45zHHERkuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"597303464ef9bc136d79b893f3533879afe4b5190478e2e3492a71c62b33ff99","last_reissued_at":"2026-06-11T01:09:14.563991Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:14.563991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"(2) Universidad Nacional Aut\\'onoma de M\\'exico, (3) LIX, Armando Casta\\~neda (2), CNRS, Constantin Enea (3) ((1) Technion - Israel Institute of Technology, Ecole polytechnique, Hagit Attiya (1), Institut Polytechnique de Paris)","submitted_at":"2025-06-23T08:38:40Z","abstract_excerpt":"This paper studies the relation between agreement and strongly linearizable implementations of various objects. This leads to new results about implementations of concurrent objects from various primitives including window registers, interfering primitives and stacks.\n  We identify that lock-free, respectively, wait-free, strongly linearizable implementations of several concurrent objects entail a form of agreement that does not require full consensus but cannot be implemented in a strongly-linearizable manner with combinations of non-universal primitives. In both cases, lock-free and wait-fre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.18401","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.18401/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.18401","created_at":"2026-06-11T01:09:14.564126+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.18401v3","created_at":"2026-06-11T01:09:14.564126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.18401","created_at":"2026-06-11T01:09:14.564126+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFZQGRSO7G6B","created_at":"2026-06-11T01:09:14.564126+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFZQGRSO7G6BG3LZ","created_at":"2026-06-11T01:09:14.564126+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFZQGRSO","created_at":"2026-06-11T01:09:14.564126+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/LFZQGRSO7G6BG3LZXCJ7GUZYPG","json":"https://pith.science/pith/LFZQGRSO7G6BG3LZXCJ7GUZYPG.json","graph_json":"https://pith.science/api/pith-number/LFZQGRSO7G6BG3LZXCJ7GUZYPG/graph.json","events_json":"https://pith.science/api/pith-number/LFZQGRSO7G6BG3LZXCJ7GUZYPG/events.json","paper":"https://pith.science/paper/LFZQGRSO"},"agent_actions":{"view_html":"https://pith.science/pith/LFZQGRSO7G6BG3LZXCJ7GUZYPG","download_json":"https://pith.science/pith/LFZQGRSO7G6BG3LZXCJ7GUZYPG.json","view_paper":"https://pith.science/paper/LFZQGRSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.18401&json=true","fetch_graph":"https://pith.science/api/pith-number/LFZQGRSO7G6BG3LZXCJ7GUZYPG/graph.json","fetch_events":"https://pith.science/api/pith-number/LFZQGRSO7G6BG3LZXCJ7GUZYPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFZQGRSO7G6BG3LZXCJ7GUZYPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFZQGRSO7G6BG3LZXCJ7GUZYPG/action/storage_attestation","attest_author":"https://pith.science/pith/LFZQGRSO7G6BG3LZXCJ7GUZYPG/action/author_attestation","sign_citation":"https://pith.science/pith/LFZQGRSO7G6BG3LZXCJ7GUZYPG/action/citation_signature","submit_replication":"https://pith.science/pith/LFZQGRSO7G6BG3LZXCJ7GUZYPG/action/replication_record"}},"created_at":"2026-06-11T01:09:14.564126+00:00","updated_at":"2026-06-11T01:09:14.564126+00:00"}