{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IOSY7GY6GAJRZ4EWCJC5XQBLB3","short_pith_number":"pith:IOSY7GY6","schema_version":"1.0","canonical_sha256":"43a58f9b1e30131cf0961245dbc02b0ed82c9f6ff21571be095cfcfa43474d2f","source":{"kind":"arxiv","id":"2607.28168","version":1},"attestation_state":"computed","paper":{"title":"On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Lanhao Zhao","submitted_at":"2026-07-30T13:06:57Z","abstract_excerpt":"The inverse synthesis problem of selecting a minimal leader set to guarantee strong structural controllability (SSC) in matrix-weighted networks remains an unresolved NP-hard challenge. This paper proposes a rigorous mathematical framework to solve this. We prove that structural uncontrollability stems exclusively from dimension-specific reachability isolation and topological symmetry equivalence. To overcome these bottlenecks, we formulate a two-phase synthesis: a reachability prerequisite to identify structural roots, followed by three distinct symmetry-breaking algorithms (Greedy Weisfeiler"},"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":"2607.28168","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-30T13:06:57Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"a9ef816caa5d5890ee65246800433bf0bc5c04d2661e51ff77a5d710e43da4db","abstract_canon_sha256":"020b8ce517a9a6f4a8639f35dfe2816e1e8c38faa06f3794e2f5bb4bfe54c828"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43a58f9b1e30131cf0961245dbc02b0ed82c9f6ff21571be095cfcfa43474d2f","last_reissued_at":"2026-07-31T01:36:10.594465Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:36:10.594465Z"},"graph_snapshot":{"paper":{"title":"On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Lanhao Zhao","submitted_at":"2026-07-30T13:06:57Z","abstract_excerpt":"The inverse synthesis problem of selecting a minimal leader set to guarantee strong structural controllability (SSC) in matrix-weighted networks remains an unresolved NP-hard challenge. This paper proposes a rigorous mathematical framework to solve this. We prove that structural uncontrollability stems exclusively from dimension-specific reachability isolation and topological symmetry equivalence. To overcome these bottlenecks, we formulate a two-phase synthesis: a reachability prerequisite to identify structural roots, followed by three distinct symmetry-breaking algorithms (Greedy Weisfeiler"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28168","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.28168/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.28168","created_at":"2026-07-31T01:36:10.597657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28168v1","created_at":"2026-07-31T01:36:10.597657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28168","created_at":"2026-07-31T01:36:10.597657+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOSY7GY6GAJR","created_at":"2026-07-31T01:36:10.597657+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOSY7GY6GAJRZ4EW","created_at":"2026-07-31T01:36:10.597657+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOSY7GY6","created_at":"2026-07-31T01:36:10.597657+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/IOSY7GY6GAJRZ4EWCJC5XQBLB3","json":"https://pith.science/pith/IOSY7GY6GAJRZ4EWCJC5XQBLB3.json","graph_json":"https://pith.science/api/pith-number/IOSY7GY6GAJRZ4EWCJC5XQBLB3/graph.json","events_json":"https://pith.science/api/pith-number/IOSY7GY6GAJRZ4EWCJC5XQBLB3/events.json","paper":"https://pith.science/paper/IOSY7GY6"},"agent_actions":{"view_html":"https://pith.science/pith/IOSY7GY6GAJRZ4EWCJC5XQBLB3","download_json":"https://pith.science/pith/IOSY7GY6GAJRZ4EWCJC5XQBLB3.json","view_paper":"https://pith.science/paper/IOSY7GY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28168&json=true","fetch_graph":"https://pith.science/api/pith-number/IOSY7GY6GAJRZ4EWCJC5XQBLB3/graph.json","fetch_events":"https://pith.science/api/pith-number/IOSY7GY6GAJRZ4EWCJC5XQBLB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOSY7GY6GAJRZ4EWCJC5XQBLB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOSY7GY6GAJRZ4EWCJC5XQBLB3/action/storage_attestation","attest_author":"https://pith.science/pith/IOSY7GY6GAJRZ4EWCJC5XQBLB3/action/author_attestation","sign_citation":"https://pith.science/pith/IOSY7GY6GAJRZ4EWCJC5XQBLB3/action/citation_signature","submit_replication":"https://pith.science/pith/IOSY7GY6GAJRZ4EWCJC5XQBLB3/action/replication_record"}},"created_at":"2026-07-31T01:36:10.597657+00:00","updated_at":"2026-07-31T01:36:10.597657+00:00"}