{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LORXQV3GKVNXW43B2GASBHOLEE","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":"6eb8361f6c492f12c3200c7bfcd98fd1e92301123bc2f9edb9150252714119c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T01:54:56Z","title_canon_sha256":"20cac42c9890725d5c6199b7e6de121f9b57b0f5044f835b1cdb0e6b0ae3371b"},"schema_version":"1.0","source":{"id":"1907.07837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07837","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07837v1","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07837","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"pith_short_12","alias_value":"LORXQV3GKVNX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LORXQV3GKVNXW43B","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LORXQV3G","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:f8ad0818de433bc20429a17531a5be4b7bf4bada78b9d3cf7db3b22b3eebe833","target":"graph","created_at":"2026-05-17T23:40:16Z","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":"A signed graph $(G, \\sigma)$ is a graph with a sign attached to each of its edges, where $G$ is the underlying graph of $(G, \\sigma)$. Let $c(G)$, $\\alpha(G)$ and $r(G, \\sigma)$ be the cyclomatic number, the independence number and the rank of the adjacency matrix of $(G, \\sigma)$, respectively. In this paper, we study the relation among the independence number, the rank and the cyclomatic number of a signed graph $(G, \\sigma)$ with order $n$, and prove that $2n-2c(G) \\leq r(G, \\sigma)+2\\alpha(G) \\leq 2n$. Furthermore, the signed graphs that reaching the lower bound are investigated.","authors_text":"Rong-Xia Hao, Shengjie He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T01:54:56Z","title":"The relation between the independence number and rank of a signed graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07837","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:d008ad1174f96b20aad6ebedf28c3fface83963b3111a430a3d054ecb7ff4243","target":"record","created_at":"2026-05-17T23:40:16Z","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":"6eb8361f6c492f12c3200c7bfcd98fd1e92301123bc2f9edb9150252714119c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T01:54:56Z","title_canon_sha256":"20cac42c9890725d5c6199b7e6de121f9b57b0f5044f835b1cdb0e6b0ae3371b"},"schema_version":"1.0","source":{"id":"1907.07837","kind":"arxiv","version":1}},"canonical_sha256":"5ba3785766555b7b7361d181209dcb21345240496a0008deb562afed380d9750","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ba3785766555b7b7361d181209dcb21345240496a0008deb562afed380d9750","first_computed_at":"2026-05-17T23:40:16.042047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:16.042047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AvHbJhB5n5uSq4EAssyTHdjMLqVHkS7K0yRRqWHYtagpjU6jZUEMOVgV49kLOm3sZYXfz24t1tgVlxwQbmhLCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:16.042673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d008ad1174f96b20aad6ebedf28c3fface83963b3111a430a3d054ecb7ff4243","sha256:f8ad0818de433bc20429a17531a5be4b7bf4bada78b9d3cf7db3b22b3eebe833"],"state_sha256":"b3a58904c7a1e1854dbd44a97cf100edf783dfe34f4d1596adfc30fa1c54ffd5"}