{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:X3TPHWPVUTVRC3Q4LBANSRLV2Y","short_pith_number":"pith:X3TPHWPV","schema_version":"1.0","canonical_sha256":"bee6f3d9f5a4eb116e1c5840d94575d616d7c8d48f89220e92a572aa91fdcf3b","source":{"kind":"arxiv","id":"2411.16355","version":1},"attestation_state":"computed","paper":{"title":"A Framework for Consistency Models in Distributed Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Paulo S\\'ergio Almeida","submitted_at":"2024-11-25T13:10:24Z","abstract_excerpt":"We define am axiomatic timeless framework for asynchronous distributed systems, together with well-formedness and consistency axioms, which unifies and generalizes the expressive power of current approaches. 1) It combines classic serialization per-process with a global visibility. 2) It defines a physical realizability well-formedness axiom to prevent physically impossible causality cycles, while allowing possible and useful visibility cycles, to allow synchronization-oriented abstractions. 3) Allows adding time-based constraints, from a logical or physical clock, either partially or totally "},"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":"2411.16355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-11-25T13:10:24Z","cross_cats_sorted":[],"title_canon_sha256":"d498e9e89f967ec2b0edcbb8b2916753a0dc6a2ea5b00b511c44a9cf9fcfaed0","abstract_canon_sha256":"c802b8c040298d8c12c397f6d2db0335c006b12587075fcafef01554ab8d5471"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:08.100441Z","signature_b64":"NXhKJauSXdRzGULV+o5KnKiq9556/rbK0sEzpXxn3AwzIj67ThOy5DSEwvGnf9X6NeLZ/aOYK0Ro9pA/+ZXPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bee6f3d9f5a4eb116e1c5840d94575d616d7c8d48f89220e92a572aa91fdcf3b","last_reissued_at":"2026-07-05T09:40:08.100043Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:08.100043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for Consistency Models in Distributed Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Paulo S\\'ergio Almeida","submitted_at":"2024-11-25T13:10:24Z","abstract_excerpt":"We define am axiomatic timeless framework for asynchronous distributed systems, together with well-formedness and consistency axioms, which unifies and generalizes the expressive power of current approaches. 1) It combines classic serialization per-process with a global visibility. 2) It defines a physical realizability well-formedness axiom to prevent physically impossible causality cycles, while allowing possible and useful visibility cycles, to allow synchronization-oriented abstractions. 3) Allows adding time-based constraints, from a logical or physical clock, either partially or totally "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16355","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.16355/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":"2411.16355","created_at":"2026-07-05T09:40:08.100093+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16355v1","created_at":"2026-07-05T09:40:08.100093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16355","created_at":"2026-07-05T09:40:08.100093+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3TPHWPVUTVR","created_at":"2026-07-05T09:40:08.100093+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3TPHWPVUTVRC3Q4","created_at":"2026-07-05T09:40:08.100093+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3TPHWPV","created_at":"2026-07-05T09:40:08.100093+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09114","citing_title":"Light Cone Consistency: Closure, Ordering, and the Single-Observer Boundary","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2601.22963","citing_title":"ERA: Epoch-Resolved Arbitration for Duelling Admins in Group Management CRDTs","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09114","citing_title":"Light Cone Consistency: Closure, Ordering, and the Single-Observer Boundary","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X3TPHWPVUTVRC3Q4LBANSRLV2Y","json":"https://pith.science/pith/X3TPHWPVUTVRC3Q4LBANSRLV2Y.json","graph_json":"https://pith.science/api/pith-number/X3TPHWPVUTVRC3Q4LBANSRLV2Y/graph.json","events_json":"https://pith.science/api/pith-number/X3TPHWPVUTVRC3Q4LBANSRLV2Y/events.json","paper":"https://pith.science/paper/X3TPHWPV"},"agent_actions":{"view_html":"https://pith.science/pith/X3TPHWPVUTVRC3Q4LBANSRLV2Y","download_json":"https://pith.science/pith/X3TPHWPVUTVRC3Q4LBANSRLV2Y.json","view_paper":"https://pith.science/paper/X3TPHWPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16355&json=true","fetch_graph":"https://pith.science/api/pith-number/X3TPHWPVUTVRC3Q4LBANSRLV2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/X3TPHWPVUTVRC3Q4LBANSRLV2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3TPHWPVUTVRC3Q4LBANSRLV2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3TPHWPVUTVRC3Q4LBANSRLV2Y/action/storage_attestation","attest_author":"https://pith.science/pith/X3TPHWPVUTVRC3Q4LBANSRLV2Y/action/author_attestation","sign_citation":"https://pith.science/pith/X3TPHWPVUTVRC3Q4LBANSRLV2Y/action/citation_signature","submit_replication":"https://pith.science/pith/X3TPHWPVUTVRC3Q4LBANSRLV2Y/action/replication_record"}},"created_at":"2026-07-05T09:40:08.100093+00:00","updated_at":"2026-07-05T09:40:08.100093+00:00"}