{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2MSEXARN2ZPBI2LUKDO3M66XPJ","short_pith_number":"pith:2MSEXARN","schema_version":"1.0","canonical_sha256":"d3244b822dd65e14697450ddb67bd77a433d02912e6a1c03fa5920bfe0c1a335","source":{"kind":"arxiv","id":"1302.0450","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for leader selection in stochastically forced consensus networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"math.OC","authors_text":"Fu Lin, Makan Fardad, Mihailo R. Jovanovi\\'c","submitted_at":"2013-02-03T03:21:11Z","abstract_excerpt":"We are interested in assigning a pre-specified number of nodes as leaders in order to minimize the mean-square deviation from consensus in stochastically forced networks. This problem arises in several applications including control of vehicular formations and localization in sensor networks. For networks with leaders subject to noise, we show that the Boolean constraints (a node is either a leader or it is not) are the only source of nonconvexity. By relaxing these constraints to their convex hull we obtain a lower bound on the global optimal value. We also use a simple but efficient greedy a"},"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":"1302.0450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-03T03:21:11Z","cross_cats_sorted":["cs.RO","cs.SY"],"title_canon_sha256":"0b462eff0b9face709550a01528ce3b2db93ae506858ad48a9b7b61b1459bba1","abstract_canon_sha256":"a4c614220d463553060812bbb2b72e6bb47de5b1a396825cb45c4c4d20466115"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:38.494569Z","signature_b64":"YhPJAnOOFFwqoA2gWD4kbg4w3nZ+DSeaUKyqCegyhOOK1WsJPya+9VY1IjZNnr8lWKiqKlLBqvhbgbfli6VODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3244b822dd65e14697450ddb67bd77a433d02912e6a1c03fa5920bfe0c1a335","last_reissued_at":"2026-05-18T02:31:38.494011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:38.494011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for leader selection in stochastically forced consensus networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"math.OC","authors_text":"Fu Lin, Makan Fardad, Mihailo R. Jovanovi\\'c","submitted_at":"2013-02-03T03:21:11Z","abstract_excerpt":"We are interested in assigning a pre-specified number of nodes as leaders in order to minimize the mean-square deviation from consensus in stochastically forced networks. This problem arises in several applications including control of vehicular formations and localization in sensor networks. For networks with leaders subject to noise, we show that the Boolean constraints (a node is either a leader or it is not) are the only source of nonconvexity. By relaxing these constraints to their convex hull we obtain a lower bound on the global optimal value. We also use a simple but efficient greedy a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0450","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":"1302.0450","created_at":"2026-05-18T02:31:38.494094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0450v2","created_at":"2026-05-18T02:31:38.494094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0450","created_at":"2026-05-18T02:31:38.494094+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MSEXARN2ZPB","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MSEXARN2ZPBI2LU","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MSEXARN","created_at":"2026-05-18T12:27:32.513160+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/2MSEXARN2ZPBI2LUKDO3M66XPJ","json":"https://pith.science/pith/2MSEXARN2ZPBI2LUKDO3M66XPJ.json","graph_json":"https://pith.science/api/pith-number/2MSEXARN2ZPBI2LUKDO3M66XPJ/graph.json","events_json":"https://pith.science/api/pith-number/2MSEXARN2ZPBI2LUKDO3M66XPJ/events.json","paper":"https://pith.science/paper/2MSEXARN"},"agent_actions":{"view_html":"https://pith.science/pith/2MSEXARN2ZPBI2LUKDO3M66XPJ","download_json":"https://pith.science/pith/2MSEXARN2ZPBI2LUKDO3M66XPJ.json","view_paper":"https://pith.science/paper/2MSEXARN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0450&json=true","fetch_graph":"https://pith.science/api/pith-number/2MSEXARN2ZPBI2LUKDO3M66XPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2MSEXARN2ZPBI2LUKDO3M66XPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MSEXARN2ZPBI2LUKDO3M66XPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MSEXARN2ZPBI2LUKDO3M66XPJ/action/storage_attestation","attest_author":"https://pith.science/pith/2MSEXARN2ZPBI2LUKDO3M66XPJ/action/author_attestation","sign_citation":"https://pith.science/pith/2MSEXARN2ZPBI2LUKDO3M66XPJ/action/citation_signature","submit_replication":"https://pith.science/pith/2MSEXARN2ZPBI2LUKDO3M66XPJ/action/replication_record"}},"created_at":"2026-05-18T02:31:38.494094+00:00","updated_at":"2026-05-18T02:31:38.494094+00:00"}