{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ODJHIOWAMA4U7KARLUV4KDQ3KA","short_pith_number":"pith:ODJHIOWA","schema_version":"1.0","canonical_sha256":"70d2743ac060394fa8115d2bc50e1b501bcbac7e2adbaa834bc3a85082537de3","source":{"kind":"arxiv","id":"1911.01231","version":1},"attestation_state":"computed","paper":{"title":"Raft Consensus Algorithm: an Effective Substitute for Paxos in High Throughput P2P-based Systems","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Hadi Tabatabaee Malazi, Masoud Nosrati, Mohammad Fazlali, Mohammad Mahdi Dehshibi, Sara Moazezi Eftekhar","submitted_at":"2019-11-04T14:07:58Z","abstract_excerpt":"One of the significant problem in peer-to-peer databases is collision problem. These databases do not rely on a central leader that is a reason to increase scalability and fault tolerance. Utilizing these systems in high throughput computing cause more flexibility in computing system and meanwhile solve the problems in most of the computing systems which are depend on a central nodes. There are limited researches in this scope and they seem are not suitable for using in a large scale. In this paper, we used Cassandra which is a distributed database based on peer-to-peer network as a high throu"},"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":"1911.01231","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-11-04T14:07:58Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"6720c257ee554f9b167e669a829a1340c012a8437c80e00710b315efc73725fb","abstract_canon_sha256":"5298a35e7247db77158dd50b3673f6676b7b684fa998346e5f9ffc4514d803cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:47.162057Z","signature_b64":"mWE+FhkslkzUBa7403Eq7/82PhCV+J+fjYp6aU1xWYAkYWaaKSyE3fBXdUgDHfdJ5/S4xmBwVDImJ6j75V34AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70d2743ac060394fa8115d2bc50e1b501bcbac7e2adbaa834bc3a85082537de3","last_reissued_at":"2026-07-05T00:16:47.161715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:47.161715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Raft Consensus Algorithm: an Effective Substitute for Paxos in High Throughput P2P-based Systems","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Hadi Tabatabaee Malazi, Masoud Nosrati, Mohammad Fazlali, Mohammad Mahdi Dehshibi, Sara Moazezi Eftekhar","submitted_at":"2019-11-04T14:07:58Z","abstract_excerpt":"One of the significant problem in peer-to-peer databases is collision problem. These databases do not rely on a central leader that is a reason to increase scalability and fault tolerance. Utilizing these systems in high throughput computing cause more flexibility in computing system and meanwhile solve the problems in most of the computing systems which are depend on a central nodes. There are limited researches in this scope and they seem are not suitable for using in a large scale. In this paper, we used Cassandra which is a distributed database based on peer-to-peer network as a high throu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01231","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/1911.01231/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":"1911.01231","created_at":"2026-07-05T00:16:47.161770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.01231v1","created_at":"2026-07-05T00:16:47.161770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01231","created_at":"2026-07-05T00:16:47.161770+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODJHIOWAMA4U","created_at":"2026-07-05T00:16:47.161770+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODJHIOWAMA4U7KAR","created_at":"2026-07-05T00:16:47.161770+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODJHIOWA","created_at":"2026-07-05T00:16:47.161770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14900","citing_title":"Implementing Decentralized Per-Partition Automatic Failover in Azure Cosmos DB","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODJHIOWAMA4U7KARLUV4KDQ3KA","json":"https://pith.science/pith/ODJHIOWAMA4U7KARLUV4KDQ3KA.json","graph_json":"https://pith.science/api/pith-number/ODJHIOWAMA4U7KARLUV4KDQ3KA/graph.json","events_json":"https://pith.science/api/pith-number/ODJHIOWAMA4U7KARLUV4KDQ3KA/events.json","paper":"https://pith.science/paper/ODJHIOWA"},"agent_actions":{"view_html":"https://pith.science/pith/ODJHIOWAMA4U7KARLUV4KDQ3KA","download_json":"https://pith.science/pith/ODJHIOWAMA4U7KARLUV4KDQ3KA.json","view_paper":"https://pith.science/paper/ODJHIOWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.01231&json=true","fetch_graph":"https://pith.science/api/pith-number/ODJHIOWAMA4U7KARLUV4KDQ3KA/graph.json","fetch_events":"https://pith.science/api/pith-number/ODJHIOWAMA4U7KARLUV4KDQ3KA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODJHIOWAMA4U7KARLUV4KDQ3KA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODJHIOWAMA4U7KARLUV4KDQ3KA/action/storage_attestation","attest_author":"https://pith.science/pith/ODJHIOWAMA4U7KARLUV4KDQ3KA/action/author_attestation","sign_citation":"https://pith.science/pith/ODJHIOWAMA4U7KARLUV4KDQ3KA/action/citation_signature","submit_replication":"https://pith.science/pith/ODJHIOWAMA4U7KARLUV4KDQ3KA/action/replication_record"}},"created_at":"2026-07-05T00:16:47.161770+00:00","updated_at":"2026-07-05T00:16:47.161770+00:00"}