{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GMMKIWNMNVDHNCQSFTL32TXOBK","short_pith_number":"pith:GMMKIWNM","schema_version":"1.0","canonical_sha256":"3318a459ac6d46768a122cd7bd4eee0a92c35fc0a125b1c979f35ea90f28b7d7","source":{"kind":"arxiv","id":"2303.16631","version":1},"attestation_state":"computed","paper":{"title":"On the $\\alpha$-spectral radius of hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Bizhu Lin, Bo Zhou, Haiyan Guo","submitted_at":"2023-03-29T12:38:00Z","abstract_excerpt":"For real $\\alpha\\in [0,1)$ and a hypergraph $G$, the $\\alpha$-spectral radius of $G$ is the largest eigenvalue of the matrix $A_{\\alpha}(G)=\\alpha D(G)+(1-\\alpha)A(G)$, where $A(G)$ is the adjacency matrix of $G$, which is a symmetric matrix with zero diagonal such that for distinct vertices $u,v$ of $G$, the $(u,v)$-entry of $A(G)$ is exactly the number of edges containing both $u$ and $v$, and $D(G)$ is the diagonal matrix of row sums of $A(G)$. We study the $\\alpha$-spectral radius of a hypergraph that is uniform or not necessarily uniform. We propose some local grafting operations that inc"},"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":"2303.16631","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-03-29T12:38:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"31b68499fa69100b0fa9efff1ca8491a8e15803fbadb4cb2aaef88bb113dc36d","abstract_canon_sha256":"263a21b64b04a1ad2966205b082e35ad1cf482efa3130dab296ca3752e52ab6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:08.761042Z","signature_b64":"UihgC+GUJKg1Y8YLbliVWZFswgtUl4FjBNkXZxppW+wFKmGi86ZHUdAWmLM/eoKBrzH+d5Fe7+EdNfinBavUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3318a459ac6d46768a122cd7bd4eee0a92c35fc0a125b1c979f35ea90f28b7d7","last_reissued_at":"2026-07-05T05:56:08.760572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:08.760572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $\\alpha$-spectral radius of hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Bizhu Lin, Bo Zhou, Haiyan Guo","submitted_at":"2023-03-29T12:38:00Z","abstract_excerpt":"For real $\\alpha\\in [0,1)$ and a hypergraph $G$, the $\\alpha$-spectral radius of $G$ is the largest eigenvalue of the matrix $A_{\\alpha}(G)=\\alpha D(G)+(1-\\alpha)A(G)$, where $A(G)$ is the adjacency matrix of $G$, which is a symmetric matrix with zero diagonal such that for distinct vertices $u,v$ of $G$, the $(u,v)$-entry of $A(G)$ is exactly the number of edges containing both $u$ and $v$, and $D(G)$ is the diagonal matrix of row sums of $A(G)$. We study the $\\alpha$-spectral radius of a hypergraph that is uniform or not necessarily uniform. We propose some local grafting operations that inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16631","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/2303.16631/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":"2303.16631","created_at":"2026-07-05T05:56:08.760630+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16631v1","created_at":"2026-07-05T05:56:08.760630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16631","created_at":"2026-07-05T05:56:08.760630+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMMKIWNMNVDH","created_at":"2026-07-05T05:56:08.760630+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMMKIWNMNVDHNCQS","created_at":"2026-07-05T05:56:08.760630+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMMKIWNM","created_at":"2026-07-05T05:56:08.760630+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/GMMKIWNMNVDHNCQSFTL32TXOBK","json":"https://pith.science/pith/GMMKIWNMNVDHNCQSFTL32TXOBK.json","graph_json":"https://pith.science/api/pith-number/GMMKIWNMNVDHNCQSFTL32TXOBK/graph.json","events_json":"https://pith.science/api/pith-number/GMMKIWNMNVDHNCQSFTL32TXOBK/events.json","paper":"https://pith.science/paper/GMMKIWNM"},"agent_actions":{"view_html":"https://pith.science/pith/GMMKIWNMNVDHNCQSFTL32TXOBK","download_json":"https://pith.science/pith/GMMKIWNMNVDHNCQSFTL32TXOBK.json","view_paper":"https://pith.science/paper/GMMKIWNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16631&json=true","fetch_graph":"https://pith.science/api/pith-number/GMMKIWNMNVDHNCQSFTL32TXOBK/graph.json","fetch_events":"https://pith.science/api/pith-number/GMMKIWNMNVDHNCQSFTL32TXOBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMMKIWNMNVDHNCQSFTL32TXOBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMMKIWNMNVDHNCQSFTL32TXOBK/action/storage_attestation","attest_author":"https://pith.science/pith/GMMKIWNMNVDHNCQSFTL32TXOBK/action/author_attestation","sign_citation":"https://pith.science/pith/GMMKIWNMNVDHNCQSFTL32TXOBK/action/citation_signature","submit_replication":"https://pith.science/pith/GMMKIWNMNVDHNCQSFTL32TXOBK/action/replication_record"}},"created_at":"2026-07-05T05:56:08.760630+00:00","updated_at":"2026-07-05T05:56:08.760630+00:00"}