{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GARPS3K7ZZPFCUB6N2I2U2O63M","short_pith_number":"pith:GARPS3K7","schema_version":"1.0","canonical_sha256":"3022f96d5fce5e51503e6e91aa69dedb3f5c7c6b6db4ec7d933e64964d1e9d3e","source":{"kind":"arxiv","id":"1708.07118","version":1},"attestation_state":"computed","paper":{"title":"Some Criteria for a Signed Graph to Have Full Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Ghafari, K. Kazemian, M. Nahvi, S. Akbari","submitted_at":"2017-08-23T17:46:26Z","abstract_excerpt":"A weighted graph $G^{\\omega}$ consists of a simple graph $G$ with a weight $\\omega$, which is a mapping,$\\omega$: $E(G)\\rightarrow\\mathbb{Z}\\backslash\\{0\\}$. A signed graph is a graph whose edges are labeled with $-1$ or $1$. In this paper, we characterize graphs which have a sign such that their signed adjacency matrix has full rank, and graphs which have a weight such that their weighted adjacency matrix does not have full rank. We show that for any arbitrary simple graph $G$, there is a sign $\\sigma$ so that $G^{\\sigma}$ has full rank if and only if $G$ has a $\\{1,2\\}$-factor. We also show "},"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":"1708.07118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-23T17:46:26Z","cross_cats_sorted":[],"title_canon_sha256":"b6c4709b494ea68bf15f310e8e89670ad423c005e963b8b95e4c187f264970fc","abstract_canon_sha256":"95a7cd3787dae360e3cac448c29c5f6588e3b136ad94ecb3e64feafd01c8eb2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:48.354851Z","signature_b64":"PuSoPievuO4MmR8FkUKurQMDRkrn8YXzrliDRRePam4nreExaHVjBdJVlZZF29DLINqDIMo/sTIxhGq5pGB+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3022f96d5fce5e51503e6e91aa69dedb3f5c7c6b6db4ec7d933e64964d1e9d3e","last_reissued_at":"2026-05-18T00:36:48.354187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:48.354187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Criteria for a Signed Graph to Have Full Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Ghafari, K. Kazemian, M. Nahvi, S. Akbari","submitted_at":"2017-08-23T17:46:26Z","abstract_excerpt":"A weighted graph $G^{\\omega}$ consists of a simple graph $G$ with a weight $\\omega$, which is a mapping,$\\omega$: $E(G)\\rightarrow\\mathbb{Z}\\backslash\\{0\\}$. A signed graph is a graph whose edges are labeled with $-1$ or $1$. In this paper, we characterize graphs which have a sign such that their signed adjacency matrix has full rank, and graphs which have a weight such that their weighted adjacency matrix does not have full rank. We show that for any arbitrary simple graph $G$, there is a sign $\\sigma$ so that $G^{\\sigma}$ has full rank if and only if $G$ has a $\\{1,2\\}$-factor. We also show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07118","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.07118","created_at":"2026-05-18T00:36:48.354282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07118v1","created_at":"2026-05-18T00:36:48.354282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07118","created_at":"2026-05-18T00:36:48.354282+00:00"},{"alias_kind":"pith_short_12","alias_value":"GARPS3K7ZZPF","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GARPS3K7ZZPFCUB6","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GARPS3K7","created_at":"2026-05-18T12:31:15.632608+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/GARPS3K7ZZPFCUB6N2I2U2O63M","json":"https://pith.science/pith/GARPS3K7ZZPFCUB6N2I2U2O63M.json","graph_json":"https://pith.science/api/pith-number/GARPS3K7ZZPFCUB6N2I2U2O63M/graph.json","events_json":"https://pith.science/api/pith-number/GARPS3K7ZZPFCUB6N2I2U2O63M/events.json","paper":"https://pith.science/paper/GARPS3K7"},"agent_actions":{"view_html":"https://pith.science/pith/GARPS3K7ZZPFCUB6N2I2U2O63M","download_json":"https://pith.science/pith/GARPS3K7ZZPFCUB6N2I2U2O63M.json","view_paper":"https://pith.science/paper/GARPS3K7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07118&json=true","fetch_graph":"https://pith.science/api/pith-number/GARPS3K7ZZPFCUB6N2I2U2O63M/graph.json","fetch_events":"https://pith.science/api/pith-number/GARPS3K7ZZPFCUB6N2I2U2O63M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GARPS3K7ZZPFCUB6N2I2U2O63M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GARPS3K7ZZPFCUB6N2I2U2O63M/action/storage_attestation","attest_author":"https://pith.science/pith/GARPS3K7ZZPFCUB6N2I2U2O63M/action/author_attestation","sign_citation":"https://pith.science/pith/GARPS3K7ZZPFCUB6N2I2U2O63M/action/citation_signature","submit_replication":"https://pith.science/pith/GARPS3K7ZZPFCUB6N2I2U2O63M/action/replication_record"}},"created_at":"2026-05-18T00:36:48.354282+00:00","updated_at":"2026-05-18T00:36:48.354282+00:00"}