{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JYLKKEIIBZYBI4RVAUBSAUT2NF","short_pith_number":"pith:JYLKKEII","schema_version":"1.0","canonical_sha256":"4e16a511080e70147235050320527a6940365a17c2b6ec607767faa9a4d84c09","source":{"kind":"arxiv","id":"1601.07352","version":3},"attestation_state":"computed","paper":{"title":"CoVer-ability: Consistent Versioning for Concurrent Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Antonio Fern\\'andez Anta, Chryssis Georgiou, Nicolas Nicolaou","submitted_at":"2016-01-27T13:09:30Z","abstract_excerpt":"An object type characterizes the domain space and the operations that can be invoked on an object of that type. In this paper we introduce a new property for concurrent objects, we call coverability, that aims to provide precise guarantees on the consistent evolution of an object. This new property is suitable for a variety of distributed objects including concurrent file objects that demand operations to manipulate the latest version of the object. We propose two levels of coverability: (i) strong coverability and (ii) weak coverability. Strong coverability requires that only a single operati"},"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":"1601.07352","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-27T13:09:30Z","cross_cats_sorted":[],"title_canon_sha256":"409a5c00c620f4c9d0049d6c916220eed51c4e2bbc2f6061afb75197698223f4","abstract_canon_sha256":"bb4ce5932b41ab2a05688e4e605f0f415e380b92c4476b1937c7028603115030"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:15.726794Z","signature_b64":"LUT/I0nCzMKVqDGYBTRE1pppIENTfygahfMa4xQGMJD+YBJUtgz902aqiZEXzKpkWv0QzZfTysqM8mWa4Ii+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e16a511080e70147235050320527a6940365a17c2b6ec607767faa9a4d84c09","last_reissued_at":"2026-05-18T01:19:15.726427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:15.726427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoVer-ability: Consistent Versioning for Concurrent Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Antonio Fern\\'andez Anta, Chryssis Georgiou, Nicolas Nicolaou","submitted_at":"2016-01-27T13:09:30Z","abstract_excerpt":"An object type characterizes the domain space and the operations that can be invoked on an object of that type. In this paper we introduce a new property for concurrent objects, we call coverability, that aims to provide precise guarantees on the consistent evolution of an object. This new property is suitable for a variety of distributed objects including concurrent file objects that demand operations to manipulate the latest version of the object. We propose two levels of coverability: (i) strong coverability and (ii) weak coverability. Strong coverability requires that only a single operati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07352","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":"1601.07352","created_at":"2026-05-18T01:19:15.726490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07352v3","created_at":"2026-05-18T01:19:15.726490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07352","created_at":"2026-05-18T01:19:15.726490+00:00"},{"alias_kind":"pith_short_12","alias_value":"JYLKKEIIBZYB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JYLKKEIIBZYBI4RV","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JYLKKEII","created_at":"2026-05-18T12:30:25.849896+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/JYLKKEIIBZYBI4RVAUBSAUT2NF","json":"https://pith.science/pith/JYLKKEIIBZYBI4RVAUBSAUT2NF.json","graph_json":"https://pith.science/api/pith-number/JYLKKEIIBZYBI4RVAUBSAUT2NF/graph.json","events_json":"https://pith.science/api/pith-number/JYLKKEIIBZYBI4RVAUBSAUT2NF/events.json","paper":"https://pith.science/paper/JYLKKEII"},"agent_actions":{"view_html":"https://pith.science/pith/JYLKKEIIBZYBI4RVAUBSAUT2NF","download_json":"https://pith.science/pith/JYLKKEIIBZYBI4RVAUBSAUT2NF.json","view_paper":"https://pith.science/paper/JYLKKEII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07352&json=true","fetch_graph":"https://pith.science/api/pith-number/JYLKKEIIBZYBI4RVAUBSAUT2NF/graph.json","fetch_events":"https://pith.science/api/pith-number/JYLKKEIIBZYBI4RVAUBSAUT2NF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JYLKKEIIBZYBI4RVAUBSAUT2NF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JYLKKEIIBZYBI4RVAUBSAUT2NF/action/storage_attestation","attest_author":"https://pith.science/pith/JYLKKEIIBZYBI4RVAUBSAUT2NF/action/author_attestation","sign_citation":"https://pith.science/pith/JYLKKEIIBZYBI4RVAUBSAUT2NF/action/citation_signature","submit_replication":"https://pith.science/pith/JYLKKEIIBZYBI4RVAUBSAUT2NF/action/replication_record"}},"created_at":"2026-05-18T01:19:15.726490+00:00","updated_at":"2026-05-18T01:19:15.726490+00:00"}