{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4SCFIUMTBYEYM56OJDDB5QWLNY","short_pith_number":"pith:4SCFIUMT","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"},"canonical_sha256":"e4845451930e098677ce48c61ec2cb6e09a533d291891fb3c1a92d8be6e18811","source":{"kind":"arxiv","id":"1904.04970","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04970","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04970v1","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04970","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"4SCFIUMTBYEY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4SCFIUMTBYEYM56O","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4SCFIUMT","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4SCFIUMTBYEYM56OJDDB5QWLNY","target":"record","payload":{"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"},"canonical_sha256":"e4845451930e098677ce48c61ec2cb6e09a533d291891fb3c1a92d8be6e18811","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"},"source_kind":"arxiv","source_id":"1904.04970","source_version":1,"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-17T23:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Au6lee8NqBtrSp7ZnaQSRhEGMWvoeouPTg1/K8//GVEnS/CNX+RAFdnsS0Y+9qrtCQV2PYcSgmugDGp4WyZZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:32:25.072347Z"},"content_sha256":"24f02165c3dff6819dd4c5af5307ded131900c9267bf815363c707d6e386e283","schema_version":"1.0","event_id":"sha256:24f02165c3dff6819dd4c5af5307ded131900c9267bf815363c707d6e386e283"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4SCFIUMTBYEYM56OJDDB5QWLNY","target":"graph","payload":{"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"},"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-17T23:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3yjum7wjsYqIQnpnWZbkgx9rI4SiXZNVsc5/yFX4tMly6TY09yUig737uMYXveJReNRPfyN0G6fnWUKfgJJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:32:25.072975Z"},"content_sha256":"01095fa8be898fd36d3519588c5973f243f31364f78e1bc436b0a97d28b80592","schema_version":"1.0","event_id":"sha256:01095fa8be898fd36d3519588c5973f243f31364f78e1bc436b0a97d28b80592"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/bundle.json","state_url":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/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-02T14:32:25Z","links":{"resolver":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY","bundle":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/bundle.json","state":"https://pith.science/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SCFIUMTBYEYM56OJDDB5QWLNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4SCFIUMTBYEYM56OJDDB5QWLNY","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":"44e644d9777f93559d547e4f2f8161f3fc684f517e17934f2d64164acef8ab0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-10T01:41:22Z","title_canon_sha256":"0b1eb17db5c7a88bbf3cf5db346759982f93756e20abdaca4581fd28431b5aca"},"schema_version":"1.0","source":{"id":"1904.04970","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04970","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04970v1","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04970","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"4SCFIUMTBYEY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4SCFIUMTBYEYM56O","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4SCFIUMT","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:01095fa8be898fd36d3519588c5973f243f31364f78e1bc436b0a97d28b80592","target":"graph","created_at":"2026-05-17T23:48:54Z","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":"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","authors_text":"Hong-Jian Lai, Huicai Jia, Ju Zhou, Ruifang Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-10T01:41:22Z","title":"Vertex-connectivity and $Q$-index of graphs with fixed girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04970","kind":"arxiv","version":1},"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:24f02165c3dff6819dd4c5af5307ded131900c9267bf815363c707d6e386e283","target":"record","created_at":"2026-05-17T23:48:54Z","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":"44e644d9777f93559d547e4f2f8161f3fc684f517e17934f2d64164acef8ab0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-10T01:41:22Z","title_canon_sha256":"0b1eb17db5c7a88bbf3cf5db346759982f93756e20abdaca4581fd28431b5aca"},"schema_version":"1.0","source":{"id":"1904.04970","kind":"arxiv","version":1}},"canonical_sha256":"e4845451930e098677ce48c61ec2cb6e09a533d291891fb3c1a92d8be6e18811","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4845451930e098677ce48c61ec2cb6e09a533d291891fb3c1a92d8be6e18811","first_computed_at":"2026-05-17T23:48:54.570645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:54.570645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p5a8AipfxB4L+yLv5jZ+1k9fcz1Tla3DofrEVQViMrzzRL01SCPEyOjM5e8l8ZIXRG+PGOn8BIbSRjO4GZBlDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:54.571157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04970","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24f02165c3dff6819dd4c5af5307ded131900c9267bf815363c707d6e386e283","sha256:01095fa8be898fd36d3519588c5973f243f31364f78e1bc436b0a97d28b80592"],"state_sha256":"b3ba98c6084e475b9631076e03897c8e12676698335f06acad3135a64991f047"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SB+G8rfY5QveTdZUD9LV+QsTMNYGYYzhfdSNLozm38ntvvbrHMF9PlPWqqoY8KCsgPRn+fA5D5dT50rooRxbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:32:25.076244Z","bundle_sha256":"c587d652fa53b3ba27c9e7bcbccb7ea1d8841cfee98c1ee61e4d68a804a58fdb"}}