{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UJGP36YOIH64DIXZTNJIF6MYOA","short_pith_number":"pith:UJGP36YO","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"},"canonical_sha256":"a24cfdfb0e41fdc1a2f99b5282f998702f4921ca02709766bfe499aeb55c0227","source":{"kind":"arxiv","id":"1903.02929","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02929","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02929v2","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02929","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"UJGP36YOIH64","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UJGP36YOIH64DIXZ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UJGP36YO","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UJGP36YOIH64DIXZTNJIF6MYOA","target":"record","payload":{"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"},"canonical_sha256":"a24cfdfb0e41fdc1a2f99b5282f998702f4921ca02709766bfe499aeb55c0227","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"},"source_kind":"arxiv","source_id":"1903.02929","source_version":2,"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:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xDKdlH/jQhPfrngWUN5RccQTW0apwsqiQDFDYR0sKm1xIUx+ZwWDLYMqhvGoemd8k+cCxSGmvHS1GIcSQDaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:33:22.958834Z"},"content_sha256":"5cceaa6232155a2dfc95193d3a5d77e502de15efa8af3e7550d201673b7cfa61","schema_version":"1.0","event_id":"sha256:5cceaa6232155a2dfc95193d3a5d77e502de15efa8af3e7550d201673b7cfa61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UJGP36YOIH64DIXZTNJIF6MYOA","target":"graph","payload":{"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"},"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:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8J38Mh2eaDoULw00/TFkWhhOwccPdUocB7ILiwLmjijAsc9JYKz/VDOyIlOEYRZCiPgrf9E8R4JZ06xy5BLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:33:22.959191Z"},"content_sha256":"ee474e35dc1a5a9b80b1d5b915b0e0f75733b41b86073b02aaeed2e1aea94db8","schema_version":"1.0","event_id":"sha256:ee474e35dc1a5a9b80b1d5b915b0e0f75733b41b86073b02aaeed2e1aea94db8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA/bundle.json","state_url":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJGP36YOIH64DIXZTNJIF6MYOA/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-05-31T06:33:22Z","links":{"resolver":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA","bundle":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA/bundle.json","state":"https://pith.science/pith/UJGP36YOIH64DIXZTNJIF6MYOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJGP36YOIH64DIXZTNJIF6MYOA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UJGP36YOIH64DIXZTNJIF6MYOA","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":"ab3f54eea3036ba473142262f364fd154e8608137898bc37adb8b641d7e40693","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-07T14:18:29Z","title_canon_sha256":"bfd06d303be3542e08c18490c11d8d8b4c46948d32503b665217add6debeaa12"},"schema_version":"1.0","source":{"id":"1903.02929","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02929","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02929v2","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02929","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"UJGP36YOIH64","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UJGP36YOIH64DIXZ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UJGP36YO","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:ee474e35dc1a5a9b80b1d5b915b0e0f75733b41b86073b02aaeed2e1aea94db8","target":"graph","created_at":"2026-05-17T23:51:41Z","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":"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","authors_text":"Jiming Guo, Zhiwen Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-07T14:18:29Z","title":"On the rank (nullity) of a connected graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02929","kind":"arxiv","version":2},"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:5cceaa6232155a2dfc95193d3a5d77e502de15efa8af3e7550d201673b7cfa61","target":"record","created_at":"2026-05-17T23:51:41Z","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":"ab3f54eea3036ba473142262f364fd154e8608137898bc37adb8b641d7e40693","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-07T14:18:29Z","title_canon_sha256":"bfd06d303be3542e08c18490c11d8d8b4c46948d32503b665217add6debeaa12"},"schema_version":"1.0","source":{"id":"1903.02929","kind":"arxiv","version":2}},"canonical_sha256":"a24cfdfb0e41fdc1a2f99b5282f998702f4921ca02709766bfe499aeb55c0227","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a24cfdfb0e41fdc1a2f99b5282f998702f4921ca02709766bfe499aeb55c0227","first_computed_at":"2026-05-17T23:51:41.515628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:41.515628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eMe5Nj8IxvifH0cGQZnJDLH9YVZYmco+gkSh64/XlbcA3Cu5tY14q7o1MWtZzxQ9nBkYumHpRI8c3JVEfJQYCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:41.516341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02929","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cceaa6232155a2dfc95193d3a5d77e502de15efa8af3e7550d201673b7cfa61","sha256:ee474e35dc1a5a9b80b1d5b915b0e0f75733b41b86073b02aaeed2e1aea94db8"],"state_sha256":"78db5c6d2cfddfdb511d9659534daef34832ca13635e7c3ee877b05c9fa4e177"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32dmWDz6yXM50qkbgsIKmfkAnitkNcPzqgrc2nNNnjK9vng7i5FpVY9KIP75gaKdezK2iBrEJ9kMPkN5pU5RDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:33:22.961444Z","bundle_sha256":"27fe01eb08a0e24d843e40514d3517a49fe882bbae9622a83f43f6888529d800"}}