{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZMB2YCF6DXJOUQFLDHGNF5RWBP","short_pith_number":"pith:ZMB2YCF6","schema_version":"1.0","canonical_sha256":"cb03ac08be1dd2ea40ab19ccd2f6360bd8acabe9c27c88278ee860285daec874","source":{"kind":"arxiv","id":"2002.10288","version":1},"attestation_state":"computed","paper":{"title":"The least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yi Wang, Yi-Zheng Fan, Zhu Zhu","submitted_at":"2020-02-18T15:05:29Z","abstract_excerpt":"Let $G$ be a connected hypergraph with even uniformity, which contains cut vertices. Then $G$ is the coalescence of two nontrivial connected sub-hypergraphs (called branches) at a cut vertex. Let $\\mathcal{A}(G)$ be the adjacency tensor of $G$. The least H-eigenvalue of $\\mathcal{A}(G)$ refers to the least real eigenvalue of $\\mathcal{A}(G)$ associated with a real eigenvector. In this paper we obtain a perturbation result on the least H-eigenvalue of $\\mathcal{A}(G)$ when a branch of $G$ attached at one vertex is relocated to another vertex, and characterize the unique hypergraph whose least H"},"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":"2002.10288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-18T15:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"447f3a6e897d61a1de3017f7a4a7196292875013c2d6feb0ffd4537abd6f0462","abstract_canon_sha256":"bd7c1c8b08672167b44b506ba25e8ad4f1953e34d243f114f7ef57421abb0922"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:09:26.330497Z","signature_b64":"Zfyt3WAL0Js7nEoloCBvuA7zOOQNQojHD0kefegMzvlYd8NT83bujy9dcCVP42nFEiZ3xJntVyDN/Ji1cECQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb03ac08be1dd2ea40ab19ccd2f6360bd8acabe9c27c88278ee860285daec874","last_reissued_at":"2026-07-05T03:09:26.330052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:09:26.330052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yi Wang, Yi-Zheng Fan, Zhu Zhu","submitted_at":"2020-02-18T15:05:29Z","abstract_excerpt":"Let $G$ be a connected hypergraph with even uniformity, which contains cut vertices. Then $G$ is the coalescence of two nontrivial connected sub-hypergraphs (called branches) at a cut vertex. Let $\\mathcal{A}(G)$ be the adjacency tensor of $G$. The least H-eigenvalue of $\\mathcal{A}(G)$ refers to the least real eigenvalue of $\\mathcal{A}(G)$ associated with a real eigenvector. In this paper we obtain a perturbation result on the least H-eigenvalue of $\\mathcal{A}(G)$ when a branch of $G$ attached at one vertex is relocated to another vertex, and characterize the unique hypergraph whose least H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10288","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/2002.10288/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":"2002.10288","created_at":"2026-07-05T03:09:26.330124+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.10288v1","created_at":"2026-07-05T03:09:26.330124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10288","created_at":"2026-07-05T03:09:26.330124+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMB2YCF6DXJO","created_at":"2026-07-05T03:09:26.330124+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMB2YCF6DXJOUQFL","created_at":"2026-07-05T03:09:26.330124+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMB2YCF6","created_at":"2026-07-05T03:09:26.330124+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.00661","citing_title":"Common Fate for Animated Transitions in Visualization","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMB2YCF6DXJOUQFLDHGNF5RWBP","json":"https://pith.science/pith/ZMB2YCF6DXJOUQFLDHGNF5RWBP.json","graph_json":"https://pith.science/api/pith-number/ZMB2YCF6DXJOUQFLDHGNF5RWBP/graph.json","events_json":"https://pith.science/api/pith-number/ZMB2YCF6DXJOUQFLDHGNF5RWBP/events.json","paper":"https://pith.science/paper/ZMB2YCF6"},"agent_actions":{"view_html":"https://pith.science/pith/ZMB2YCF6DXJOUQFLDHGNF5RWBP","download_json":"https://pith.science/pith/ZMB2YCF6DXJOUQFLDHGNF5RWBP.json","view_paper":"https://pith.science/paper/ZMB2YCF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.10288&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMB2YCF6DXJOUQFLDHGNF5RWBP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMB2YCF6DXJOUQFLDHGNF5RWBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMB2YCF6DXJOUQFLDHGNF5RWBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMB2YCF6DXJOUQFLDHGNF5RWBP/action/storage_attestation","attest_author":"https://pith.science/pith/ZMB2YCF6DXJOUQFLDHGNF5RWBP/action/author_attestation","sign_citation":"https://pith.science/pith/ZMB2YCF6DXJOUQFLDHGNF5RWBP/action/citation_signature","submit_replication":"https://pith.science/pith/ZMB2YCF6DXJOUQFLDHGNF5RWBP/action/replication_record"}},"created_at":"2026-07-05T03:09:26.330124+00:00","updated_at":"2026-07-05T03:09:26.330124+00:00"}