{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NL4TXACOTPQBNV75QM7MNYHER5","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":"69c1feb2c54360773c43da37a42f6b89ef1fac3566406b78b9ba3a576d71c6c2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-26T18:58:48Z","title_canon_sha256":"2cfc78746d99ea2753a45edbcf0f678c1c40825d822b24817aa653ba4b52e061"},"schema_version":"1.0","source":{"id":"2409.18220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.18220","created_at":"2026-07-05T09:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"2409.18220v1","created_at":"2026-07-05T09:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.18220","created_at":"2026-07-05T09:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"NL4TXACOTPQB","created_at":"2026-07-05T09:12:32Z"},{"alias_kind":"pith_short_16","alias_value":"NL4TXACOTPQBNV75","created_at":"2026-07-05T09:12:32Z"},{"alias_kind":"pith_short_8","alias_value":"NL4TXACO","created_at":"2026-07-05T09:12:32Z"}],"graph_snapshots":[{"event_id":"sha256:732cfa228a0782205ddf8fdee9cab5b21b9268ec55d595573019e7e140a2abc8","target":"graph","created_at":"2026-07-05T09:12:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.18220/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a graph of order $n$ with eigenvalues $\\lambda_1 \\geq \\cdots \\geq\\lambda_n$. Let \\[s^+(G)=\\sum_{\\lambda_i>0} \\lambda_i^2, \\qquad s^-(G)=\\sum_{\\lambda_i<0} \\lambda_i^2.\\] The smaller value, $s(G)=\\min\\{s^+(G), s^-(G)\\}$ is called the \\emph{square energy} of $G$. In 2016, Elphick, Farber, Goldberg and Wocjan conjectured that for every connected graph $G$ of order $n$, $s(G)\\geq n-1.$ No linear bound for $s(G)$ in terms of $n$ is known. Let $H_1, \\ldots, H_k$ be disjoint vertex-induced subgraphs of $G$. In this note, we prove that \\[s^+(G)\\geq\\sum_{i=1}^{k} s^+(H_i) \\quad \\text{ and } ","authors_text":"Bojan Mohar, Hitesh Kumar, Saieed Akbari, Shivaramakrishna Pragada","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-26T18:58:48Z","title":"A Linear Lower Bound for the Square Energy of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.18220","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:87b7d6e4971957c43ce2ad590bcbad5dfe0ff915ccae87ac003e721591c2b05c","target":"record","created_at":"2026-07-05T09:12:32Z","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":"69c1feb2c54360773c43da37a42f6b89ef1fac3566406b78b9ba3a576d71c6c2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-26T18:58:48Z","title_canon_sha256":"2cfc78746d99ea2753a45edbcf0f678c1c40825d822b24817aa653ba4b52e061"},"schema_version":"1.0","source":{"id":"2409.18220","kind":"arxiv","version":1}},"canonical_sha256":"6af93b804e9be016d7fd833ec6e0e48f635169d9bd4c05e913b0fef21fa1b69a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6af93b804e9be016d7fd833ec6e0e48f635169d9bd4c05e913b0fef21fa1b69a","first_computed_at":"2026-07-05T09:12:32.859834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:12:32.859834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BNfgW8sGqsFEGykCfAWy36BsdkL+sWGmg9dgWDnW21XS03cVZS0TrQx3pT02YMMkrPvcHFE+Z3TwCMUozR3VDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:12:32.860380Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.18220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87b7d6e4971957c43ce2ad590bcbad5dfe0ff915ccae87ac003e721591c2b05c","sha256:732cfa228a0782205ddf8fdee9cab5b21b9268ec55d595573019e7e140a2abc8"],"state_sha256":"a44cabd015328e6db620e6b83142e19f54495f1dee4121b0fedc5dbede0bb36c"}