{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:W7TUAB675KMWQXHMENV3H4AMAS","short_pith_number":"pith:W7TUAB67","canonical_record":{"source":{"id":"1412.6595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-20T04:09:31Z","cross_cats_sorted":["cs.DS","cs.SY"],"title_canon_sha256":"bdc2f1152572d89c8d3c2b141c52c7e11f4a837438d1b311a74cec361480c4be","abstract_canon_sha256":"4a18601932e40e82593ec03f7f9f3f4ccff43ec9eb1baeb174d7960350cec434"},"schema_version":"1.0"},"canonical_sha256":"b7e74007dfea99685cec236bb3f00c048fcba1bcc587f39792c929a49765b970","source":{"kind":"arxiv","id":"1412.6595","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6595","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6595v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6595","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"W7TUAB675KMW","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W7TUAB675KMWQXHM","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W7TUAB67","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:W7TUAB675KMWQXHMENV3H4AMAS","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-20T04:09:31Z","cross_cats_sorted":["cs.DS","cs.SY"],"title_canon_sha256":"bdc2f1152572d89c8d3c2b141c52c7e11f4a837438d1b311a74cec361480c4be","abstract_canon_sha256":"4a18601932e40e82593ec03f7f9f3f4ccff43ec9eb1baeb174d7960350cec434"},"schema_version":"1.0"},"canonical_sha256":"b7e74007dfea99685cec236bb3f00c048fcba1bcc587f39792c929a49765b970","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:46.548285Z","signature_b64":"d8Ne6JN6iQC95Z3E46+5Bc3EeTdjMAwR7mxMreawwsy0nmg2r/NtwQqX8uFM5584zI2uAfDg+JFIcRqJPuQiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7e74007dfea99685cec236bb3f00c048fcba1bcc587f39792c929a49765b970","last_reissued_at":"2026-05-18T02:30:46.547876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:46.547876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6595","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2q5EWNW4+d5sd5ufa1621A31uc1lXpRyTr27NKN8PvZ9hgZLlp9LiB/YDzVoLJokBrx9Sty0CsS+bkgSQvTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:46:33.819882Z"},"content_sha256":"87e1e88e2249a5cbad3e26d1a17084bd6fd6d3e87f3bfce06133fefdc8b4853c","schema_version":"1.0","event_id":"sha256:87e1e88e2249a5cbad3e26d1a17084bd6fd6d3e87f3bfce06133fefdc8b4853c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:W7TUAB675KMWQXHMENV3H4AMAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient, Optimal $k$-Leader Selection for Coherent, One-Dimensional Formations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SY"],"primary_cat":"math.OC","authors_text":"Kirill Dyagilev, Neil McGlohon, Stacy Patterson","submitted_at":"2014-12-20T04:09:31Z","abstract_excerpt":"We study the problem of optimal leader selection in consensus networks with noisy relative information. The objective is to identify the set of $k$ leaders that minimizes the formation's deviation from the desired trajectory established by the leaders. An optimal leader set can be found by an exhaustive search over all possible leader sets; however, this approach is not scalable to large networks. In recent years, several works have proposed approximation algorithms to the $k$-leader selection problem, yet the question of whether there exists an efficient, non-combinatorial method to identify "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6595","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p1b2DhjG5MWAucYYQlzaKQx8rZyXWoYkK0RxdW/hfcGVIZFH50i13DCUmFKltoFCimn1nX0Jm7Io608xUMmyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:46:33.820437Z"},"content_sha256":"460de40b5189e76addcea90e1a6fb5f7abdb4d421f691c9a1ab776b0459bfd0c","schema_version":"1.0","event_id":"sha256:460de40b5189e76addcea90e1a6fb5f7abdb4d421f691c9a1ab776b0459bfd0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7TUAB675KMWQXHMENV3H4AMAS/bundle.json","state_url":"https://pith.science/pith/W7TUAB675KMWQXHMENV3H4AMAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7TUAB675KMWQXHMENV3H4AMAS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T09:46:33Z","links":{"resolver":"https://pith.science/pith/W7TUAB675KMWQXHMENV3H4AMAS","bundle":"https://pith.science/pith/W7TUAB675KMWQXHMENV3H4AMAS/bundle.json","state":"https://pith.science/pith/W7TUAB675KMWQXHMENV3H4AMAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7TUAB675KMWQXHMENV3H4AMAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W7TUAB675KMWQXHMENV3H4AMAS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4a18601932e40e82593ec03f7f9f3f4ccff43ec9eb1baeb174d7960350cec434","cross_cats_sorted":["cs.DS","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-20T04:09:31Z","title_canon_sha256":"bdc2f1152572d89c8d3c2b141c52c7e11f4a837438d1b311a74cec361480c4be"},"schema_version":"1.0","source":{"id":"1412.6595","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6595","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6595v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6595","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"W7TUAB675KMW","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W7TUAB675KMWQXHM","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W7TUAB67","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:460de40b5189e76addcea90e1a6fb5f7abdb4d421f691c9a1ab776b0459bfd0c","target":"graph","created_at":"2026-05-18T02:30:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the problem of optimal leader selection in consensus networks with noisy relative information. The objective is to identify the set of $k$ leaders that minimizes the formation's deviation from the desired trajectory established by the leaders. An optimal leader set can be found by an exhaustive search over all possible leader sets; however, this approach is not scalable to large networks. In recent years, several works have proposed approximation algorithms to the $k$-leader selection problem, yet the question of whether there exists an efficient, non-combinatorial method to identify ","authors_text":"Kirill Dyagilev, Neil McGlohon, Stacy Patterson","cross_cats":["cs.DS","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-20T04:09:31Z","title":"Efficient, Optimal $k$-Leader Selection for Coherent, One-Dimensional Formations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6595","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:87e1e88e2249a5cbad3e26d1a17084bd6fd6d3e87f3bfce06133fefdc8b4853c","target":"record","created_at":"2026-05-18T02:30:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4a18601932e40e82593ec03f7f9f3f4ccff43ec9eb1baeb174d7960350cec434","cross_cats_sorted":["cs.DS","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-20T04:09:31Z","title_canon_sha256":"bdc2f1152572d89c8d3c2b141c52c7e11f4a837438d1b311a74cec361480c4be"},"schema_version":"1.0","source":{"id":"1412.6595","kind":"arxiv","version":1}},"canonical_sha256":"b7e74007dfea99685cec236bb3f00c048fcba1bcc587f39792c929a49765b970","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7e74007dfea99685cec236bb3f00c048fcba1bcc587f39792c929a49765b970","first_computed_at":"2026-05-18T02:30:46.547876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:46.547876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d8Ne6JN6iQC95Z3E46+5Bc3EeTdjMAwR7mxMreawwsy0nmg2r/NtwQqX8uFM5584zI2uAfDg+JFIcRqJPuQiCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:46.548285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6595","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87e1e88e2249a5cbad3e26d1a17084bd6fd6d3e87f3bfce06133fefdc8b4853c","sha256:460de40b5189e76addcea90e1a6fb5f7abdb4d421f691c9a1ab776b0459bfd0c"],"state_sha256":"cad3c2b0437ab862fd4cb15e4698142dc4eae752cba28d1da052eb034c077ab8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BdacMGXgtti6Th5FrwD6nzYRvDan5Ly7z2/pYK3sSgB6+IZmIHRV0f6eI6lV8IXnvXCahwkEaWNynDjWLQbvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:46:33.823433Z","bundle_sha256":"099842111c327969467f6ac243e0cd41734f1589cdd5ebf494a00b70254287e1"}}