{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LRMKS2L7TRCQIZXKJ7D2F3P56D","short_pith_number":"pith:LRMKS2L7","schema_version":"1.0","canonical_sha256":"5c58a9697f9c450466ea4fc7a2edfdf0f6ed6bc9d61d9ec27a9f7094e15f379d","source":{"kind":"arxiv","id":"1808.08590","version":1},"attestation_state":"computed","paper":{"title":"Uniform hypergraphs with the first two smallest spectral radii","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Haiyan Guo, Jianbin Zhang, Jianping Li","submitted_at":"2018-08-26T16:46:16Z","abstract_excerpt":"The spectral radius of a uniform hypergraph $G$ is the the maximum modulus of the eigenvalues of the adjacency tensor of $G$. For $k\\ge 2$, among connected $k$-uniform hypergraphs with $m\\ge 1$ edges, we show that the $k$-uniform loose path with $m$ edges is the unique one with minimum spectral radius, and we also determine the unique ones with second minimum spectral radius when $m\\ge 2$."},"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":"1808.08590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-08-26T16:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"0be9feb4584a454fc051f404b0ba6277ec2dad455da31940ff0d3e107e97b665","abstract_canon_sha256":"b13f638cb495d39c485c62241f02bb0cbab3088b5c595730c8073b804d71f077"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:15.979170Z","signature_b64":"MqbHe+Ejx12LgPBP5m7IVhdvqqohlW9lTHxCwmIm1CztT8OWaCat3NfAXIejz3Uk9qLM16yaOa3I9vkqWCXjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c58a9697f9c450466ea4fc7a2edfdf0f6ed6bc9d61d9ec27a9f7094e15f379d","last_reissued_at":"2026-05-18T00:07:15.978295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:15.978295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform hypergraphs with the first two smallest spectral radii","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Haiyan Guo, Jianbin Zhang, Jianping Li","submitted_at":"2018-08-26T16:46:16Z","abstract_excerpt":"The spectral radius of a uniform hypergraph $G$ is the the maximum modulus of the eigenvalues of the adjacency tensor of $G$. For $k\\ge 2$, among connected $k$-uniform hypergraphs with $m\\ge 1$ edges, we show that the $k$-uniform loose path with $m$ edges is the unique one with minimum spectral radius, and we also determine the unique ones with second minimum spectral radius when $m\\ge 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08590","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":"1808.08590","created_at":"2026-05-18T00:07:15.978463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08590v1","created_at":"2026-05-18T00:07:15.978463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08590","created_at":"2026-05-18T00:07:15.978463+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRMKS2L7TRCQ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRMKS2L7TRCQIZXK","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRMKS2L7","created_at":"2026-05-18T12:32:37.024351+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/LRMKS2L7TRCQIZXKJ7D2F3P56D","json":"https://pith.science/pith/LRMKS2L7TRCQIZXKJ7D2F3P56D.json","graph_json":"https://pith.science/api/pith-number/LRMKS2L7TRCQIZXKJ7D2F3P56D/graph.json","events_json":"https://pith.science/api/pith-number/LRMKS2L7TRCQIZXKJ7D2F3P56D/events.json","paper":"https://pith.science/paper/LRMKS2L7"},"agent_actions":{"view_html":"https://pith.science/pith/LRMKS2L7TRCQIZXKJ7D2F3P56D","download_json":"https://pith.science/pith/LRMKS2L7TRCQIZXKJ7D2F3P56D.json","view_paper":"https://pith.science/paper/LRMKS2L7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08590&json=true","fetch_graph":"https://pith.science/api/pith-number/LRMKS2L7TRCQIZXKJ7D2F3P56D/graph.json","fetch_events":"https://pith.science/api/pith-number/LRMKS2L7TRCQIZXKJ7D2F3P56D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRMKS2L7TRCQIZXKJ7D2F3P56D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRMKS2L7TRCQIZXKJ7D2F3P56D/action/storage_attestation","attest_author":"https://pith.science/pith/LRMKS2L7TRCQIZXKJ7D2F3P56D/action/author_attestation","sign_citation":"https://pith.science/pith/LRMKS2L7TRCQIZXKJ7D2F3P56D/action/citation_signature","submit_replication":"https://pith.science/pith/LRMKS2L7TRCQIZXKJ7D2F3P56D/action/replication_record"}},"created_at":"2026-05-18T00:07:15.978463+00:00","updated_at":"2026-05-18T00:07:15.978463+00:00"}