{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DMZMBSISANUU24T5VGH3ZABFCA","short_pith_number":"pith:DMZMBSIS","schema_version":"1.0","canonical_sha256":"1b32c0c91203694d727da98fbc80251012776ba5a2a9fe0d0b92f9f81120ba96","source":{"kind":"arxiv","id":"2606.11659","version":1},"attestation_state":"computed","paper":{"title":"Krahn-Szeg\\H o type inequalities for graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG","math.SP"],"primary_cat":"math.CO","authors_text":"Huiqiu Lin, Lianping Liu, Xilong Yin, Zhe You","submitted_at":"2026-06-10T04:53:20Z","abstract_excerpt":"We study discrete analogues of classical spectral geometric inequalities and extremal eigenvalue problems on graphs. The well-known Krahn--Szeg\\H{o} inequality states that the minimum of $\\lambda_2(\\Omega)$ among bounded open sets of $\\mathbb{R}^n$ with given volume is achieved by the union of two identical balls $\\mathbb{R}^n$. Firstly, we establish a Krahn--Szeg\\H{o} type inequality for trees. For trees with a fixed number of interior vertices and boundary leaves, we completely characterize the extremal structures that minimize the second Dirichlet eigenvalue. Secondly, we develop a nodal do"},"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":"2606.11659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T04:53:20Z","cross_cats_sorted":["math.DG","math.SP"],"title_canon_sha256":"8a302a73f103a822607640078bcc1a94c8a056d50a747c8083408338f4f78207","abstract_canon_sha256":"c3dd42a22a1a52194cbae1fde153c8751b8cd288c631b1d7a7b3691332b02f3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:01.398368Z","signature_b64":"hCVRNZfYs6CAJUn+2G7vxRqRPwrD0ZZbWt+zJHsr5UY9LxljoWhCQMPxjyGg8hDijtH2xuxIzNVPDU6hH6aUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b32c0c91203694d727da98fbc80251012776ba5a2a9fe0d0b92f9f81120ba96","last_reissued_at":"2026-06-11T01:10:01.397624Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:01.397624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Krahn-Szeg\\H o type inequalities for graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG","math.SP"],"primary_cat":"math.CO","authors_text":"Huiqiu Lin, Lianping Liu, Xilong Yin, Zhe You","submitted_at":"2026-06-10T04:53:20Z","abstract_excerpt":"We study discrete analogues of classical spectral geometric inequalities and extremal eigenvalue problems on graphs. The well-known Krahn--Szeg\\H{o} inequality states that the minimum of $\\lambda_2(\\Omega)$ among bounded open sets of $\\mathbb{R}^n$ with given volume is achieved by the union of two identical balls $\\mathbb{R}^n$. Firstly, we establish a Krahn--Szeg\\H{o} type inequality for trees. For trees with a fixed number of interior vertices and boundary leaves, we completely characterize the extremal structures that minimize the second Dirichlet eigenvalue. Secondly, we develop a nodal do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11659","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/2606.11659/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":"2606.11659","created_at":"2026-06-11T01:10:01.397750+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11659v1","created_at":"2026-06-11T01:10:01.397750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11659","created_at":"2026-06-11T01:10:01.397750+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMZMBSISANUU","created_at":"2026-06-11T01:10:01.397750+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMZMBSISANUU24T5","created_at":"2026-06-11T01:10:01.397750+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMZMBSIS","created_at":"2026-06-11T01:10:01.397750+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DMZMBSISANUU24T5VGH3ZABFCA","json":"https://pith.science/pith/DMZMBSISANUU24T5VGH3ZABFCA.json","graph_json":"https://pith.science/api/pith-number/DMZMBSISANUU24T5VGH3ZABFCA/graph.json","events_json":"https://pith.science/api/pith-number/DMZMBSISANUU24T5VGH3ZABFCA/events.json","paper":"https://pith.science/paper/DMZMBSIS"},"agent_actions":{"view_html":"https://pith.science/pith/DMZMBSISANUU24T5VGH3ZABFCA","download_json":"https://pith.science/pith/DMZMBSISANUU24T5VGH3ZABFCA.json","view_paper":"https://pith.science/paper/DMZMBSIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11659&json=true","fetch_graph":"https://pith.science/api/pith-number/DMZMBSISANUU24T5VGH3ZABFCA/graph.json","fetch_events":"https://pith.science/api/pith-number/DMZMBSISANUU24T5VGH3ZABFCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMZMBSISANUU24T5VGH3ZABFCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMZMBSISANUU24T5VGH3ZABFCA/action/storage_attestation","attest_author":"https://pith.science/pith/DMZMBSISANUU24T5VGH3ZABFCA/action/author_attestation","sign_citation":"https://pith.science/pith/DMZMBSISANUU24T5VGH3ZABFCA/action/citation_signature","submit_replication":"https://pith.science/pith/DMZMBSISANUU24T5VGH3ZABFCA/action/replication_record"}},"created_at":"2026-06-11T01:10:01.397750+00:00","updated_at":"2026-06-11T01:10:01.397750+00:00"}