{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M5SXERP3DC2R3RHXU4U32DQJQJ","short_pith_number":"pith:M5SXERP3","schema_version":"1.0","canonical_sha256":"67657245fb18b51dc4f7a729bd0e09826419d98b7fcaa223785bde8a9e9763d2","source":{"kind":"arxiv","id":"1301.4587","version":1},"attestation_state":"computed","paper":{"title":"Consensus Networks over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Domenica Borra, Fabio Pasqualetti, Francesco Bullo","submitted_at":"2013-01-19T19:00:24Z","abstract_excerpt":"This work studies consensus strategies for networks of agents with limited memory, computation, and communication capabilities. We assume that agents can process only values from a finite alphabet, and we adopt the framework of finite fields, where the alphabet consists of the integers {0,...,p-1}, for some prime number p, and operations are performed modulo p. Thus, we define a new class of consensus dynamics, which can be exploited in certain applications such as pose estimation in capacity and memory constrained sensor networks. For consensus networks over finite fields, we provide necessar"},"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":"1301.4587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-19T19:00:24Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7b46daf32c2cb315edfb97dd5c2ecc70b20ea8fd3ef5464115b5e4f6c6d84875","abstract_canon_sha256":"d23c51a0ee7a8c4cef12a61241a86e2b744dc09ee0b103eaf837f9ad98523ab8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:56.302729Z","signature_b64":"OurGq9FOjn/gcl08/9IOiE6nwAamfs2ie3o1D63yVJJeX4RF/XtIAr5uoWmRvDl71+qCPPYrUEaf2FZ+VkWbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67657245fb18b51dc4f7a729bd0e09826419d98b7fcaa223785bde8a9e9763d2","last_reissued_at":"2026-05-18T03:35:56.301861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:56.301861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consensus Networks over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Domenica Borra, Fabio Pasqualetti, Francesco Bullo","submitted_at":"2013-01-19T19:00:24Z","abstract_excerpt":"This work studies consensus strategies for networks of agents with limited memory, computation, and communication capabilities. We assume that agents can process only values from a finite alphabet, and we adopt the framework of finite fields, where the alphabet consists of the integers {0,...,p-1}, for some prime number p, and operations are performed modulo p. Thus, we define a new class of consensus dynamics, which can be exploited in certain applications such as pose estimation in capacity and memory constrained sensor networks. For consensus networks over finite fields, we provide necessar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4587","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":"1301.4587","created_at":"2026-05-18T03:35:56.301993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4587v1","created_at":"2026-05-18T03:35:56.301993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4587","created_at":"2026-05-18T03:35:56.301993+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5SXERP3DC2R","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5SXERP3DC2R3RHX","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5SXERP3","created_at":"2026-05-18T12:27:51.066281+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/M5SXERP3DC2R3RHXU4U32DQJQJ","json":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ.json","graph_json":"https://pith.science/api/pith-number/M5SXERP3DC2R3RHXU4U32DQJQJ/graph.json","events_json":"https://pith.science/api/pith-number/M5SXERP3DC2R3RHXU4U32DQJQJ/events.json","paper":"https://pith.science/paper/M5SXERP3"},"agent_actions":{"view_html":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ","download_json":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ.json","view_paper":"https://pith.science/paper/M5SXERP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4587&json=true","fetch_graph":"https://pith.science/api/pith-number/M5SXERP3DC2R3RHXU4U32DQJQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/M5SXERP3DC2R3RHXU4U32DQJQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/action/storage_attestation","attest_author":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/action/author_attestation","sign_citation":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/action/citation_signature","submit_replication":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/action/replication_record"}},"created_at":"2026-05-18T03:35:56.301993+00:00","updated_at":"2026-05-18T03:35:56.301993+00:00"}