{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MJO2HHIFGFKU6BUVXCYUGOPQJO","short_pith_number":"pith:MJO2HHIF","schema_version":"1.0","canonical_sha256":"625da39d0531554f0695b8b14339f04b998f115f02f015229bb393460e1b04b5","source":{"kind":"arxiv","id":"1803.05247","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.05247","created_at":"2026-05-18T00:10:10.524862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05247v2","created_at":"2026-05-18T00:10:10.524862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05247","created_at":"2026-05-18T00:10:10.524862+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJO2HHIFGFKU","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJO2HHIFGFKU6BUV","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJO2HHIF","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO","json":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO.json","graph_json":"https://pith.science/api/pith-number/MJO2HHIFGFKU6BUVXCYUGOPQJO/graph.json","events_json":"https://pith.science/api/pith-number/MJO2HHIFGFKU6BUVXCYUGOPQJO/events.json","paper":"https://pith.science/paper/MJO2HHIF"},"agent_actions":{"view_html":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO","download_json":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO.json","view_paper":"https://pith.science/paper/MJO2HHIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05247&json=true","fetch_graph":"https://pith.science/api/pith-number/MJO2HHIFGFKU6BUVXCYUGOPQJO/graph.json","fetch_events":"https://pith.science/api/pith-number/MJO2HHIFGFKU6BUVXCYUGOPQJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/action/storage_attestation","attest_author":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/action/author_attestation","sign_citation":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/action/citation_signature","submit_replication":"https://pith.science/pith/MJO2HHIFGFKU6BUVXCYUGOPQJO/action/replication_record"}},"created_at":"2026-05-18T00:10:10.524862+00:00","updated_at":"2026-05-18T00:10:10.524862+00:00"}