{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TXM42VX76LNCFMUTPGCEVLXKWA","short_pith_number":"pith:TXM42VX7","schema_version":"1.0","canonical_sha256":"9dd9cd56fff2da22b29379844aaeeab01270e0493187a7830952f3bdba112b75","source":{"kind":"arxiv","id":"1705.09773","version":1},"attestation_state":"computed","paper":{"title":"Maximum nullity and zero forcing number on cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ebrahim Vatandoost, Saieed Akbari, Yasser Golkhandy Pour","submitted_at":"2017-05-27T06:32:00Z","abstract_excerpt":"Let $G$ be a graph. The maximum nullity of $G$, denoted by $M(G)$, is defined to be the largest possible nullity over all real symmetric matrices $A$ whose $a_{ij}\\neq 0$ for $i\\neq j$, whenever two vertices $u_i$ and $u_j$ of $G$ are adjacent. In this paper, we characterize all cubic graphs with zero forcing number $3$. As a corollary, it is shown that if the zero forcing number is $3$, then $M(G)=3$. In addition, we introduce a family of cubic graphs containing graphs $G$ with $M(G)=Z(G)=4$.\nAlso, we provide an algorithm which make a relation between maximum nullity of $G$ and the number of "},"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":"1705.09773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-27T06:32:00Z","cross_cats_sorted":[],"title_canon_sha256":"75d286c6f1bf4f4fa0db134503ecd488befbe8493b6d8d2d1c938b7c62c979b9","abstract_canon_sha256":"af694a0280eb1585bf717a39eefc5408b2e29dbff41e7f55f987e0a3be234f6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:34.493886Z","signature_b64":"m0EjcBr6nPRQQ5CjNjXQvl3c++ZNCfai9y8FzZfz64VsuxQ3f8l6haPawDKRK1E7yg8QQmAxK50DWOWO4n2TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dd9cd56fff2da22b29379844aaeeab01270e0493187a7830952f3bdba112b75","last_reissued_at":"2026-05-18T00:43:34.493333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:34.493333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum nullity and zero forcing number on cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ebrahim Vatandoost, Saieed Akbari, Yasser Golkhandy Pour","submitted_at":"2017-05-27T06:32:00Z","abstract_excerpt":"Let $G$ be a graph. The maximum nullity of $G$, denoted by $M(G)$, is defined to be the largest possible nullity over all real symmetric matrices $A$ whose $a_{ij}\\neq 0$ for $i\\neq j$, whenever two vertices $u_i$ and $u_j$ of $G$ are adjacent. In this paper, we characterize all cubic graphs with zero forcing number $3$. As a corollary, it is shown that if the zero forcing number is $3$, then $M(G)=3$. In addition, we introduce a family of cubic graphs containing graphs $G$ with $M(G)=Z(G)=4$.\nAlso, we provide an algorithm which make a relation between maximum nullity of $G$ and the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09773","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":"1705.09773","created_at":"2026-05-18T00:43:34.493408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09773v1","created_at":"2026-05-18T00:43:34.493408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09773","created_at":"2026-05-18T00:43:34.493408+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXM42VX76LNC","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXM42VX76LNCFMUT","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXM42VX7","created_at":"2026-05-18T12:31:46.661854+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/TXM42VX76LNCFMUTPGCEVLXKWA","json":"https://pith.science/pith/TXM42VX76LNCFMUTPGCEVLXKWA.json","graph_json":"https://pith.science/api/pith-number/TXM42VX76LNCFMUTPGCEVLXKWA/graph.json","events_json":"https://pith.science/api/pith-number/TXM42VX76LNCFMUTPGCEVLXKWA/events.json","paper":"https://pith.science/paper/TXM42VX7"},"agent_actions":{"view_html":"https://pith.science/pith/TXM42VX76LNCFMUTPGCEVLXKWA","download_json":"https://pith.science/pith/TXM42VX76LNCFMUTPGCEVLXKWA.json","view_paper":"https://pith.science/paper/TXM42VX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09773&json=true","fetch_graph":"https://pith.science/api/pith-number/TXM42VX76LNCFMUTPGCEVLXKWA/graph.json","fetch_events":"https://pith.science/api/pith-number/TXM42VX76LNCFMUTPGCEVLXKWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXM42VX76LNCFMUTPGCEVLXKWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXM42VX76LNCFMUTPGCEVLXKWA/action/storage_attestation","attest_author":"https://pith.science/pith/TXM42VX76LNCFMUTPGCEVLXKWA/action/author_attestation","sign_citation":"https://pith.science/pith/TXM42VX76LNCFMUTPGCEVLXKWA/action/citation_signature","submit_replication":"https://pith.science/pith/TXM42VX76LNCFMUTPGCEVLXKWA/action/replication_record"}},"created_at":"2026-05-18T00:43:34.493408+00:00","updated_at":"2026-05-18T00:43:34.493408+00:00"}