{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VZ2INPAIIL2XEXGG2KRH7ZEMC3","short_pith_number":"pith:VZ2INPAI","canonical_record":{"source":{"id":"1903.11246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-27T04:38:31Z","cross_cats_sorted":[],"title_canon_sha256":"0439a7c75ed3260027de24d761ddd65d67dd61001d3cd843c485b943e8c0c513","abstract_canon_sha256":"05b3dcd0a46d375a15c70a829902c6e240b6c778a1b6fc9269aa456d58fbb4c6"},"schema_version":"1.0"},"canonical_sha256":"ae7486bc0842f5725cc6d2a27fe48c16f3dab330de67490f3c55165074286e3b","source":{"kind":"arxiv","id":"1903.11246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11246","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11246v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11246","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"VZ2INPAIIL2X","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VZ2INPAIIL2XEXGG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VZ2INPAI","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VZ2INPAIIL2XEXGG2KRH7ZEMC3","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-27T04:38:31Z","cross_cats_sorted":[],"title_canon_sha256":"0439a7c75ed3260027de24d761ddd65d67dd61001d3cd843c485b943e8c0c513","abstract_canon_sha256":"05b3dcd0a46d375a15c70a829902c6e240b6c778a1b6fc9269aa456d58fbb4c6"},"schema_version":"1.0"},"canonical_sha256":"ae7486bc0842f5725cc6d2a27fe48c16f3dab330de67490f3c55165074286e3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:03.795243Z","signature_b64":"fRBNaSJqj2/K8pm1RBX4LxuXpHesCAlwJ5/qsG3eqdJbnAiWrwm4G4FrJCk8OviUPgwEHQq648CwpkQaAdPMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae7486bc0842f5725cc6d2a27fe48c16f3dab330de67490f3c55165074286e3b","last_reissued_at":"2026-05-17T23:50:03.794706Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:03.794706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11246","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-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Mq8E6Qv53kGVTD2eQGpxu4QJivX/fE1FiAiRSD1gF7wJRp53Cre1z1ez2BDSNeTGk3M1BO5EMISMR85jWczCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:58:19.497254Z"},"content_sha256":"1de97913996aaf4000c335d0b56dcfbf1e7ef17dd3209efdf3f688c7ae53868a","schema_version":"1.0","event_id":"sha256:1de97913996aaf4000c335d0b56dcfbf1e7ef17dd3209efdf3f688c7ae53868a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VZ2INPAIIL2XEXGG2KRH7ZEMC3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topological Controllability of Undirected Networks of Diffusively-Coupled Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Byeong-Yeon Kim, Hyo-Sung Ahn, Kevin L. Moore, Kwang-Kyo Oh, Quoc Van Tran, Seong-Ho Kwon","submitted_at":"2019-03-27T04:38:31Z","abstract_excerpt":"This paper presents conditions for establishing topological controllability in undirected networks of diffusively coupled agents. Specifically, controllability is considered based on the signs of the edges (negative, positive or zero). Our approach differs from well-known structural controllability conditions for linear systems or consensus networks, where controllability conditions are based on edge connectivity (i.e., zero or nonzero edges). Our results first provide a process for merging controllable graphs into a larger controllable graph. Then, based on this process, we provide a graph de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11246","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-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xj/jlmnrrECXRywSfiuwUzH1zREc/K0PgocaUxI82cq6AxE4aEqn/4wABS6Wtn2aijHwBkC4nP2GryLmEll5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:58:19.497896Z"},"content_sha256":"057d23c34e5ae200d100ee42c007cf78426d6fc1e0d5270b2f6cfb0ed0c335d1","schema_version":"1.0","event_id":"sha256:057d23c34e5ae200d100ee42c007cf78426d6fc1e0d5270b2f6cfb0ed0c335d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZ2INPAIIL2XEXGG2KRH7ZEMC3/bundle.json","state_url":"https://pith.science/pith/VZ2INPAIIL2XEXGG2KRH7ZEMC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZ2INPAIIL2XEXGG2KRH7ZEMC3/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-05-28T21:58:19Z","links":{"resolver":"https://pith.science/pith/VZ2INPAIIL2XEXGG2KRH7ZEMC3","bundle":"https://pith.science/pith/VZ2INPAIIL2XEXGG2KRH7ZEMC3/bundle.json","state":"https://pith.science/pith/VZ2INPAIIL2XEXGG2KRH7ZEMC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZ2INPAIIL2XEXGG2KRH7ZEMC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VZ2INPAIIL2XEXGG2KRH7ZEMC3","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":"05b3dcd0a46d375a15c70a829902c6e240b6c778a1b6fc9269aa456d58fbb4c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-27T04:38:31Z","title_canon_sha256":"0439a7c75ed3260027de24d761ddd65d67dd61001d3cd843c485b943e8c0c513"},"schema_version":"1.0","source":{"id":"1903.11246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11246","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11246v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11246","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"VZ2INPAIIL2X","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VZ2INPAIIL2XEXGG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VZ2INPAI","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:057d23c34e5ae200d100ee42c007cf78426d6fc1e0d5270b2f6cfb0ed0c335d1","target":"graph","created_at":"2026-05-17T23:50:03Z","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 presents conditions for establishing topological controllability in undirected networks of diffusively coupled agents. Specifically, controllability is considered based on the signs of the edges (negative, positive or zero). Our approach differs from well-known structural controllability conditions for linear systems or consensus networks, where controllability conditions are based on edge connectivity (i.e., zero or nonzero edges). Our results first provide a process for merging controllable graphs into a larger controllable graph. Then, based on this process, we provide a graph de","authors_text":"Byeong-Yeon Kim, Hyo-Sung Ahn, Kevin L. Moore, Kwang-Kyo Oh, Quoc Van Tran, Seong-Ho Kwon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-27T04:38:31Z","title":"Topological Controllability of Undirected Networks of Diffusively-Coupled Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11246","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:1de97913996aaf4000c335d0b56dcfbf1e7ef17dd3209efdf3f688c7ae53868a","target":"record","created_at":"2026-05-17T23:50:03Z","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":"05b3dcd0a46d375a15c70a829902c6e240b6c778a1b6fc9269aa456d58fbb4c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-27T04:38:31Z","title_canon_sha256":"0439a7c75ed3260027de24d761ddd65d67dd61001d3cd843c485b943e8c0c513"},"schema_version":"1.0","source":{"id":"1903.11246","kind":"arxiv","version":1}},"canonical_sha256":"ae7486bc0842f5725cc6d2a27fe48c16f3dab330de67490f3c55165074286e3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae7486bc0842f5725cc6d2a27fe48c16f3dab330de67490f3c55165074286e3b","first_computed_at":"2026-05-17T23:50:03.794706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:03.794706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fRBNaSJqj2/K8pm1RBX4LxuXpHesCAlwJ5/qsG3eqdJbnAiWrwm4G4FrJCk8OviUPgwEHQq648CwpkQaAdPMBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:03.795243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1de97913996aaf4000c335d0b56dcfbf1e7ef17dd3209efdf3f688c7ae53868a","sha256:057d23c34e5ae200d100ee42c007cf78426d6fc1e0d5270b2f6cfb0ed0c335d1"],"state_sha256":"412f52f2f18d11a71c382405ee88bc8dca13960ecae42e32b9d8441f9a01123c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"emYQdQRCJexMKEo2/oAbrfxZHEi8hvPvg+PTMZDUJw1ZIty/n9SHAhnbSY3/XseHPC14kTIJlZDJLa6VnAyLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:58:19.501419Z","bundle_sha256":"c8416a88cbbcfc912221e09aa981e19b7418e8bc527c8002a8d7bc0b22b4ba2b"}}