{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7EHXU7M7AGWN75AP6DPWQVWT6L","short_pith_number":"pith:7EHXU7M7","schema_version":"1.0","canonical_sha256":"f90f7a7d9f01acdff40ff0df6856d3f2d960925c972876cd88ef4322c6733da8","source":{"kind":"arxiv","id":"1611.07185","version":1},"attestation_state":"computed","paper":{"title":"Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Erfang Shan, Lele Liu, Liying Kang","submitted_at":"2016-11-22T08:10:46Z","abstract_excerpt":"Let $\\mathcal{A}(H)$ and $\\mathcal{Q}(H)$ be the adjacency tensor and signless Laplacian tensor of an $r$-uniform hypergraph $H$. Denote by $\\rho(H)$ and $\\rho(\\mathcal{Q}(H))$ the spectral radii of $\\mathcal{A}(H)$ and $\\mathcal{Q}(H)$, respectively. In this paper we present a lower bound on $\\rho(H)$ in terms of vertex degrees and we characterize the extremal hypergraphs attaining the bound, which solves a problem posed by Nikiforov [V. Nikiforov, Analytic methods for uniform hypergraphs, Linear Algebra Appl. 457 (2014) 455-535]. Also, we prove a lower bound on $\\rho(\\mathcal{Q}(H))$ concern"},"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":"1611.07185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2016-11-22T08:10:46Z","cross_cats_sorted":[],"title_canon_sha256":"25b4dbbb254dd709299c254c717bd651f595156c682f7b64e5c96af5ebb2092b","abstract_canon_sha256":"dfeb4dc38c3b323c743a5f022a0f05094fdd0f7c4d07cc4661e7fe832fea1d57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:24.664065Z","signature_b64":"CtgztmdSh44NgkHjB079J9PvotH9eJls4VmYKEv2ReZbw4ukhbDYXauG0TDKZPPOBvXeWGOYoyVg7xSPxZaoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f90f7a7d9f01acdff40ff0df6856d3f2d960925c972876cd88ef4322c6733da8","last_reissued_at":"2026-05-18T00:57:24.663493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:24.663493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Erfang Shan, Lele Liu, Liying Kang","submitted_at":"2016-11-22T08:10:46Z","abstract_excerpt":"Let $\\mathcal{A}(H)$ and $\\mathcal{Q}(H)$ be the adjacency tensor and signless Laplacian tensor of an $r$-uniform hypergraph $H$. Denote by $\\rho(H)$ and $\\rho(\\mathcal{Q}(H))$ the spectral radii of $\\mathcal{A}(H)$ and $\\mathcal{Q}(H)$, respectively. In this paper we present a lower bound on $\\rho(H)$ in terms of vertex degrees and we characterize the extremal hypergraphs attaining the bound, which solves a problem posed by Nikiforov [V. Nikiforov, Analytic methods for uniform hypergraphs, Linear Algebra Appl. 457 (2014) 455-535]. Also, we prove a lower bound on $\\rho(\\mathcal{Q}(H))$ concern"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07185","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":""},"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":"1611.07185","created_at":"2026-05-18T00:57:24.663569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07185v1","created_at":"2026-05-18T00:57:24.663569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07185","created_at":"2026-05-18T00:57:24.663569+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EHXU7M7AGWN","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EHXU7M7AGWN75AP","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EHXU7M7","created_at":"2026-05-18T12:30:04.600751+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/7EHXU7M7AGWN75AP6DPWQVWT6L","json":"https://pith.science/pith/7EHXU7M7AGWN75AP6DPWQVWT6L.json","graph_json":"https://pith.science/api/pith-number/7EHXU7M7AGWN75AP6DPWQVWT6L/graph.json","events_json":"https://pith.science/api/pith-number/7EHXU7M7AGWN75AP6DPWQVWT6L/events.json","paper":"https://pith.science/paper/7EHXU7M7"},"agent_actions":{"view_html":"https://pith.science/pith/7EHXU7M7AGWN75AP6DPWQVWT6L","download_json":"https://pith.science/pith/7EHXU7M7AGWN75AP6DPWQVWT6L.json","view_paper":"https://pith.science/paper/7EHXU7M7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07185&json=true","fetch_graph":"https://pith.science/api/pith-number/7EHXU7M7AGWN75AP6DPWQVWT6L/graph.json","fetch_events":"https://pith.science/api/pith-number/7EHXU7M7AGWN75AP6DPWQVWT6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EHXU7M7AGWN75AP6DPWQVWT6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EHXU7M7AGWN75AP6DPWQVWT6L/action/storage_attestation","attest_author":"https://pith.science/pith/7EHXU7M7AGWN75AP6DPWQVWT6L/action/author_attestation","sign_citation":"https://pith.science/pith/7EHXU7M7AGWN75AP6DPWQVWT6L/action/citation_signature","submit_replication":"https://pith.science/pith/7EHXU7M7AGWN75AP6DPWQVWT6L/action/replication_record"}},"created_at":"2026-05-18T00:57:24.663569+00:00","updated_at":"2026-05-18T00:57:24.663569+00:00"}