{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N3HQWNEU6POODZ33WLCOYJ6HGU","short_pith_number":"pith:N3HQWNEU","schema_version":"1.0","canonical_sha256":"6ecf0b3494f3dce1e77bb2c4ec27c735356ab6250b3ee43d9681f08caaf1c1d3","source":{"kind":"arxiv","id":"2607.15941","version":1},"attestation_state":"computed","paper":{"title":"Generalized Nordhaus--Gaddum Inequalities for Eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aiden Williams, Carter Antley, George Brooks, Ian Gonzalez, Joseph Aulenbacher, Linyuan Lu, Luke Hawranick, Sahil Agarwal, William Linz","submitted_at":"2026-07-17T13:24:33Z","abstract_excerpt":"For a graph $G$, let $\n\\lambda_1(G)\\ge \\lambda_2(G)\\ge \\cdots \\ge \\lambda_n(G)$ denote the adjacency eigenvalues of $G$. We investigate the asymptotic maximum of \\[ \\lambda_i(G)+\\lambda_j(\\overline G) \\] for fixed $i$ and $j$. We prove general bounds on $\\lambda_i(G) + \\lambda_{j}(\\overline{G})$ for all pairs $(i, j)$ and also give general bounds on the related problem of minimizing $\\lambda_{n-i+1}(G) + \\lambda_{n-j+1}(\\overline{G})$ for fixed $i$ and $j$. We prove that for all looped graphs $G$ on $n$ vertices, \\[\\lambda_1(G) + \\lambda_2(\\overline{G}) \\le \\frac87 n. \\] Our method also gives "},"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.15941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T13:24:33Z","cross_cats_sorted":[],"title_canon_sha256":"e46e61d9c44b793e125f4395ae6f4a7a45eda8236e5cf953b8bbe00fa4d42659","abstract_canon_sha256":"4b58591bbc827c4ebed76f9465262193043496b403a8393887ae7cbcb4c8cec2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-20T01:19:18.732858Z","signature_b64":"W92iwQDRogaYGDZY0Vu+ZedzE5Y2yhJmlPZ/y1WvdX4K/FVL4LqaByCENz+EkBLzSxk+qfiqnhEN6XVgSd+MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ecf0b3494f3dce1e77bb2c4ec27c735356ab6250b3ee43d9681f08caaf1c1d3","last_reissued_at":"2026-07-20T01:19:18.731933Z","signature_status":"signed_v1","first_computed_at":"2026-07-20T01:19:18.731933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Nordhaus--Gaddum Inequalities for Eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aiden Williams, Carter Antley, George Brooks, Ian Gonzalez, Joseph Aulenbacher, Linyuan Lu, Luke Hawranick, Sahil Agarwal, William Linz","submitted_at":"2026-07-17T13:24:33Z","abstract_excerpt":"For a graph $G$, let $\n\\lambda_1(G)\\ge \\lambda_2(G)\\ge \\cdots \\ge \\lambda_n(G)$ denote the adjacency eigenvalues of $G$. We investigate the asymptotic maximum of \\[ \\lambda_i(G)+\\lambda_j(\\overline G) \\] for fixed $i$ and $j$. We prove general bounds on $\\lambda_i(G) + \\lambda_{j}(\\overline{G})$ for all pairs $(i, j)$ and also give general bounds on the related problem of minimizing $\\lambda_{n-i+1}(G) + \\lambda_{n-j+1}(\\overline{G})$ for fixed $i$ and $j$. We prove that for all looped graphs $G$ on $n$ vertices, \\[\\lambda_1(G) + \\lambda_2(\\overline{G}) \\le \\frac87 n. \\] Our method also gives "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.15941","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.15941/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.15941","created_at":"2026-07-20T01:19:18.732364+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.15941v1","created_at":"2026-07-20T01:19:18.732364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.15941","created_at":"2026-07-20T01:19:18.732364+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3HQWNEU6POO","created_at":"2026-07-20T01:19:18.732364+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3HQWNEU6POODZ33","created_at":"2026-07-20T01:19:18.732364+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3HQWNEU","created_at":"2026-07-20T01:19:18.732364+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.02429","citing_title":"Graph Eigenvalues and Projection Constants","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N3HQWNEU6POODZ33WLCOYJ6HGU","json":"https://pith.science/pith/N3HQWNEU6POODZ33WLCOYJ6HGU.json","graph_json":"https://pith.science/api/pith-number/N3HQWNEU6POODZ33WLCOYJ6HGU/graph.json","events_json":"https://pith.science/api/pith-number/N3HQWNEU6POODZ33WLCOYJ6HGU/events.json","paper":"https://pith.science/paper/N3HQWNEU"},"agent_actions":{"view_html":"https://pith.science/pith/N3HQWNEU6POODZ33WLCOYJ6HGU","download_json":"https://pith.science/pith/N3HQWNEU6POODZ33WLCOYJ6HGU.json","view_paper":"https://pith.science/paper/N3HQWNEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.15941&json=true","fetch_graph":"https://pith.science/api/pith-number/N3HQWNEU6POODZ33WLCOYJ6HGU/graph.json","fetch_events":"https://pith.science/api/pith-number/N3HQWNEU6POODZ33WLCOYJ6HGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3HQWNEU6POODZ33WLCOYJ6HGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3HQWNEU6POODZ33WLCOYJ6HGU/action/storage_attestation","attest_author":"https://pith.science/pith/N3HQWNEU6POODZ33WLCOYJ6HGU/action/author_attestation","sign_citation":"https://pith.science/pith/N3HQWNEU6POODZ33WLCOYJ6HGU/action/citation_signature","submit_replication":"https://pith.science/pith/N3HQWNEU6POODZ33WLCOYJ6HGU/action/replication_record"}},"created_at":"2026-07-20T01:19:18.732364+00:00","updated_at":"2026-07-20T01:19:18.732364+00:00"}