{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NVYA3RUXPPP2FW6A4LREE6XJPH","short_pith_number":"pith:NVYA3RUX","schema_version":"1.0","canonical_sha256":"6d700dc6977bdfa2dbc0e2e2427ae979d05c40d09bb80fa8e408e737fdb18ff1","source":{"kind":"arxiv","id":"2311.07629","version":2},"attestation_state":"computed","paper":{"title":"Note on the second eigenvalue of regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Eero R\\\"aty, Igor Balla, Istv\\'an Tomon","submitted_at":"2023-11-13T09:11:02Z","abstract_excerpt":"The goal of this expository note is to give a short, self-contained proof of nearly optimal lower bounds for the second largest eigenvalue of the adjacency matrix of regular graphs."},"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":"2311.07629","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-13T09:11:02Z","cross_cats_sorted":[],"title_canon_sha256":"018254b2ac37e63216dcd1584e4788c4c1de2b773b41329cdedfebe1bc840664","abstract_canon_sha256":"ac93f5aa11cb9d57c717e88108c428e97f5f5177ed5201887b7055d525e2ccc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:58.864127Z","signature_b64":"3tgqeEEqernOOMvRqwyTKoy1vUN+fiqPgBCo+EqhFE/ANy4Y45urreGwynIdd4wDRPu60xDGACcuuHK4SefPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d700dc6977bdfa2dbc0e2e2427ae979d05c40d09bb80fa8e408e737fdb18ff1","last_reissued_at":"2026-07-05T07:14:58.863657Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:58.863657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Note on the second eigenvalue of regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Eero R\\\"aty, Igor Balla, Istv\\'an Tomon","submitted_at":"2023-11-13T09:11:02Z","abstract_excerpt":"The goal of this expository note is to give a short, self-contained proof of nearly optimal lower bounds for the second largest eigenvalue of the adjacency matrix of regular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.07629","kind":"arxiv","version":2},"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/2311.07629/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":"2311.07629","created_at":"2026-07-05T07:14:58.863726+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.07629v2","created_at":"2026-07-05T07:14:58.863726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.07629","created_at":"2026-07-05T07:14:58.863726+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVYA3RUXPPP2","created_at":"2026-07-05T07:14:58.863726+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVYA3RUXPPP2FW6A","created_at":"2026-07-05T07:14:58.863726+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVYA3RUX","created_at":"2026-07-05T07:14:58.863726+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10037","citing_title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVYA3RUXPPP2FW6A4LREE6XJPH","json":"https://pith.science/pith/NVYA3RUXPPP2FW6A4LREE6XJPH.json","graph_json":"https://pith.science/api/pith-number/NVYA3RUXPPP2FW6A4LREE6XJPH/graph.json","events_json":"https://pith.science/api/pith-number/NVYA3RUXPPP2FW6A4LREE6XJPH/events.json","paper":"https://pith.science/paper/NVYA3RUX"},"agent_actions":{"view_html":"https://pith.science/pith/NVYA3RUXPPP2FW6A4LREE6XJPH","download_json":"https://pith.science/pith/NVYA3RUXPPP2FW6A4LREE6XJPH.json","view_paper":"https://pith.science/paper/NVYA3RUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.07629&json=true","fetch_graph":"https://pith.science/api/pith-number/NVYA3RUXPPP2FW6A4LREE6XJPH/graph.json","fetch_events":"https://pith.science/api/pith-number/NVYA3RUXPPP2FW6A4LREE6XJPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVYA3RUXPPP2FW6A4LREE6XJPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVYA3RUXPPP2FW6A4LREE6XJPH/action/storage_attestation","attest_author":"https://pith.science/pith/NVYA3RUXPPP2FW6A4LREE6XJPH/action/author_attestation","sign_citation":"https://pith.science/pith/NVYA3RUXPPP2FW6A4LREE6XJPH/action/citation_signature","submit_replication":"https://pith.science/pith/NVYA3RUXPPP2FW6A4LREE6XJPH/action/replication_record"}},"created_at":"2026-07-05T07:14:58.863726+00:00","updated_at":"2026-07-05T07:14:58.863726+00:00"}