{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:O3EIUQMNZAHNNGTGQEE5UO2COX","short_pith_number":"pith:O3EIUQMN","schema_version":"1.0","canonical_sha256":"76c88a418dc80ed69a668109da3b4275c6b469f15dee4479d21e510ddf31b77b","source":{"kind":"arxiv","id":"1307.3207","version":1},"attestation_state":"computed","paper":{"title":"Scalable Eventually Consistent Counters over Unreliable Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carlos Baquero, Paulo S\\'ergio Almeida","submitted_at":"2013-07-11T18:28:06Z","abstract_excerpt":"Counters are an important abstraction in distributed computing, and play a central role in large scale geo-replicated systems, counting events such as web page impressions or social network \"likes\". Classic distributed counters, strongly consistent, cannot be made both available and partition-tolerant, due to the CAP Theorem, being unsuitable to large scale scenarios. This paper defines Eventually Consistent Distributed Counters (ECDC) and presents an implementation of the concept, Handoff Counters, that is scalable and works over unreliable networks. By giving up the sequencer aspect of class"},"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":"1307.3207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-11T18:28:06Z","cross_cats_sorted":[],"title_canon_sha256":"9ab0ae1d858b19a2594b8f26f6f306103fc97a36a5d3687e32403541275d7d2a","abstract_canon_sha256":"71dc1fc7d042d31546c92bbfb349cf3cb48cadfe0e6320f429a6dc0ee84c2fa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:40.880293Z","signature_b64":"eZFyrTaJXKZ5xpYVoVlxogfTZXTP8wmCdcZT8/Nme32gdUqojhJ4/oprDanLPJjd8KHf455j1QK2YxvLbm0/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76c88a418dc80ed69a668109da3b4275c6b469f15dee4479d21e510ddf31b77b","last_reissued_at":"2026-05-18T03:18:40.879540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:40.879540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Eventually Consistent Counters over Unreliable Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carlos Baquero, Paulo S\\'ergio Almeida","submitted_at":"2013-07-11T18:28:06Z","abstract_excerpt":"Counters are an important abstraction in distributed computing, and play a central role in large scale geo-replicated systems, counting events such as web page impressions or social network \"likes\". Classic distributed counters, strongly consistent, cannot be made both available and partition-tolerant, due to the CAP Theorem, being unsuitable to large scale scenarios. This paper defines Eventually Consistent Distributed Counters (ECDC) and presents an implementation of the concept, Handoff Counters, that is scalable and works over unreliable networks. By giving up the sequencer aspect of class"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3207","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":"1307.3207","created_at":"2026-05-18T03:18:40.879685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3207v1","created_at":"2026-05-18T03:18:40.879685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3207","created_at":"2026-05-18T03:18:40.879685+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3EIUQMNZAHN","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3EIUQMNZAHNNGTG","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3EIUQMN","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.22491","citing_title":"Relay-Based Synchronization of Replicated Data Types in Opportunistic Networks","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O3EIUQMNZAHNNGTGQEE5UO2COX","json":"https://pith.science/pith/O3EIUQMNZAHNNGTGQEE5UO2COX.json","graph_json":"https://pith.science/api/pith-number/O3EIUQMNZAHNNGTGQEE5UO2COX/graph.json","events_json":"https://pith.science/api/pith-number/O3EIUQMNZAHNNGTGQEE5UO2COX/events.json","paper":"https://pith.science/paper/O3EIUQMN"},"agent_actions":{"view_html":"https://pith.science/pith/O3EIUQMNZAHNNGTGQEE5UO2COX","download_json":"https://pith.science/pith/O3EIUQMNZAHNNGTGQEE5UO2COX.json","view_paper":"https://pith.science/paper/O3EIUQMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3207&json=true","fetch_graph":"https://pith.science/api/pith-number/O3EIUQMNZAHNNGTGQEE5UO2COX/graph.json","fetch_events":"https://pith.science/api/pith-number/O3EIUQMNZAHNNGTGQEE5UO2COX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3EIUQMNZAHNNGTGQEE5UO2COX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3EIUQMNZAHNNGTGQEE5UO2COX/action/storage_attestation","attest_author":"https://pith.science/pith/O3EIUQMNZAHNNGTGQEE5UO2COX/action/author_attestation","sign_citation":"https://pith.science/pith/O3EIUQMNZAHNNGTGQEE5UO2COX/action/citation_signature","submit_replication":"https://pith.science/pith/O3EIUQMNZAHNNGTGQEE5UO2COX/action/replication_record"}},"created_at":"2026-05-18T03:18:40.879685+00:00","updated_at":"2026-05-18T03:18:40.879685+00:00"}