{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NQSQRCZLFBJGXXV2NCMMHIVTLY","short_pith_number":"pith:NQSQRCZL","canonical_record":{"source":{"id":"1709.02212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-07T12:47:15Z","cross_cats_sorted":[],"title_canon_sha256":"1d984677ea56907566b7386def6741633cee8d2177d7251dd692dc8458847722","abstract_canon_sha256":"9dcc394bd640de55758bd20348fd36cbe425e9451fdb71d42fd635df9c479a66"},"schema_version":"1.0"},"canonical_sha256":"6c25088b2b28526bdeba6898c3a2b35e068cb46a912a934904b00a1b2e5e79a8","source":{"kind":"arxiv","id":"1709.02212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02212","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02212v1","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02212","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"pith_short_12","alias_value":"NQSQRCZLFBJG","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NQSQRCZLFBJGXXV2","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NQSQRCZL","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NQSQRCZLFBJGXXV2NCMMHIVTLY","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-07T12:47:15Z","cross_cats_sorted":[],"title_canon_sha256":"1d984677ea56907566b7386def6741633cee8d2177d7251dd692dc8458847722","abstract_canon_sha256":"9dcc394bd640de55758bd20348fd36cbe425e9451fdb71d42fd635df9c479a66"},"schema_version":"1.0"},"canonical_sha256":"6c25088b2b28526bdeba6898c3a2b35e068cb46a912a934904b00a1b2e5e79a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:49.852533Z","signature_b64":"17e7iw36yRyUN3na6eYdSZMYdRv3sDU3USOkiMzp1i4qvtkK9dn63MZuiqk4JXkQqMkyNOK3TmXejAQg3JykAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c25088b2b28526bdeba6898c3a2b35e068cb46a912a934904b00a1b2e5e79a8","last_reissued_at":"2026-05-18T00:35:49.851881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:49.851881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02212","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-18T00:35:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAWJMtra/Go+KzlVuFiNJeNj60zM6gDDhLgM7F5MiRTYSk4j56S0ZOWM+F2ttT3RGV0/SGjVU9FjgscohF+iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:10:14.062621Z"},"content_sha256":"e20d7dbc0eae3c059773cfc7f4fad68505b94ec7286a8c1300ffa587d4af92fa","schema_version":"1.0","event_id":"sha256:e20d7dbc0eae3c059773cfc7f4fad68505b94ec7286a8c1300ffa587d4af92fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NQSQRCZLFBJGXXV2NCMMHIVTLY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing the Smallest Eigenvalue of a Symmetric Matrix: A Submodular Optimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Andrew Clark, Linda Bushnell, Qiqiang Hou, Radha Poovendran","submitted_at":"2017-09-07T12:47:15Z","abstract_excerpt":"This paper studies the problem of selecting a submatrix of a positive definite matrix in order to achieve a desired bound on the smallest eigenvalue of the submatrix. Maximizing this smallest eigenvalue has applications to selecting input nodes in order to guarantee consensus of networks with negative edges as well as maximizing the convergence rate of distributed systems. We develop a submodular optimization approach to maximizing the smallest eigenvalue by first proving that positivity of the eigenvalues of a submatrix can be characterized using the probability distribution of the quadratic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02212","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-18T00:35:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rO40dZgswlFemweOXkjIVAp/EEo5TRyW0ZyMkO8GEVHWjytsFc3gs05cMMBqa4dliNVSDpU0xyh0mxnVTHvWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:10:14.062963Z"},"content_sha256":"acf72e99510b6df355f695dfe6bdc1497a02f742e7b73b155e117e806b98b60d","schema_version":"1.0","event_id":"sha256:acf72e99510b6df355f695dfe6bdc1497a02f742e7b73b155e117e806b98b60d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQSQRCZLFBJGXXV2NCMMHIVTLY/bundle.json","state_url":"https://pith.science/pith/NQSQRCZLFBJGXXV2NCMMHIVTLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQSQRCZLFBJGXXV2NCMMHIVTLY/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-10T20:10:14Z","links":{"resolver":"https://pith.science/pith/NQSQRCZLFBJGXXV2NCMMHIVTLY","bundle":"https://pith.science/pith/NQSQRCZLFBJGXXV2NCMMHIVTLY/bundle.json","state":"https://pith.science/pith/NQSQRCZLFBJGXXV2NCMMHIVTLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQSQRCZLFBJGXXV2NCMMHIVTLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NQSQRCZLFBJGXXV2NCMMHIVTLY","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":"9dcc394bd640de55758bd20348fd36cbe425e9451fdb71d42fd635df9c479a66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-07T12:47:15Z","title_canon_sha256":"1d984677ea56907566b7386def6741633cee8d2177d7251dd692dc8458847722"},"schema_version":"1.0","source":{"id":"1709.02212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02212","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02212v1","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02212","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"pith_short_12","alias_value":"NQSQRCZLFBJG","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NQSQRCZLFBJGXXV2","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NQSQRCZL","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:acf72e99510b6df355f695dfe6bdc1497a02f742e7b73b155e117e806b98b60d","target":"graph","created_at":"2026-05-18T00:35:49Z","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":"This paper studies the problem of selecting a submatrix of a positive definite matrix in order to achieve a desired bound on the smallest eigenvalue of the submatrix. Maximizing this smallest eigenvalue has applications to selecting input nodes in order to guarantee consensus of networks with negative edges as well as maximizing the convergence rate of distributed systems. We develop a submodular optimization approach to maximizing the smallest eigenvalue by first proving that positivity of the eigenvalues of a submatrix can be characterized using the probability distribution of the quadratic ","authors_text":"Andrew Clark, Linda Bushnell, Qiqiang Hou, Radha Poovendran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-07T12:47:15Z","title":"Maximizing the Smallest Eigenvalue of a Symmetric Matrix: A Submodular Optimization Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02212","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:e20d7dbc0eae3c059773cfc7f4fad68505b94ec7286a8c1300ffa587d4af92fa","target":"record","created_at":"2026-05-18T00:35:49Z","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":"9dcc394bd640de55758bd20348fd36cbe425e9451fdb71d42fd635df9c479a66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-07T12:47:15Z","title_canon_sha256":"1d984677ea56907566b7386def6741633cee8d2177d7251dd692dc8458847722"},"schema_version":"1.0","source":{"id":"1709.02212","kind":"arxiv","version":1}},"canonical_sha256":"6c25088b2b28526bdeba6898c3a2b35e068cb46a912a934904b00a1b2e5e79a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c25088b2b28526bdeba6898c3a2b35e068cb46a912a934904b00a1b2e5e79a8","first_computed_at":"2026-05-18T00:35:49.851881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:49.851881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"17e7iw36yRyUN3na6eYdSZMYdRv3sDU3USOkiMzp1i4qvtkK9dn63MZuiqk4JXkQqMkyNOK3TmXejAQg3JykAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:49.852533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e20d7dbc0eae3c059773cfc7f4fad68505b94ec7286a8c1300ffa587d4af92fa","sha256:acf72e99510b6df355f695dfe6bdc1497a02f742e7b73b155e117e806b98b60d"],"state_sha256":"bb476e953ff568bfce349214674bb9a8f5f774995425f348c1ff5bc402316b7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oPEI7eBECYeXwF9/Usj2X2ygTyMYK7zVfSIeva3xok80ZnXb1EFmewBTlCStG7Wkej8QB0Rh9uA814onn7wgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:10:14.064943Z","bundle_sha256":"2e11b8d391447998512a337fe6b11d466f207343aafbf5c15d6f15abb40fce85"}}