{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2W3IHMTBDHMHRG5OZROMC3X7VB","short_pith_number":"pith:2W3IHMTB","schema_version":"1.0","canonical_sha256":"d5b683b26119d8789baecc5cc16effa852a55d5f129cb45e0679fcb06a20f6e2","source":{"kind":"arxiv","id":"1309.5522","version":1},"attestation_state":"computed","paper":{"title":"On the k-Atomicity-Verification Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jeremy Hurwitz, Wojciech Golab, Xiaozhou (Steve) Li","submitted_at":"2013-09-21T19:32:53Z","abstract_excerpt":"Modern Internet-scale storage systems often provide weak consistency in exchange for better performance and resilience. An important weak consistency property is k-atomicity, which bounds the staleness of values returned by read operations. The k-atomicity-verification problem (or k-AV for short) is the problem of deciding whether a given history of operations is k-atomic. The 1-AV problem is equivalent to verifying atomicity/linearizability, a well-known and solved problem. However, for k > 2, no polynomial-time k-AV algorithm is known.\n  This paper makes the following contributions towards s"},"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":"1309.5522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-21T19:32:53Z","cross_cats_sorted":[],"title_canon_sha256":"8dc2ebc2d16328b36dfb641a0b57162390f72fbdf586ddfb952045ede7cb20ff","abstract_canon_sha256":"0ac2a120b658137ca17f7143e9e092657608aa96274627957100d2cfc7da057d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:36.054333Z","signature_b64":"jMgl0mZbjhDyt+gABOZh/HsUPGM1CoKZWD6fkUcmbTVu1akbYnyl8iDWXvv0Nvx5RnSd7D+PDJpdfs3G3DiFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5b683b26119d8789baecc5cc16effa852a55d5f129cb45e0679fcb06a20f6e2","last_reissued_at":"2026-05-18T03:12:36.053712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:36.053712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the k-Atomicity-Verification Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jeremy Hurwitz, Wojciech Golab, Xiaozhou (Steve) Li","submitted_at":"2013-09-21T19:32:53Z","abstract_excerpt":"Modern Internet-scale storage systems often provide weak consistency in exchange for better performance and resilience. An important weak consistency property is k-atomicity, which bounds the staleness of values returned by read operations. The k-atomicity-verification problem (or k-AV for short) is the problem of deciding whether a given history of operations is k-atomic. The 1-AV problem is equivalent to verifying atomicity/linearizability, a well-known and solved problem. However, for k > 2, no polynomial-time k-AV algorithm is known.\n  This paper makes the following contributions towards s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5522","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":"1309.5522","created_at":"2026-05-18T03:12:36.053812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5522v1","created_at":"2026-05-18T03:12:36.053812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5522","created_at":"2026-05-18T03:12:36.053812+00:00"},{"alias_kind":"pith_short_12","alias_value":"2W3IHMTBDHMH","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2W3IHMTBDHMHRG5O","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2W3IHMTB","created_at":"2026-05-18T12:27:32.513160+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/2W3IHMTBDHMHRG5OZROMC3X7VB","json":"https://pith.science/pith/2W3IHMTBDHMHRG5OZROMC3X7VB.json","graph_json":"https://pith.science/api/pith-number/2W3IHMTBDHMHRG5OZROMC3X7VB/graph.json","events_json":"https://pith.science/api/pith-number/2W3IHMTBDHMHRG5OZROMC3X7VB/events.json","paper":"https://pith.science/paper/2W3IHMTB"},"agent_actions":{"view_html":"https://pith.science/pith/2W3IHMTBDHMHRG5OZROMC3X7VB","download_json":"https://pith.science/pith/2W3IHMTBDHMHRG5OZROMC3X7VB.json","view_paper":"https://pith.science/paper/2W3IHMTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5522&json=true","fetch_graph":"https://pith.science/api/pith-number/2W3IHMTBDHMHRG5OZROMC3X7VB/graph.json","fetch_events":"https://pith.science/api/pith-number/2W3IHMTBDHMHRG5OZROMC3X7VB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2W3IHMTBDHMHRG5OZROMC3X7VB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2W3IHMTBDHMHRG5OZROMC3X7VB/action/storage_attestation","attest_author":"https://pith.science/pith/2W3IHMTBDHMHRG5OZROMC3X7VB/action/author_attestation","sign_citation":"https://pith.science/pith/2W3IHMTBDHMHRG5OZROMC3X7VB/action/citation_signature","submit_replication":"https://pith.science/pith/2W3IHMTBDHMHRG5OZROMC3X7VB/action/replication_record"}},"created_at":"2026-05-18T03:12:36.053812+00:00","updated_at":"2026-05-18T03:12:36.053812+00:00"}