{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MKYQP4RAQRUJ6PC2FXQEQ7RTN7","short_pith_number":"pith:MKYQP4RA","schema_version":"1.0","canonical_sha256":"62b107f22084689f3c5a2de0487e336fce4828d1d2e7736f9e8407e46fbc96d8","source":{"kind":"arxiv","id":"1307.2642","version":2},"attestation_state":"computed","paper":{"title":"Structure controllability of complex network based on preferential matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.MP","physics.soc-ph"],"primary_cat":"math-ph","authors_text":"Bin Zhang, Tianyang Lv, Xizhe Zhang, Xueying Yang","submitted_at":"2013-07-10T01:23:50Z","abstract_excerpt":"Minimum driver node sets (MDSs) play an important role in studying the structural controllability of complex networks. Recent research has shown that MDSs tend to avoid high-degree nodes. However, this observation is based on the analysis of a small number of MDSs, because enumerating all of the MDSs of a network is a #P problem. Therefore, past research has not been sufficient to arrive at a convincing conclusion. In this paper, first, we propose a preferential matching algorithm to find MDSs that have a specific degree property. Then, we show that the MDSs obtained by preferential matching c"},"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":"1307.2642","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2013-07-10T01:23:50Z","cross_cats_sorted":["cs.SI","math.MP","physics.soc-ph"],"title_canon_sha256":"ee03775d0b0eaa53fc43387e5e1b86e60e0bcdc19a93111ff225768ed21494c5","abstract_canon_sha256":"b85b0c3fb74b5b534201863501640a937a805f86eb1cfcd20cb590ec91bf1b9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:52.564277Z","signature_b64":"DB0u9uu/433ESLjECQqT5Y+tPk0p7xlzScyaQHYyrJMUugIsL0jifPkVQUtou7MbBYmBowndRVuNV4BbSxx/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62b107f22084689f3c5a2de0487e336fce4828d1d2e7736f9e8407e46fbc96d8","last_reissued_at":"2026-05-18T01:48:52.563604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:52.563604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure controllability of complex network based on preferential matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.MP","physics.soc-ph"],"primary_cat":"math-ph","authors_text":"Bin Zhang, Tianyang Lv, Xizhe Zhang, Xueying Yang","submitted_at":"2013-07-10T01:23:50Z","abstract_excerpt":"Minimum driver node sets (MDSs) play an important role in studying the structural controllability of complex networks. Recent research has shown that MDSs tend to avoid high-degree nodes. However, this observation is based on the analysis of a small number of MDSs, because enumerating all of the MDSs of a network is a #P problem. Therefore, past research has not been sufficient to arrive at a convincing conclusion. In this paper, first, we propose a preferential matching algorithm to find MDSs that have a specific degree property. Then, we show that the MDSs obtained by preferential matching c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2642","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":"1307.2642","created_at":"2026-05-18T01:48:52.563706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2642v2","created_at":"2026-05-18T01:48:52.563706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2642","created_at":"2026-05-18T01:48:52.563706+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKYQP4RAQRUJ","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKYQP4RAQRUJ6PC2","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKYQP4RA","created_at":"2026-05-18T12:27:52.871228+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/MKYQP4RAQRUJ6PC2FXQEQ7RTN7","json":"https://pith.science/pith/MKYQP4RAQRUJ6PC2FXQEQ7RTN7.json","graph_json":"https://pith.science/api/pith-number/MKYQP4RAQRUJ6PC2FXQEQ7RTN7/graph.json","events_json":"https://pith.science/api/pith-number/MKYQP4RAQRUJ6PC2FXQEQ7RTN7/events.json","paper":"https://pith.science/paper/MKYQP4RA"},"agent_actions":{"view_html":"https://pith.science/pith/MKYQP4RAQRUJ6PC2FXQEQ7RTN7","download_json":"https://pith.science/pith/MKYQP4RAQRUJ6PC2FXQEQ7RTN7.json","view_paper":"https://pith.science/paper/MKYQP4RA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2642&json=true","fetch_graph":"https://pith.science/api/pith-number/MKYQP4RAQRUJ6PC2FXQEQ7RTN7/graph.json","fetch_events":"https://pith.science/api/pith-number/MKYQP4RAQRUJ6PC2FXQEQ7RTN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKYQP4RAQRUJ6PC2FXQEQ7RTN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKYQP4RAQRUJ6PC2FXQEQ7RTN7/action/storage_attestation","attest_author":"https://pith.science/pith/MKYQP4RAQRUJ6PC2FXQEQ7RTN7/action/author_attestation","sign_citation":"https://pith.science/pith/MKYQP4RAQRUJ6PC2FXQEQ7RTN7/action/citation_signature","submit_replication":"https://pith.science/pith/MKYQP4RAQRUJ6PC2FXQEQ7RTN7/action/replication_record"}},"created_at":"2026-05-18T01:48:52.563706+00:00","updated_at":"2026-05-18T01:48:52.563706+00:00"}