{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:N2XS6H2KEI7KLOJVKVFGQCTE6J","short_pith_number":"pith:N2XS6H2K","schema_version":"1.0","canonical_sha256":"6eaf2f1f4a223ea5b935554a680a64f26426554dbb44d75b691844015c17e6dc","source":{"kind":"arxiv","id":"1010.1812","version":1},"attestation_state":"computed","paper":{"title":"Modified Bully Algorithm using Election Commission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Afroza Nahar, Muhammad Mahbubur Rahman","submitted_at":"2010-10-09T06:00:33Z","abstract_excerpt":"Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized control IPC, etc. A leader is required to make synchronization between different processes. And different election algorithms are used to elect a coordinator among the available processes in the system such a way that there will be only one coordinator at any time. Bully election algorithm is one of the classical and well-known approaches in coordinator election process. This paper will present a modified version of bul"},"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":"1010.1812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-09T06:00:33Z","cross_cats_sorted":[],"title_canon_sha256":"1cf2fdcf7b0ec89adb089e31dd583f276e9567c4778040fc866d867ccdff7ecd","abstract_canon_sha256":"5686ef29f5342dbc000d1e3a48119eec6b30cbe92c0571f9877e9300a82b9fb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:28.492279Z","signature_b64":"fmm4HXsXUGZ9KVnjnzzvmOtOTh6/7aHqsL/aVwjKbeH/dlO69LFjjlcIOzMP5hchMa+oSz7jDXr5EHxG1JjSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eaf2f1f4a223ea5b935554a680a64f26426554dbb44d75b691844015c17e6dc","last_reissued_at":"2026-05-18T04:39:28.491736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:28.491736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modified Bully Algorithm using Election Commission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Afroza Nahar, Muhammad Mahbubur Rahman","submitted_at":"2010-10-09T06:00:33Z","abstract_excerpt":"Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized control IPC, etc. A leader is required to make synchronization between different processes. And different election algorithms are used to elect a coordinator among the available processes in the system such a way that there will be only one coordinator at any time. Bully election algorithm is one of the classical and well-known approaches in coordinator election process. This paper will present a modified version of bul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1812","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":"1010.1812","created_at":"2026-05-18T04:39:28.491826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1812v1","created_at":"2026-05-18T04:39:28.491826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1812","created_at":"2026-05-18T04:39:28.491826+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2XS6H2KEI7K","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2XS6H2KEI7KLOJV","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2XS6H2K","created_at":"2026-05-18T12:26:10.704358+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/N2XS6H2KEI7KLOJVKVFGQCTE6J","json":"https://pith.science/pith/N2XS6H2KEI7KLOJVKVFGQCTE6J.json","graph_json":"https://pith.science/api/pith-number/N2XS6H2KEI7KLOJVKVFGQCTE6J/graph.json","events_json":"https://pith.science/api/pith-number/N2XS6H2KEI7KLOJVKVFGQCTE6J/events.json","paper":"https://pith.science/paper/N2XS6H2K"},"agent_actions":{"view_html":"https://pith.science/pith/N2XS6H2KEI7KLOJVKVFGQCTE6J","download_json":"https://pith.science/pith/N2XS6H2KEI7KLOJVKVFGQCTE6J.json","view_paper":"https://pith.science/paper/N2XS6H2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1812&json=true","fetch_graph":"https://pith.science/api/pith-number/N2XS6H2KEI7KLOJVKVFGQCTE6J/graph.json","fetch_events":"https://pith.science/api/pith-number/N2XS6H2KEI7KLOJVKVFGQCTE6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2XS6H2KEI7KLOJVKVFGQCTE6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2XS6H2KEI7KLOJVKVFGQCTE6J/action/storage_attestation","attest_author":"https://pith.science/pith/N2XS6H2KEI7KLOJVKVFGQCTE6J/action/author_attestation","sign_citation":"https://pith.science/pith/N2XS6H2KEI7KLOJVKVFGQCTE6J/action/citation_signature","submit_replication":"https://pith.science/pith/N2XS6H2KEI7KLOJVKVFGQCTE6J/action/replication_record"}},"created_at":"2026-05-18T04:39:28.491826+00:00","updated_at":"2026-05-18T04:39:28.491826+00:00"}