{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XV4QAVXJMYXIH4FTCBPPPRVS3G","short_pith_number":"pith:XV4QAVXJ","schema_version":"1.0","canonical_sha256":"bd790056e9662e83f0b3105ef7c6b2d9a815ef14cdbff99c9c701d601792ac0f","source":{"kind":"arxiv","id":"1801.07656","version":1},"attestation_state":"computed","paper":{"title":"Byzantine Gathering in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Anissa Lamani, S\\'ebastien Bouchard, Yoann dieudonn\\'e","submitted_at":"2018-01-23T16:53:19Z","abstract_excerpt":"We study the task of Byzantine gathering in a network modeled as a graph. Despite the presence of Byzantine agents, all the other (good) agents, starting from possibly different nodes and applying the same deterministic algorithm, have to meet at the same node in finite time and stop moving. An adversary chooses the initial nodes of the agents and assigns a different label to each of them. The agents move in synchronous rounds and communicate with each other only when located at the same node. Within the team, f of the agents are Byzantine. A Byzantine agent acts in an unpredictable way: in pa"},"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":"1801.07656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T16:53:19Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"eccc93a36acf9623aae39290d2127498dc02128d77800889f30207586ff10660","abstract_canon_sha256":"d62508a912b6a2e88a35b5002c115929342fe85ea14751431fbb8b996a6c1f1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:12.335298Z","signature_b64":"2348ykir4r3+VlMS5rAjss6px1IpLtxyo5d604PsadT2u922c4CihdtcvQQvGQeOWye3gNtzVmcPxY98SzFdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd790056e9662e83f0b3105ef7c6b2d9a815ef14cdbff99c9c701d601792ac0f","last_reissued_at":"2026-05-18T00:25:12.334874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:12.334874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine Gathering in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Anissa Lamani, S\\'ebastien Bouchard, Yoann dieudonn\\'e","submitted_at":"2018-01-23T16:53:19Z","abstract_excerpt":"We study the task of Byzantine gathering in a network modeled as a graph. Despite the presence of Byzantine agents, all the other (good) agents, starting from possibly different nodes and applying the same deterministic algorithm, have to meet at the same node in finite time and stop moving. An adversary chooses the initial nodes of the agents and assigns a different label to each of them. The agents move in synchronous rounds and communicate with each other only when located at the same node. Within the team, f of the agents are Byzantine. A Byzantine agent acts in an unpredictable way: in pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07656","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":"1801.07656","created_at":"2026-05-18T00:25:12.334935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07656v1","created_at":"2026-05-18T00:25:12.334935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07656","created_at":"2026-05-18T00:25:12.334935+00:00"},{"alias_kind":"pith_short_12","alias_value":"XV4QAVXJMYXI","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XV4QAVXJMYXIH4FT","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XV4QAVXJ","created_at":"2026-05-18T12:33:01.666342+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/XV4QAVXJMYXIH4FTCBPPPRVS3G","json":"https://pith.science/pith/XV4QAVXJMYXIH4FTCBPPPRVS3G.json","graph_json":"https://pith.science/api/pith-number/XV4QAVXJMYXIH4FTCBPPPRVS3G/graph.json","events_json":"https://pith.science/api/pith-number/XV4QAVXJMYXIH4FTCBPPPRVS3G/events.json","paper":"https://pith.science/paper/XV4QAVXJ"},"agent_actions":{"view_html":"https://pith.science/pith/XV4QAVXJMYXIH4FTCBPPPRVS3G","download_json":"https://pith.science/pith/XV4QAVXJMYXIH4FTCBPPPRVS3G.json","view_paper":"https://pith.science/paper/XV4QAVXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07656&json=true","fetch_graph":"https://pith.science/api/pith-number/XV4QAVXJMYXIH4FTCBPPPRVS3G/graph.json","fetch_events":"https://pith.science/api/pith-number/XV4QAVXJMYXIH4FTCBPPPRVS3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XV4QAVXJMYXIH4FTCBPPPRVS3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XV4QAVXJMYXIH4FTCBPPPRVS3G/action/storage_attestation","attest_author":"https://pith.science/pith/XV4QAVXJMYXIH4FTCBPPPRVS3G/action/author_attestation","sign_citation":"https://pith.science/pith/XV4QAVXJMYXIH4FTCBPPPRVS3G/action/citation_signature","submit_replication":"https://pith.science/pith/XV4QAVXJMYXIH4FTCBPPPRVS3G/action/replication_record"}},"created_at":"2026-05-18T00:25:12.334935+00:00","updated_at":"2026-05-18T00:25:12.334935+00:00"}