{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SO2UJO7L2EFC3WY3D6ZIKHTMOU","short_pith_number":"pith:SO2UJO7L","schema_version":"1.0","canonical_sha256":"93b544bbebd10a2ddb1b1fb2851e6c752ac1486ed974b003a25db93cffa587bc","source":{"kind":"arxiv","id":"1304.1315","version":6},"attestation_state":"computed","paper":{"title":"The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Jinshan Xie, Liqun Qi, Shenglong Hu","submitted_at":"2013-04-04T10:55:55Z","abstract_excerpt":"In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given. For a connected even-uniform hypergraph, this lower bound is achieved if and only if it is a hyperstar. However, when $k$ is odd, it happens that the largest Laplacian H-eigenvalue is equal to the maximum degree, which is a tight lower bound. On the other hand, tight upper and lower bounds for the largest signless Laplacian H-eigenvalue of a $k$-uniform connected hypergraph are given."},"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":"1304.1315","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2013-04-04T10:55:55Z","cross_cats_sorted":[],"title_canon_sha256":"53378c068a4591a5d5f096d76fe148c7959badf8688ce490d236f9bce3cc4519","abstract_canon_sha256":"0e5105cab46c8eda12d6d9804d4eccb711b7666824c9550a1e1a813b56681052"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:58.227703Z","signature_b64":"CoUvO7EUetX14nYcsr5zJjOlurX/mDnEbJqY/FXbEwKuXQCTBNcCZ5a5nssEXbodoCBwwf2Np9VJi26h9qATBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93b544bbebd10a2ddb1b1fb2851e6c752ac1486ed974b003a25db93cffa587bc","last_reissued_at":"2026-05-18T03:25:58.226961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:58.226961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Jinshan Xie, Liqun Qi, Shenglong Hu","submitted_at":"2013-04-04T10:55:55Z","abstract_excerpt":"In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given. For a connected even-uniform hypergraph, this lower bound is achieved if and only if it is a hyperstar. However, when $k$ is odd, it happens that the largest Laplacian H-eigenvalue is equal to the maximum degree, which is a tight lower bound. On the other hand, tight upper and lower bounds for the largest signless Laplacian H-eigenvalue of a $k$-uniform connected hypergraph are given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1315","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1304.1315","created_at":"2026-05-18T03:25:58.227074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1315v6","created_at":"2026-05-18T03:25:58.227074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1315","created_at":"2026-05-18T03:25:58.227074+00:00"},{"alias_kind":"pith_short_12","alias_value":"SO2UJO7L2EFC","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SO2UJO7L2EFC3WY3","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SO2UJO7L","created_at":"2026-05-18T12:27:59.945178+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/SO2UJO7L2EFC3WY3D6ZIKHTMOU","json":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU.json","graph_json":"https://pith.science/api/pith-number/SO2UJO7L2EFC3WY3D6ZIKHTMOU/graph.json","events_json":"https://pith.science/api/pith-number/SO2UJO7L2EFC3WY3D6ZIKHTMOU/events.json","paper":"https://pith.science/paper/SO2UJO7L"},"agent_actions":{"view_html":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU","download_json":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU.json","view_paper":"https://pith.science/paper/SO2UJO7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1315&json=true","fetch_graph":"https://pith.science/api/pith-number/SO2UJO7L2EFC3WY3D6ZIKHTMOU/graph.json","fetch_events":"https://pith.science/api/pith-number/SO2UJO7L2EFC3WY3D6ZIKHTMOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/action/storage_attestation","attest_author":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/action/author_attestation","sign_citation":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/action/citation_signature","submit_replication":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/action/replication_record"}},"created_at":"2026-05-18T03:25:58.227074+00:00","updated_at":"2026-05-18T03:25:58.227074+00:00"}