{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D6A76ZRNS5HBMHNYW4HYEDDN5C","short_pith_number":"pith:D6A76ZRN","canonical_record":{"source":{"id":"1802.01054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-04T01:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"b84096b0bd636660ab3e57b5e27de2cd25b11c6d98483f4ed8a13a98b3ff3db3","abstract_canon_sha256":"410615b746e702994e1eea5a7acfaa125bb60d84472506a0fde49f967f528b82"},"schema_version":"1.0"},"canonical_sha256":"1f81ff662d974e161db8b70f820c6de88bd60b7179177bd23c4dc0153b0838d8","source":{"kind":"arxiv","id":"1802.01054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01054","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01054v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01054","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"D6A76ZRNS5HB","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6A76ZRNS5HBMHNY","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6A76ZRN","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D6A76ZRNS5HBMHNYW4HYEDDN5C","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-04T01:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"b84096b0bd636660ab3e57b5e27de2cd25b11c6d98483f4ed8a13a98b3ff3db3","abstract_canon_sha256":"410615b746e702994e1eea5a7acfaa125bb60d84472506a0fde49f967f528b82"},"schema_version":"1.0"},"canonical_sha256":"1f81ff662d974e161db8b70f820c6de88bd60b7179177bd23c4dc0153b0838d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:27.484578Z","signature_b64":"CkrpxV+6LTgzf6Wrr4gCFh0LLEhXo/zxnXwq/YFhYwvonGTIWTnfLMMmVih+5BL7pcz483CVUPdIKBX3ndAGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f81ff662d974e161db8b70f820c6de88bd60b7179177bd23c4dc0153b0838d8","last_reissued_at":"2026-05-18T00:24:27.484090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:27.484090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01054","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-18T00:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxFCEo4IEkn9iJxeippmMAa2teL/UGz9c/rASwC9Lq6Re1vgMUX6EaLLuc1ITgVZDQhvY0LlFbCsto+EvflyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:49:10.661372Z"},"content_sha256":"a1aed33d4a67e93b7acb1bc031354ca089b6de5a450581512ee3b6ed66833afc","schema_version":"1.0","event_id":"sha256:a1aed33d4a67e93b7acb1bc031354ca089b6de5a450581512ee3b6ed66833afc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D6A76ZRNS5HBMHNYW4HYEDDN5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interval Consensus for Multiagent Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Angela Fontan, Claudio Altafini, Guodong Shi, Xiaoming Hu","submitted_at":"2018-02-04T01:08:40Z","abstract_excerpt":"The constrained consensus problem considered in this paper, denoted interval consensus, is characterized by the fact that each agent can impose a lower and upper bound on the achievable consensus value. Such constraints can be encoded in the consensus dynamics by saturating the values that an agent transmits to its neighboring nodes. We show in the paper that when the intersection of the intervals imposed by the agents is nonempty, the resulting constrained consensus problem must converge to a common value inside that intersection. In our algorithm, convergence happens in a fully distributed m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01054","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-18T00:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZmqUAhnLa9liymQjHAkQoX5Xr83CvwtefXP7MOkulOFVEfEwU/QfHb1G1QY25XmbSSL61h66Vf5BXPrd5gcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:49:10.661723Z"},"content_sha256":"8fbda71cb54a6a94de83cc069171708210c42c81124658a28156112fc5eb009d","schema_version":"1.0","event_id":"sha256:8fbda71cb54a6a94de83cc069171708210c42c81124658a28156112fc5eb009d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6A76ZRNS5HBMHNYW4HYEDDN5C/bundle.json","state_url":"https://pith.science/pith/D6A76ZRNS5HBMHNYW4HYEDDN5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6A76ZRNS5HBMHNYW4HYEDDN5C/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-10T14:49:10Z","links":{"resolver":"https://pith.science/pith/D6A76ZRNS5HBMHNYW4HYEDDN5C","bundle":"https://pith.science/pith/D6A76ZRNS5HBMHNYW4HYEDDN5C/bundle.json","state":"https://pith.science/pith/D6A76ZRNS5HBMHNYW4HYEDDN5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6A76ZRNS5HBMHNYW4HYEDDN5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D6A76ZRNS5HBMHNYW4HYEDDN5C","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":"410615b746e702994e1eea5a7acfaa125bb60d84472506a0fde49f967f528b82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-04T01:08:40Z","title_canon_sha256":"b84096b0bd636660ab3e57b5e27de2cd25b11c6d98483f4ed8a13a98b3ff3db3"},"schema_version":"1.0","source":{"id":"1802.01054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01054","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01054v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01054","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"D6A76ZRNS5HB","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6A76ZRNS5HBMHNY","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6A76ZRN","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:8fbda71cb54a6a94de83cc069171708210c42c81124658a28156112fc5eb009d","target":"graph","created_at":"2026-05-18T00:24:27Z","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":"The constrained consensus problem considered in this paper, denoted interval consensus, is characterized by the fact that each agent can impose a lower and upper bound on the achievable consensus value. Such constraints can be encoded in the consensus dynamics by saturating the values that an agent transmits to its neighboring nodes. We show in the paper that when the intersection of the intervals imposed by the agents is nonempty, the resulting constrained consensus problem must converge to a common value inside that intersection. In our algorithm, convergence happens in a fully distributed m","authors_text":"Angela Fontan, Claudio Altafini, Guodong Shi, Xiaoming Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-04T01:08:40Z","title":"Interval Consensus for Multiagent Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01054","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:a1aed33d4a67e93b7acb1bc031354ca089b6de5a450581512ee3b6ed66833afc","target":"record","created_at":"2026-05-18T00:24:27Z","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":"410615b746e702994e1eea5a7acfaa125bb60d84472506a0fde49f967f528b82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-04T01:08:40Z","title_canon_sha256":"b84096b0bd636660ab3e57b5e27de2cd25b11c6d98483f4ed8a13a98b3ff3db3"},"schema_version":"1.0","source":{"id":"1802.01054","kind":"arxiv","version":1}},"canonical_sha256":"1f81ff662d974e161db8b70f820c6de88bd60b7179177bd23c4dc0153b0838d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f81ff662d974e161db8b70f820c6de88bd60b7179177bd23c4dc0153b0838d8","first_computed_at":"2026-05-18T00:24:27.484090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:27.484090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CkrpxV+6LTgzf6Wrr4gCFh0LLEhXo/zxnXwq/YFhYwvonGTIWTnfLMMmVih+5BL7pcz483CVUPdIKBX3ndAGBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:27.484578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1aed33d4a67e93b7acb1bc031354ca089b6de5a450581512ee3b6ed66833afc","sha256:8fbda71cb54a6a94de83cc069171708210c42c81124658a28156112fc5eb009d"],"state_sha256":"2db3c168a759b8b5f3d5bf3fdba6e1bc1cec1a29abe100de208d19d011b1dd0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yHYYqJOsc1loBjLhPe5ejLh1Ia4Q3zfWzh074lbeDf9eNaMwoVJeaf16GB8/cX5IF3EtkdrfnG1cnvGwU4pBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T14:49:10.663635Z","bundle_sha256":"a95426ca31f4f06ee571c162e2c78b6846d2303725d73d177e28c5d8babea377"}}