{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EAEEXEHD6RYXW2F2X5C67GRB22","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":"f8712c681a6c55805aa3b2c7ea3b45bfa9fbfd2e2d01d2d79b0e5ce5a1c7a402","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-03T16:09:48Z","title_canon_sha256":"eeb3f6efd5e63d3d16a8fd178bf557aec27f5da9ab4c0adce50769ad01da87e5"},"schema_version":"1.0","source":{"id":"2608.02429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.02429","created_at":"2026-08-04T02:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"2608.02429v1","created_at":"2026-08-04T02:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02429","created_at":"2026-08-04T02:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"EAEEXEHD6RYX","created_at":"2026-08-04T02:43:28Z"},{"alias_kind":"pith_short_16","alias_value":"EAEEXEHD6RYXW2F2","created_at":"2026-08-04T02:43:28Z"},{"alias_kind":"pith_short_8","alias_value":"EAEEXEHD","created_at":"2026-08-04T02:43:28Z"}],"graph_snapshots":[{"event_id":"sha256:febad7a862b7d48f6a61512c8bb70891fb1f3eaf6e7c0ca7478aa8c88cb9727a","target":"graph","created_at":"2026-08-04T02:43:28Z","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/2608.02429/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For an integer $k\\ge2$, let $\\lambda_k(G)$ denote the $k$th largest adjacency eigenvalue of a graph $G$. For every graph $G$ on $n$ vertices and every $2 \\leq k \\leq n$, we prove \\[ \\lambda_k(G) \\le \\frac{(k-2)\\sqrt{k+1}+2}{2k(k-1)}\\,n-1. \\] Our bound is tight for $k\\in\\{2,3,4,8,24\\}$. We obtain it by reducing the graph-eigenvalue problem to an extremal problem for orthogonal projections and then applying the general upper bound on the absolute projection constant $\\gamma(r)$ due to Der\\k{e}gowska and Lewandowska. We also give an alternative proof of their bound by repairing the Gegenbauer-pol","authors_text":"Quanyu Tang, Tanay Wakhare, Varun Sivashankar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-03T16:09:48Z","title":"Graph Eigenvalues and Projection Constants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02429","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:867df2b51c56284e702d5bcd55b4f8ad588cd37b33bcbb5cb62808d852579f4a","target":"record","created_at":"2026-08-04T02:43:28Z","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":"f8712c681a6c55805aa3b2c7ea3b45bfa9fbfd2e2d01d2d79b0e5ce5a1c7a402","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-03T16:09:48Z","title_canon_sha256":"eeb3f6efd5e63d3d16a8fd178bf557aec27f5da9ab4c0adce50769ad01da87e5"},"schema_version":"1.0","source":{"id":"2608.02429","kind":"arxiv","version":1}},"canonical_sha256":"20084b90e3f4717b68babf45ef9a21d6809e264d4d7971f8f81dc53da90d10d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20084b90e3f4717b68babf45ef9a21d6809e264d4d7971f8f81dc53da90d10d3","first_computed_at":"2026-08-04T02:43:28.711215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T02:43:28.711215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GFbY/tFeABKeD9WGY02CPdz4OjR+aTIpQy+aLReeSe2k83IcQeZL6KRS9oPLB5dnPTG2wKTrZG1DCj2/ARxmCA==","signature_status":"signed_v1","signed_at":"2026-08-04T02:43:28.714078Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.02429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:867df2b51c56284e702d5bcd55b4f8ad588cd37b33bcbb5cb62808d852579f4a","sha256:febad7a862b7d48f6a61512c8bb70891fb1f3eaf6e7c0ca7478aa8c88cb9727a"],"state_sha256":"b0f28f5ad70538bff4eeaea29ac7f7e4da486e103ba40b6177fdf5a16e14a2ca"}