{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UJGP36YOIH64DIXZTNJIF6MYOA","short_pith_number":"pith:UJGP36YO","schema_version":"1.0","canonical_sha256":"a24cfdfb0e41fdc1a2f99b5282f998702f4921ca02709766bfe499aeb55c0227","source":{"kind":"arxiv","id":"1903.02929","version":2},"attestation_state":"computed","paper":{"title":"On the rank (nullity) of a connected graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiming Guo, Zhiwen Wang","submitted_at":"2019-03-07T14:18:29Z","abstract_excerpt":"The rank $r(G)$ of a graph $G$ is the rank of its adjacency matrix $A(G)$ and the nullity $\\eta(G)$ of $G$ is the multiplicity of $0$ as an eigenvalue of $A(G)$. In this paper, we prove that if $G$ is a connected graph of order $n$ with rank $r$, then $G$ contains a nonsingular connected induced subgraph of order $r$. As an application of the result, we completely solve the following problem posed by Zhou, Wong and Sun in [Linear Algebra and its Applications, 555 (2018) 314-320]: Let $G$ be a connected graph of order $n$ with nullity $\\eta(G)$ and the maximum degree $\\Delta$. Then $$\\eta(G)\\le"},"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":"1903.02929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-07T14:18:29Z","cross_cats_sorted":[],"title_canon_sha256":"bfd06d303be3542e08c18490c11d8d8b4c46948d32503b665217add6debeaa12","abstract_canon_sha256":"ab3f54eea3036ba473142262f364fd154e8608137898bc37adb8b641d7e40693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:41.516341Z","signature_b64":"eMe5Nj8IxvifH0cGQZnJDLH9YVZYmco+gkSh64/XlbcA3Cu5tY14q7o1MWtZzxQ9nBkYumHpRI8c3JVEfJQYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a24cfdfb0e41fdc1a2f99b5282f998702f4921ca02709766bfe499aeb55c0227","last_reissued_at":"2026-05-17T23:51:41.515628Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:41.515628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the rank (nullity) of a connected graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiming Guo, Zhiwen Wang","submitted_at":"2019-03-07T14:18:29Z","abstract_excerpt":"The rank $r(G)$ of a graph $G$ is the rank of its adjacency matrix $A(G)$ and the nullity $\\eta(G)$ of $G$ is the multiplicity of $0$ as an eigenvalue of $A(G)$. In this paper, we prove that if $G$ is a connected graph of order $n$ with rank $r$, then $G$ contains a nonsingular connected induced subgraph of order $r$. As an application of the result, we completely solve the following problem posed by Zhou, Wong and Sun in [Linear Algebra and its Applications, 555 (2018) 314-320]: Let $G$ be a connected graph of order $n$ with nullity $\\eta(G)$ and the maximum degree $\\Delta$. Then $$\\eta(G)\\le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02929","kind":"arxiv","version":2},"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":"1903.02929","created_at":"2026-05-17T23:51:41.515733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02929v2","created_at":"2026-05-17T23:51:41.515733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02929","created_at":"2026-05-17T23:51:41.515733+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJGP36YOIH64","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJGP36YOIH64DIXZ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJGP36YO","created_at":"2026-05-18T12:33:30.264802+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/UJGP36YOIH64DIXZTNJIF6MYOA","json":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA.json","graph_json":"https://pith.science/api/pith-number/UJGP36YOIH64DIXZTNJIF6MYOA/graph.json","events_json":"https://pith.science/api/pith-number/UJGP36YOIH64DIXZTNJIF6MYOA/events.json","paper":"https://pith.science/paper/UJGP36YO"},"agent_actions":{"view_html":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA","download_json":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA.json","view_paper":"https://pith.science/paper/UJGP36YO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02929&json=true","fetch_graph":"https://pith.science/api/pith-number/UJGP36YOIH64DIXZTNJIF6MYOA/graph.json","fetch_events":"https://pith.science/api/pith-number/UJGP36YOIH64DIXZTNJIF6MYOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA/action/storage_attestation","attest_author":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA/action/author_attestation","sign_citation":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA/action/citation_signature","submit_replication":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA/action/replication_record"}},"created_at":"2026-05-17T23:51:41.515733+00:00","updated_at":"2026-05-17T23:51:41.515733+00:00"}