{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M5SXERP3DC2R3RHXU4U32DQJQJ","short_pith_number":"pith:M5SXERP3","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"},"canonical_sha256":"67657245fb18b51dc4f7a729bd0e09826419d98b7fcaa223785bde8a9e9763d2","source":{"kind":"arxiv","id":"1301.4587","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4587","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4587v1","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4587","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"pith_short_12","alias_value":"M5SXERP3DC2R","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M5SXERP3DC2R3RHX","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M5SXERP3","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M5SXERP3DC2R3RHXU4U32DQJQJ","target":"record","payload":{"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"},"canonical_sha256":"67657245fb18b51dc4f7a729bd0e09826419d98b7fcaa223785bde8a9e9763d2","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"},"source_kind":"arxiv","source_id":"1301.4587","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:35:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFj8UOpLRhCq/12X78PhUYFRmLsK0CcARGf+k7d6bX8KrL3//rCkElTX3yBArNuTHLJz5tkKAlNj4gJY0O34CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:58:37.485163Z"},"content_sha256":"107d2de3eb74b66bd1f1d0263a80fc86f94f8fc6373790bbf1ec9fc606c6f239","schema_version":"1.0","event_id":"sha256:107d2de3eb74b66bd1f1d0263a80fc86f94f8fc6373790bbf1ec9fc606c6f239"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M5SXERP3DC2R3RHXU4U32DQJQJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:35:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBSYnpOwrxdRGxE+RAsewO+kHjmbjRglRYJ5yd1mDqVV8o8HftH8de7nYYFF6ZNrmCJgRX0uDkuMryRU1s4UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:58:37.485838Z"},"content_sha256":"3e65ceeb8ea466158019be507640b9c6792479db0b7f03e7c259a9d537667476","schema_version":"1.0","event_id":"sha256:3e65ceeb8ea466158019be507640b9c6792479db0b7f03e7c259a9d537667476"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/bundle.json","state_url":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T04:58:37Z","links":{"resolver":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ","bundle":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/bundle.json","state":"https://pith.science/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5SXERP3DC2R3RHXU4U32DQJQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M5SXERP3DC2R3RHXU4U32DQJQJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d23c51a0ee7a8c4cef12a61241a86e2b744dc09ee0b103eaf837f9ad98523ab8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-19T19:00:24Z","title_canon_sha256":"7b46daf32c2cb315edfb97dd5c2ecc70b20ea8fd3ef5464115b5e4f6c6d84875"},"schema_version":"1.0","source":{"id":"1301.4587","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4587","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4587v1","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4587","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"pith_short_12","alias_value":"M5SXERP3DC2R","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M5SXERP3DC2R3RHX","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M5SXERP3","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:3e65ceeb8ea466158019be507640b9c6792479db0b7f03e7c259a9d537667476","target":"graph","created_at":"2026-05-18T03:35:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Domenica Borra, Fabio Pasqualetti, Francesco Bullo","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-19T19:00:24Z","title":"Consensus Networks over Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4587","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:107d2de3eb74b66bd1f1d0263a80fc86f94f8fc6373790bbf1ec9fc606c6f239","target":"record","created_at":"2026-05-18T03:35:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d23c51a0ee7a8c4cef12a61241a86e2b744dc09ee0b103eaf837f9ad98523ab8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-19T19:00:24Z","title_canon_sha256":"7b46daf32c2cb315edfb97dd5c2ecc70b20ea8fd3ef5464115b5e4f6c6d84875"},"schema_version":"1.0","source":{"id":"1301.4587","kind":"arxiv","version":1}},"canonical_sha256":"67657245fb18b51dc4f7a729bd0e09826419d98b7fcaa223785bde8a9e9763d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67657245fb18b51dc4f7a729bd0e09826419d98b7fcaa223785bde8a9e9763d2","first_computed_at":"2026-05-18T03:35:56.301861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:56.301861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OurGq9FOjn/gcl08/9IOiE6nwAamfs2ie3o1D63yVJJeX4RF/XtIAr5uoWmRvDl71+qCPPYrUEaf2FZ+VkWbAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:56.302729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4587","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:107d2de3eb74b66bd1f1d0263a80fc86f94f8fc6373790bbf1ec9fc606c6f239","sha256:3e65ceeb8ea466158019be507640b9c6792479db0b7f03e7c259a9d537667476"],"state_sha256":"ec9a356f65a767050aed1fbd3d805f48c407206d0b44f85debbb5aa2187b526b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHbcz4YGYL9n7SiAzbqKrT9iY417H/ggnutJhPEKtNpvWPPaW8lcfy3LypCNHIo3ndS2ZX2W25v9TEQ2B/ZsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:58:37.489100Z","bundle_sha256":"a0beac9b6fcccb3e7d4a2afa6534e3ffe6b5ad594febe011da6c808020ec263b"}}