{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VG6PNEZ7OVF2QNIUCTZU6VXFQ3","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":"30a8e34a602107e5816cd6a48aadb557ed394881b650ee2336cd43e8e6ea5cd7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-29T14:07:14Z","title_canon_sha256":"231ae28599c3c89ea8f9fe83aecc841b223d3d420b4aa59e7f837d16b78b02e6"},"schema_version":"1.0","source":{"id":"1711.11448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11448","created_at":"2026-05-18T00:29:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11448v1","created_at":"2026-05-18T00:29:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11448","created_at":"2026-05-18T00:29:11Z"},{"alias_kind":"pith_short_12","alias_value":"VG6PNEZ7OVF2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VG6PNEZ7OVF2QNIU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VG6PNEZ7","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:23030090b191e7705c99a37f5d383f640331a02f21a25a47635fa66a0db10aae","target":"graph","created_at":"2026-05-18T00:29:11Z","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 $\\Phi=(G, \\varphi)$ be a complex unit gain graph (or $\\mathbb{T}$-gain graph) and $A(\\Phi)$ be its adjacency matrix, where $G$ is called the underlying graph of $\\Phi$. The rank of $\\Phi$, denoted by $r(\\Phi)$, is the rank of $A(\\Phi)$. Denote by $\\theta(G)=|E(G)|-|V(G)|+\\omega(G)$ the dimension of cycle spaces of $G$, where $|E(G)|$, $|V(G)|$ and $\\omega(G)$ are the number of edges, the number of vertices and the number of connected components of $G$, respectively. In this paper, we investigate bounds for $r(\\Phi)$ in terms of $r(G)$, that is, $r(G)-2\\theta(G)\\leq r(\\Phi)\\leq r(G)+2\\theta","authors_text":"Ligong Wang, Qiannan Zhou, Yong Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-29T14:07:14Z","title":"The rank of a complex unit gain graph in terms of the rank of its underlying graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11448","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:a82242cb3b6d49467f457e59c9fa4ff571e9406cc747c73074fdfc6806250f44","target":"record","created_at":"2026-05-18T00:29:11Z","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":"30a8e34a602107e5816cd6a48aadb557ed394881b650ee2336cd43e8e6ea5cd7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-29T14:07:14Z","title_canon_sha256":"231ae28599c3c89ea8f9fe83aecc841b223d3d420b4aa59e7f837d16b78b02e6"},"schema_version":"1.0","source":{"id":"1711.11448","kind":"arxiv","version":1}},"canonical_sha256":"a9bcf6933f754ba8351414f34f56e586e7ea394a4a3eef0cb7852f66da13dd4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9bcf6933f754ba8351414f34f56e586e7ea394a4a3eef0cb7852f66da13dd4b","first_computed_at":"2026-05-18T00:29:11.565082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:11.565082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DNpE9jxlEpIQD0V38CW9+EwjtpoWUlLthq/7+kUXyumIoCWRnjR+pZNaYoNT8gFpZe355RTqYzdV+opgZUiACA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:11.565613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.11448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a82242cb3b6d49467f457e59c9fa4ff571e9406cc747c73074fdfc6806250f44","sha256:23030090b191e7705c99a37f5d383f640331a02f21a25a47635fa66a0db10aae"],"state_sha256":"6700f6f3091499d3c143b6deaca69f561f0b0c533029a8223c81d9b5e38b651e"}