{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZT2PPLMTIBNVGX2XZRRQ77L4NV","short_pith_number":"pith:ZT2PPLMT","canonical_record":{"source":{"id":"1410.6071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-22T15:22:40Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"8ec63078f2a2fa56342261217ccc8d7dfc9134e09bd1735c7fb22af27686dc3c","abstract_canon_sha256":"92a0340bc24ee22d32e29b3e01a73e156c0662c7c5ec13dc08058df5bfb1a83a"},"schema_version":"1.0"},"canonical_sha256":"ccf4f7ad93405b535f57cc630ffd7c6d57ec4fb308431b684dadbbbde017e2e0","source":{"kind":"arxiv","id":"1410.6071","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6071","created_at":"2026-05-18T01:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6071v1","created_at":"2026-05-18T01:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6071","created_at":"2026-05-18T01:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZT2PPLMTIBNV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZT2PPLMTIBNVGX2X","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZT2PPLMT","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZT2PPLMTIBNVGX2XZRRQ77L4NV","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-22T15:22:40Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"8ec63078f2a2fa56342261217ccc8d7dfc9134e09bd1735c7fb22af27686dc3c","abstract_canon_sha256":"92a0340bc24ee22d32e29b3e01a73e156c0662c7c5ec13dc08058df5bfb1a83a"},"schema_version":"1.0"},"canonical_sha256":"ccf4f7ad93405b535f57cc630ffd7c6d57ec4fb308431b684dadbbbde017e2e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:36.401293Z","signature_b64":"V75p/uOg7HF0QrKoqImlUTU3VodFLFCkWpSemTLQAteXeXM70SovK0gZh3G/54HdnwQYU3CDIZZIs/yxJ1aLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccf4f7ad93405b535f57cc630ffd7c6d57ec4fb308431b684dadbbbde017e2e0","last_reissued_at":"2026-05-18T01:15:36.400569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:36.400569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6071","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-18T01:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTeklvWoUje0mNIY7XLjss0tq882YpGwWfHTEgOWaFWxMtw+/0LC0AkoCPihGbmKkkxPORNF8d1ihNCzTiVdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:13:58.442642Z"},"content_sha256":"72a76138773e4ad3046bcb8d2bb3558bf88e479e8c09c967b8ef9d001039e150","schema_version":"1.0","event_id":"sha256:72a76138773e4ad3046bcb8d2bb3558bf88e479e8c09c967b8ef9d001039e150"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZT2PPLMTIBNVGX2XZRRQ77L4NV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding the Exact Delay Bound for Consensus of Linear Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Rudy Cepeda-Gomez","submitted_at":"2014-10-22T15:22:40Z","abstract_excerpt":"This paper focuses on consensus problems for high-order, linear multi-agent systems. Undirected communication topologies and fixed, uniform communication time delay are taken into account. This class of problems has been widely study in the literature, but there are still gaps concerning the exact delay stability bounds in the domain of the delays. The more common analysis employed is based on Lyapunov-Krasowskii functionals, which produce very conservative results that are cumbersome to apply. As an alternative, we employ the Cluster Treatment of Characteristic Roots paradigm to study the sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6071","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-18T01:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHYeb2utrgTxbSOBIDxFDqBnacdlQFs1hM3ENkkBXHcGr4zcJz38kjL/52t20SbSHVbdtpSty4NNXsZASpKhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:13:58.442984Z"},"content_sha256":"078e04de36f58644812e1ccfb2312e63e38bff36d13de69cb2d7970c96a36979","schema_version":"1.0","event_id":"sha256:078e04de36f58644812e1ccfb2312e63e38bff36d13de69cb2d7970c96a36979"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZT2PPLMTIBNVGX2XZRRQ77L4NV/bundle.json","state_url":"https://pith.science/pith/ZT2PPLMTIBNVGX2XZRRQ77L4NV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZT2PPLMTIBNVGX2XZRRQ77L4NV/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-03T20:13:58Z","links":{"resolver":"https://pith.science/pith/ZT2PPLMTIBNVGX2XZRRQ77L4NV","bundle":"https://pith.science/pith/ZT2PPLMTIBNVGX2XZRRQ77L4NV/bundle.json","state":"https://pith.science/pith/ZT2PPLMTIBNVGX2XZRRQ77L4NV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZT2PPLMTIBNVGX2XZRRQ77L4NV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZT2PPLMTIBNVGX2XZRRQ77L4NV","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":"92a0340bc24ee22d32e29b3e01a73e156c0662c7c5ec13dc08058df5bfb1a83a","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-22T15:22:40Z","title_canon_sha256":"8ec63078f2a2fa56342261217ccc8d7dfc9134e09bd1735c7fb22af27686dc3c"},"schema_version":"1.0","source":{"id":"1410.6071","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6071","created_at":"2026-05-18T01:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6071v1","created_at":"2026-05-18T01:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6071","created_at":"2026-05-18T01:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZT2PPLMTIBNV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZT2PPLMTIBNVGX2X","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZT2PPLMT","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:078e04de36f58644812e1ccfb2312e63e38bff36d13de69cb2d7970c96a36979","target":"graph","created_at":"2026-05-18T01:15:36Z","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 paper focuses on consensus problems for high-order, linear multi-agent systems. Undirected communication topologies and fixed, uniform communication time delay are taken into account. This class of problems has been widely study in the literature, but there are still gaps concerning the exact delay stability bounds in the domain of the delays. The more common analysis employed is based on Lyapunov-Krasowskii functionals, which produce very conservative results that are cumbersome to apply. As an alternative, we employ the Cluster Treatment of Characteristic Roots paradigm to study the sta","authors_text":"Rudy Cepeda-Gomez","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-22T15:22:40Z","title":"Finding the Exact Delay Bound for Consensus of Linear Multi-Agent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6071","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:72a76138773e4ad3046bcb8d2bb3558bf88e479e8c09c967b8ef9d001039e150","target":"record","created_at":"2026-05-18T01:15:36Z","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":"92a0340bc24ee22d32e29b3e01a73e156c0662c7c5ec13dc08058df5bfb1a83a","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-22T15:22:40Z","title_canon_sha256":"8ec63078f2a2fa56342261217ccc8d7dfc9134e09bd1735c7fb22af27686dc3c"},"schema_version":"1.0","source":{"id":"1410.6071","kind":"arxiv","version":1}},"canonical_sha256":"ccf4f7ad93405b535f57cc630ffd7c6d57ec4fb308431b684dadbbbde017e2e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccf4f7ad93405b535f57cc630ffd7c6d57ec4fb308431b684dadbbbde017e2e0","first_computed_at":"2026-05-18T01:15:36.400569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:36.400569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V75p/uOg7HF0QrKoqImlUTU3VodFLFCkWpSemTLQAteXeXM70SovK0gZh3G/54HdnwQYU3CDIZZIs/yxJ1aLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:36.401293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6071","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72a76138773e4ad3046bcb8d2bb3558bf88e479e8c09c967b8ef9d001039e150","sha256:078e04de36f58644812e1ccfb2312e63e38bff36d13de69cb2d7970c96a36979"],"state_sha256":"43b3789cf9d5195d9ccf3005fdf4340b5e48e74ae97c297c1a14b26952c37b91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUzkFmr3onAP9XcA3Cd/QJ4J6nbj4q03WIJNWSz1g+Fv8HwBVz0aQFjthDzQuPfON1g9ijIOjkDNq/FupsVmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:13:58.444973Z","bundle_sha256":"a7ac3f608b170db11fcf2f1a9b6a61f4b73c1413944666ff865661f41e154138"}}