{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LQ3P2NQQWE3AAIHG4556QZ26PU","short_pith_number":"pith:LQ3P2NQQ","canonical_record":{"source":{"id":"1402.5402","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-21T20:29:22Z","cross_cats_sorted":[],"title_canon_sha256":"382e4e5e3cc0b400c4957eeaae8b36a967fbc03c4a857f366b0a29c6b5b11dc8","abstract_canon_sha256":"dbcb1dc188fcffc551c77d0452d97b61fbbc476e124d2c245a2972e6e58edb24"},"schema_version":"1.0"},"canonical_sha256":"5c36fd3610b1360020e6e77be8675e7d01db6b045ab241aa4b6313f1d3789510","source":{"kind":"arxiv","id":"1402.5402","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5402","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5402v3","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5402","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"LQ3P2NQQWE3A","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LQ3P2NQQWE3AAIHG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LQ3P2NQQ","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LQ3P2NQQWE3AAIHG4556QZ26PU","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5402","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-21T20:29:22Z","cross_cats_sorted":[],"title_canon_sha256":"382e4e5e3cc0b400c4957eeaae8b36a967fbc03c4a857f366b0a29c6b5b11dc8","abstract_canon_sha256":"dbcb1dc188fcffc551c77d0452d97b61fbbc476e124d2c245a2972e6e58edb24"},"schema_version":"1.0"},"canonical_sha256":"5c36fd3610b1360020e6e77be8675e7d01db6b045ab241aa4b6313f1d3789510","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:51.431374Z","signature_b64":"hy5ODS5/lsQYRX3IaSKEud/3R923bK1zq5YvSWRIZTTuqVeOtnW7Hi4f5kgxQBi7ZHdDiJUznRGBpwi0EL6bBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c36fd3610b1360020e6e77be8675e7d01db6b045ab241aa4b6313f1d3789510","last_reissued_at":"2026-05-18T02:56:51.430974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:51.430974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5402","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hC3LzIPhGsh5sOi70Wm7cM/jeJdyoSrO6k2dLqPXaI5+LkDCo83LDsGx6sJ497K0nfYiLQRN56VShJ9GOFMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:29:45.199369Z"},"content_sha256":"76abe1b64238ee2d28f5eddbffe07464f4e2af90b45d1569e0f1d15299782480","schema_version":"1.0","event_id":"sha256:76abe1b64238ee2d28f5eddbffe07464f4e2af90b45d1569e0f1d15299782480"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LQ3P2NQQWE3AAIHG4556QZ26PU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected Hypergraphs with Small Spectral Radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linyuan Lu, Shoudong Man","submitted_at":"2014-02-21T20:29:22Z","abstract_excerpt":"In 1970 Smith classified all connected graphs with the spectral radius at most $2$. Here the spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Recently, the definition of spectral radius has been extended to $r$-uniform hypergraphs. In this paper, we generalize the Smith's theorem to $r$-uniform hypergraphs. We show that the smallest limit point of the spectral radii of connected $r$-uniform hypergraphs is $\\rho_r=(r-1)!\\sqrt[r]{4}$. We discovered a novel method for computing the spectral radius of hypergraphs, and classified all connected $r$-uniform hypergraphs wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5402","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OxUWgvmFL9zxmUl3QJnQjsVqG1A4xgk3CZP5/gAuxCQocUrKpWK51/ogGdSfJrQBBclniOhh/eGc+JQyHE9dDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:29:45.199713Z"},"content_sha256":"51f4cf1b7dcc52e7908726c438be5ddc5ddd4823e3921bea7fdda96db2623d57","schema_version":"1.0","event_id":"sha256:51f4cf1b7dcc52e7908726c438be5ddc5ddd4823e3921bea7fdda96db2623d57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQ3P2NQQWE3AAIHG4556QZ26PU/bundle.json","state_url":"https://pith.science/pith/LQ3P2NQQWE3AAIHG4556QZ26PU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQ3P2NQQWE3AAIHG4556QZ26PU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T02:29:45Z","links":{"resolver":"https://pith.science/pith/LQ3P2NQQWE3AAIHG4556QZ26PU","bundle":"https://pith.science/pith/LQ3P2NQQWE3AAIHG4556QZ26PU/bundle.json","state":"https://pith.science/pith/LQ3P2NQQWE3AAIHG4556QZ26PU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQ3P2NQQWE3AAIHG4556QZ26PU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LQ3P2NQQWE3AAIHG4556QZ26PU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dbcb1dc188fcffc551c77d0452d97b61fbbc476e124d2c245a2972e6e58edb24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-21T20:29:22Z","title_canon_sha256":"382e4e5e3cc0b400c4957eeaae8b36a967fbc03c4a857f366b0a29c6b5b11dc8"},"schema_version":"1.0","source":{"id":"1402.5402","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5402","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5402v3","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5402","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"LQ3P2NQQWE3A","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LQ3P2NQQWE3AAIHG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LQ3P2NQQ","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:51f4cf1b7dcc52e7908726c438be5ddc5ddd4823e3921bea7fdda96db2623d57","target":"graph","created_at":"2026-05-18T02:56:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In 1970 Smith classified all connected graphs with the spectral radius at most $2$. Here the spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Recently, the definition of spectral radius has been extended to $r$-uniform hypergraphs. In this paper, we generalize the Smith's theorem to $r$-uniform hypergraphs. We show that the smallest limit point of the spectral radii of connected $r$-uniform hypergraphs is $\\rho_r=(r-1)!\\sqrt[r]{4}$. We discovered a novel method for computing the spectral radius of hypergraphs, and classified all connected $r$-uniform hypergraphs wi","authors_text":"Linyuan Lu, Shoudong Man","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-21T20:29:22Z","title":"Connected Hypergraphs with Small Spectral Radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5402","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:76abe1b64238ee2d28f5eddbffe07464f4e2af90b45d1569e0f1d15299782480","target":"record","created_at":"2026-05-18T02:56:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dbcb1dc188fcffc551c77d0452d97b61fbbc476e124d2c245a2972e6e58edb24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-21T20:29:22Z","title_canon_sha256":"382e4e5e3cc0b400c4957eeaae8b36a967fbc03c4a857f366b0a29c6b5b11dc8"},"schema_version":"1.0","source":{"id":"1402.5402","kind":"arxiv","version":3}},"canonical_sha256":"5c36fd3610b1360020e6e77be8675e7d01db6b045ab241aa4b6313f1d3789510","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c36fd3610b1360020e6e77be8675e7d01db6b045ab241aa4b6313f1d3789510","first_computed_at":"2026-05-18T02:56:51.430974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:51.430974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hy5ODS5/lsQYRX3IaSKEud/3R923bK1zq5YvSWRIZTTuqVeOtnW7Hi4f5kgxQBi7ZHdDiJUznRGBpwi0EL6bBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:51.431374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5402","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76abe1b64238ee2d28f5eddbffe07464f4e2af90b45d1569e0f1d15299782480","sha256:51f4cf1b7dcc52e7908726c438be5ddc5ddd4823e3921bea7fdda96db2623d57"],"state_sha256":"c71f7034329531651e510a1e921f61bb92c42dd232f9f46000dd6ef9b65735f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBEZyp5YGpUR1tQpyFixm6Sy1httzgk7LaaZjF4YXVD5noil/7ouEqz2qH5zfet1ZyI1q5HbPgc5h5C2l3IiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:29:45.201702Z","bundle_sha256":"a5d40e2e2a297e076d822ebb8ecbf6417ef85abeeafe40fefe56678a1f407374"}}