{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CBRXYSAKAX5YDEUWC3TGVU3RFJ","short_pith_number":"pith:CBRXYSAK","schema_version":"1.0","canonical_sha256":"10637c480a05fb81929616e66ad3712a4ad58a18a6cef8a8d708ae998e2d00e0","source":{"kind":"arxiv","id":"1802.04022","version":1},"attestation_state":"computed","paper":{"title":"Controllability Analysis of Threshold Graphs and Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mehran Mesbahi, Mohammad Haeri, Shima Sadat Mousavi","submitted_at":"2018-02-12T13:07:33Z","abstract_excerpt":"In this paper, we investigate the controllability of a linear time-invariant network following a Laplacian dynamics defined on a threshold graph. In this direction, an algorithm for deriving the modal matrix associated with the Laplacian matrix for this class of graphs is presented. Then, based on the Popov-Belevitch-Hautus criteria, a procedure for the selection of control nodes is proposed. The procedure involves partitioning the nodes of the graph into cells with the same degree; one node from each cell is then selected. We show that the remaining nodes can be chosen as the control nodes re"},"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":"1802.04022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-12T13:07:33Z","cross_cats_sorted":[],"title_canon_sha256":"4213cb32ca300ecee39577185030449a9fa7d144c46ff2c179f213898b1395e4","abstract_canon_sha256":"4f2f689f865ef54c4f3a2af4fe67ac8164b3895df90306f6369ab81c3424b3e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:06.779483Z","signature_b64":"if9AgZLXis/6I3uZOv28qv3uf0Ug8ChLzNrwej60u3KGa4eFUqnVZQNNlNCoC0MepnME5TlF19kODutAu2SICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10637c480a05fb81929616e66ad3712a4ad58a18a6cef8a8d708ae998e2d00e0","last_reissued_at":"2026-05-17T23:48:06.779060Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:06.779060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Controllability Analysis of Threshold Graphs and Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mehran Mesbahi, Mohammad Haeri, Shima Sadat Mousavi","submitted_at":"2018-02-12T13:07:33Z","abstract_excerpt":"In this paper, we investigate the controllability of a linear time-invariant network following a Laplacian dynamics defined on a threshold graph. In this direction, an algorithm for deriving the modal matrix associated with the Laplacian matrix for this class of graphs is presented. Then, based on the Popov-Belevitch-Hautus criteria, a procedure for the selection of control nodes is proposed. The procedure involves partitioning the nodes of the graph into cells with the same degree; one node from each cell is then selected. We show that the remaining nodes can be chosen as the control nodes re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04022","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.04022","created_at":"2026-05-17T23:48:06.779129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04022v1","created_at":"2026-05-17T23:48:06.779129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04022","created_at":"2026-05-17T23:48:06.779129+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBRXYSAKAX5Y","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBRXYSAKAX5YDEUW","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBRXYSAK","created_at":"2026-05-18T12:32:16.446611+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/CBRXYSAKAX5YDEUWC3TGVU3RFJ","json":"https://pith.science/pith/CBRXYSAKAX5YDEUWC3TGVU3RFJ.json","graph_json":"https://pith.science/api/pith-number/CBRXYSAKAX5YDEUWC3TGVU3RFJ/graph.json","events_json":"https://pith.science/api/pith-number/CBRXYSAKAX5YDEUWC3TGVU3RFJ/events.json","paper":"https://pith.science/paper/CBRXYSAK"},"agent_actions":{"view_html":"https://pith.science/pith/CBRXYSAKAX5YDEUWC3TGVU3RFJ","download_json":"https://pith.science/pith/CBRXYSAKAX5YDEUWC3TGVU3RFJ.json","view_paper":"https://pith.science/paper/CBRXYSAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04022&json=true","fetch_graph":"https://pith.science/api/pith-number/CBRXYSAKAX5YDEUWC3TGVU3RFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CBRXYSAKAX5YDEUWC3TGVU3RFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBRXYSAKAX5YDEUWC3TGVU3RFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBRXYSAKAX5YDEUWC3TGVU3RFJ/action/storage_attestation","attest_author":"https://pith.science/pith/CBRXYSAKAX5YDEUWC3TGVU3RFJ/action/author_attestation","sign_citation":"https://pith.science/pith/CBRXYSAKAX5YDEUWC3TGVU3RFJ/action/citation_signature","submit_replication":"https://pith.science/pith/CBRXYSAKAX5YDEUWC3TGVU3RFJ/action/replication_record"}},"created_at":"2026-05-17T23:48:06.779129+00:00","updated_at":"2026-05-17T23:48:06.779129+00:00"}