{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MJO2HHIFGFKU6BUVXCYUGOPQJO","short_pith_number":"pith:MJO2HHIF","canonical_record":{"source":{"id":"1803.05247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-14T12:59:46Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"e9ec55e43440cf250f5ee8d6e3294e71bfb32e5fbc79c4ac090176e1cc5997e2","abstract_canon_sha256":"514df78661be32d05e974c8020a5c9b9ae01f274f57ac6514d9981f49aa7177c"},"schema_version":"1.0"},"canonical_sha256":"625da39d0531554f0695b8b14339f04b998f115f02f015229bb393460e1b04b5","source":{"kind":"arxiv","id":"1803.05247","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05247","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05247v2","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05247","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"MJO2HHIFGFKU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MJO2HHIFGFKU6BUV","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MJO2HHIF","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MJO2HHIFGFKU6BUVXCYUGOPQJO","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-14T12:59:46Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"e9ec55e43440cf250f5ee8d6e3294e71bfb32e5fbc79c4ac090176e1cc5997e2","abstract_canon_sha256":"514df78661be32d05e974c8020a5c9b9ae01f274f57ac6514d9981f49aa7177c"},"schema_version":"1.0"},"canonical_sha256":"625da39d0531554f0695b8b14339f04b998f115f02f015229bb393460e1b04b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:10.525454Z","signature_b64":"iZs+Pi9d/Akw+AghuKyClBX/klZqhdVRhaBJp984jiKsANrR7+TpHtJcSBlGWh6BQVxdmj0KtjWn7/lXxg2aCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"625da39d0531554f0695b8b14339f04b998f115f02f015229bb393460e1b04b5","last_reissued_at":"2026-05-18T00:10:10.524747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:10.524747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05247","source_version":2,"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:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gB+QiFWNQ34QvArmjcsPqWbYPnAcZSCvGvSWXMR8AE7tAnjwJq0luTcQW4sqC0MiefSU8ZRcZ7gdgUwrd9/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:47:54.860380Z"},"content_sha256":"00d59e02b3a311e274d79a813280883fef1b2770dca85c7c51a6e383f0e9be35","schema_version":"1.0","event_id":"sha256:00d59e02b3a311e274d79a813280883fef1b2770dca85c7c51a6e383f0e9be35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MJO2HHIFGFKU6BUVXCYUGOPQJO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifiability of Undirected Dynamical Networks: a Graph-Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Henk J. van Waarde, M. Kanat Camlibel, Pietro Tesi","submitted_at":"2018-03-14T12:59:46Z","abstract_excerpt":"This paper deals with identifiability of undirected dynamical networks with single-integrator node dynamics. We assume that the graph structure of such networks is known, and aim to find graph-theoretic conditions under which the state matrix of the network can be uniquely identified. As our main contribution, we present a graph coloring condition that ensures identifiability of the network's state matrix. Additionally, we show how the framework can be used to assess identifiability of dynamical networks with general, higher-order node dynamics. As an interesting corollary of our results, we f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05247","kind":"arxiv","version":2},"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:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BrcOrQCGpVnBP6h/caQMKJg3YjAL9Xa7dDDoMIiJO/KSAwmVaN9w2QIVUvMzNOhC07rdwX+fl2ME48RuSP4ZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:47:54.860748Z"},"content_sha256":"36c3c261f2c4db23264915f0888c2a4c42a34c9ab41fd566508bf8abac5a3e4d","schema_version":"1.0","event_id":"sha256:36c3c261f2c4db23264915f0888c2a4c42a34c9ab41fd566508bf8abac5a3e4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/bundle.json","state_url":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/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-28T07:47:54Z","links":{"resolver":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO","bundle":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/bundle.json","state":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MJO2HHIFGFKU6BUVXCYUGOPQJO","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":"514df78661be32d05e974c8020a5c9b9ae01f274f57ac6514d9981f49aa7177c","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-14T12:59:46Z","title_canon_sha256":"e9ec55e43440cf250f5ee8d6e3294e71bfb32e5fbc79c4ac090176e1cc5997e2"},"schema_version":"1.0","source":{"id":"1803.05247","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05247","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05247v2","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05247","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"MJO2HHIFGFKU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MJO2HHIFGFKU6BUV","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MJO2HHIF","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:36c3c261f2c4db23264915f0888c2a4c42a34c9ab41fd566508bf8abac5a3e4d","target":"graph","created_at":"2026-05-18T00:10:10Z","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 deals with identifiability of undirected dynamical networks with single-integrator node dynamics. We assume that the graph structure of such networks is known, and aim to find graph-theoretic conditions under which the state matrix of the network can be uniquely identified. As our main contribution, we present a graph coloring condition that ensures identifiability of the network's state matrix. Additionally, we show how the framework can be used to assess identifiability of dynamical networks with general, higher-order node dynamics. As an interesting corollary of our results, we f","authors_text":"Henk J. van Waarde, M. Kanat Camlibel, Pietro Tesi","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-14T12:59:46Z","title":"Identifiability of Undirected Dynamical Networks: a Graph-Theoretic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05247","kind":"arxiv","version":2},"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:00d59e02b3a311e274d79a813280883fef1b2770dca85c7c51a6e383f0e9be35","target":"record","created_at":"2026-05-18T00:10:10Z","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":"514df78661be32d05e974c8020a5c9b9ae01f274f57ac6514d9981f49aa7177c","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-14T12:59:46Z","title_canon_sha256":"e9ec55e43440cf250f5ee8d6e3294e71bfb32e5fbc79c4ac090176e1cc5997e2"},"schema_version":"1.0","source":{"id":"1803.05247","kind":"arxiv","version":2}},"canonical_sha256":"625da39d0531554f0695b8b14339f04b998f115f02f015229bb393460e1b04b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"625da39d0531554f0695b8b14339f04b998f115f02f015229bb393460e1b04b5","first_computed_at":"2026-05-18T00:10:10.524747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:10.524747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iZs+Pi9d/Akw+AghuKyClBX/klZqhdVRhaBJp984jiKsANrR7+TpHtJcSBlGWh6BQVxdmj0KtjWn7/lXxg2aCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:10.525454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05247","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00d59e02b3a311e274d79a813280883fef1b2770dca85c7c51a6e383f0e9be35","sha256:36c3c261f2c4db23264915f0888c2a4c42a34c9ab41fd566508bf8abac5a3e4d"],"state_sha256":"b1f80ebb27087e116e83498daa28a3c8c2471a88062736fd24ee88e029684bc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ft7lsISYRqAqzU5UKiM1tVgOT4k2czYj86LVEkihfa0ZG8nRIxB8302R9+V5sQw9Tof/aO4oN9aAmO1q4SzdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:47:54.863021Z","bundle_sha256":"413bfc5960fd28277191022230e4b6d0d55fef51c973b6108f8910e17b03f332"}}