{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4SCFIUMTBYEYM56OJDDB5QWLNY","short_pith_number":"pith:4SCFIUMT","schema_version":"1.0","canonical_sha256":"e4845451930e098677ce48c61ec2cb6e09a533d291891fb3c1a92d8be6e18811","source":{"kind":"arxiv","id":"1904.04970","version":1},"attestation_state":"computed","paper":{"title":"Vertex-connectivity and $Q$-index of graphs with fixed girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Huicai Jia, Ju Zhou, Ruifang Liu","submitted_at":"2019-04-10T01:41:22Z","abstract_excerpt":"Let $q(G)$ denote the $Q$-index of a graph $G$, which is the largest signless Laplacian eigenvalue of $G$. We prove best possible upper bounds of $q(G)$ and best possible lower bounds of $q(\\overline{G})$ for a connected graph $G$ to be $k$-connected and maximally connected, respectively. Similar upper bounds of $q(G)$ and lower bounds of $q(\\overline{G})$ to assure $G$ to be super-connected are also obtained. Upper bounds of $q(G)$ and lower bounds of $q(\\overline{G})$ to assure a connected triangle-free graph $G$ to be $k$-connected, maximally connected and super-connected are also respectiv"},"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":"1904.04970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-10T01:41:22Z","cross_cats_sorted":[],"title_canon_sha256":"0b1eb17db5c7a88bbf3cf5db346759982f93756e20abdaca4581fd28431b5aca","abstract_canon_sha256":"44e644d9777f93559d547e4f2f8161f3fc684f517e17934f2d64164acef8ab0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:54.571157Z","signature_b64":"p5a8AipfxB4L+yLv5jZ+1k9fcz1Tla3DofrEVQViMrzzRL01SCPEyOjM5e8l8ZIXRG+PGOn8BIbSRjO4GZBlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4845451930e098677ce48c61ec2cb6e09a533d291891fb3c1a92d8be6e18811","last_reissued_at":"2026-05-17T23:48:54.570645Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:54.570645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex-connectivity and $Q$-index of graphs with fixed girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Huicai Jia, Ju Zhou, Ruifang Liu","submitted_at":"2019-04-10T01:41:22Z","abstract_excerpt":"Let $q(G)$ denote the $Q$-index of a graph $G$, which is the largest signless Laplacian eigenvalue of $G$. We prove best possible upper bounds of $q(G)$ and best possible lower bounds of $q(\\overline{G})$ for a connected graph $G$ to be $k$-connected and maximally connected, respectively. Similar upper bounds of $q(G)$ and lower bounds of $q(\\overline{G})$ to assure $G$ to be super-connected are also obtained. Upper bounds of $q(G)$ and lower bounds of $q(\\overline{G})$ to assure a connected triangle-free graph $G$ to be $k$-connected, maximally connected and super-connected are also respectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04970","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":"1904.04970","created_at":"2026-05-17T23:48:54.570734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04970v1","created_at":"2026-05-17T23:48:54.570734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04970","created_at":"2026-05-17T23:48:54.570734+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SCFIUMTBYEY","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SCFIUMTBYEYM56O","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SCFIUMT","created_at":"2026-05-18T12:33:10.108867+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/4SCFIUMTBYEYM56OJDDB5QWLNY","json":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY.json","graph_json":"https://pith.science/api/pith-number/4SCFIUMTBYEYM56OJDDB5QWLNY/graph.json","events_json":"https://pith.science/api/pith-number/4SCFIUMTBYEYM56OJDDB5QWLNY/events.json","paper":"https://pith.science/paper/4SCFIUMT"},"agent_actions":{"view_html":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY","download_json":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY.json","view_paper":"https://pith.science/paper/4SCFIUMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04970&json=true","fetch_graph":"https://pith.science/api/pith-number/4SCFIUMTBYEYM56OJDDB5QWLNY/graph.json","fetch_events":"https://pith.science/api/pith-number/4SCFIUMTBYEYM56OJDDB5QWLNY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/action/storage_attestation","attest_author":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/action/author_attestation","sign_citation":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/action/citation_signature","submit_replication":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/action/replication_record"}},"created_at":"2026-05-17T23:48:54.570734+00:00","updated_at":"2026-05-17T23:48:54.570734+00:00"}