{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SO2UJO7L2EFC3WY3D6ZIKHTMOU","short_pith_number":"pith:SO2UJO7L","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"},"canonical_sha256":"93b544bbebd10a2ddb1b1fb2851e6c752ac1486ed974b003a25db93cffa587bc","source":{"kind":"arxiv","id":"1304.1315","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1315","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1315v6","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1315","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"pith_short_12","alias_value":"SO2UJO7L2EFC","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SO2UJO7L2EFC3WY3","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SO2UJO7L","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SO2UJO7L2EFC3WY3D6ZIKHTMOU","target":"record","payload":{"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"},"canonical_sha256":"93b544bbebd10a2ddb1b1fb2851e6c752ac1486ed974b003a25db93cffa587bc","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"},"source_kind":"arxiv","source_id":"1304.1315","source_version":6,"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-18T03:25:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWDTP+S7pR3qSEYd7m7E4wumnRz1KinLiOgEX/wTDJGpcBAb9vKj8YKrFHf2UhhboigwUZQlt/Sq1TiaMgYjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:59:10.697465Z"},"content_sha256":"0f87910c97852ffb42682f782425982f8c91ebc68a9be96cf01d43ca34d18ecf","schema_version":"1.0","event_id":"sha256:0f87910c97852ffb42682f782425982f8c91ebc68a9be96cf01d43ca34d18ecf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SO2UJO7L2EFC3WY3D6ZIKHTMOU","target":"graph","payload":{"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"},"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-18T03:25:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DxLYojgQYDt2lR+O/o2eb7pcqvfzXl1BMJZ4Q4TjuZbt5V0Jdgw9tmoz84AqVYOz6fltBIJ2YwSyXbOJz/l0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:59:10.697828Z"},"content_sha256":"c2f8c12901db4120c47b89b661f88ac95c9fa18aad80928cb9e9b1f254ed44b7","schema_version":"1.0","event_id":"sha256:c2f8c12901db4120c47b89b661f88ac95c9fa18aad80928cb9e9b1f254ed44b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/bundle.json","state_url":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/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-26T02:59:10Z","links":{"resolver":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU","bundle":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/bundle.json","state":"https://pith.science/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SO2UJO7L2EFC3WY3D6ZIKHTMOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SO2UJO7L2EFC3WY3D6ZIKHTMOU","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":"0e5105cab46c8eda12d6d9804d4eccb711b7666824c9550a1e1a813b56681052","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2013-04-04T10:55:55Z","title_canon_sha256":"53378c068a4591a5d5f096d76fe148c7959badf8688ce490d236f9bce3cc4519"},"schema_version":"1.0","source":{"id":"1304.1315","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1315","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1315v6","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1315","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"pith_short_12","alias_value":"SO2UJO7L2EFC","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SO2UJO7L2EFC3WY3","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SO2UJO7L","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:c2f8c12901db4120c47b89b661f88ac95c9fa18aad80928cb9e9b1f254ed44b7","target":"graph","created_at":"2026-05-18T03:25:58Z","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 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.","authors_text":"Jinshan Xie, Liqun Qi, Shenglong Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2013-04-04T10:55:55Z","title":"The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1315","kind":"arxiv","version":6},"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:0f87910c97852ffb42682f782425982f8c91ebc68a9be96cf01d43ca34d18ecf","target":"record","created_at":"2026-05-18T03:25:58Z","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":"0e5105cab46c8eda12d6d9804d4eccb711b7666824c9550a1e1a813b56681052","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2013-04-04T10:55:55Z","title_canon_sha256":"53378c068a4591a5d5f096d76fe148c7959badf8688ce490d236f9bce3cc4519"},"schema_version":"1.0","source":{"id":"1304.1315","kind":"arxiv","version":6}},"canonical_sha256":"93b544bbebd10a2ddb1b1fb2851e6c752ac1486ed974b003a25db93cffa587bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93b544bbebd10a2ddb1b1fb2851e6c752ac1486ed974b003a25db93cffa587bc","first_computed_at":"2026-05-18T03:25:58.226961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:58.226961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CoUvO7EUetX14nYcsr5zJjOlurX/mDnEbJqY/FXbEwKuXQCTBNcCZ5a5nssEXbodoCBwwf2Np9VJi26h9qATBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:58.227703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1315","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f87910c97852ffb42682f782425982f8c91ebc68a9be96cf01d43ca34d18ecf","sha256:c2f8c12901db4120c47b89b661f88ac95c9fa18aad80928cb9e9b1f254ed44b7"],"state_sha256":"a9a3046f4e96438c1d24f6b314ad9527e1f498afc97c971eb0d05ffe713e13a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZIDaeAz7mDHDWJwHmBZC73Ksl8iuiCiNThgyY0sT1ON5SqUU9irmXrwSbmnnFAv80NoGTN0GiXYTF4bq1UJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:59:10.699822Z","bundle_sha256":"23354723f998659cd6bfb549841bcef77fe7d7583eec766c73914f51900f90d7"}}