{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TXM42VX76LNCFMUTPGCEVLXKWA","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":"af694a0280eb1585bf717a39eefc5408b2e29dbff41e7f55f987e0a3be234f6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-27T06:32:00Z","title_canon_sha256":"75d286c6f1bf4f4fa0db134503ecd488befbe8493b6d8d2d1c938b7c62c979b9"},"schema_version":"1.0","source":{"id":"1705.09773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09773","created_at":"2026-05-18T00:43:34Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09773v1","created_at":"2026-05-18T00:43:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09773","created_at":"2026-05-18T00:43:34Z"},{"alias_kind":"pith_short_12","alias_value":"TXM42VX76LNC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TXM42VX76LNCFMUT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TXM42VX7","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:d0df4d3d0f611ec65b56d2c10a22a67890d1f85b89e8d7810dae45f071df6660","target":"graph","created_at":"2026-05-18T00:43:34Z","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 $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 ","authors_text":"Ebrahim Vatandoost, Saieed Akbari, Yasser Golkhandy Pour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-27T06:32:00Z","title":"Maximum nullity and zero forcing number on cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09773","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:b3d0b15864c29f0aa2862392361612069edec7bc85c45cef6855e2af7c4db488","target":"record","created_at":"2026-05-18T00:43:34Z","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":"af694a0280eb1585bf717a39eefc5408b2e29dbff41e7f55f987e0a3be234f6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-27T06:32:00Z","title_canon_sha256":"75d286c6f1bf4f4fa0db134503ecd488befbe8493b6d8d2d1c938b7c62c979b9"},"schema_version":"1.0","source":{"id":"1705.09773","kind":"arxiv","version":1}},"canonical_sha256":"9dd9cd56fff2da22b29379844aaeeab01270e0493187a7830952f3bdba112b75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dd9cd56fff2da22b29379844aaeeab01270e0493187a7830952f3bdba112b75","first_computed_at":"2026-05-18T00:43:34.493333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:34.493333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m0EjcBr6nPRQQ5CjNjXQvl3c++ZNCfai9y8FzZfz64VsuxQ3f8l6haPawDKRK1E7yg8QQmAxK50DWOWO4n2TBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:34.493886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3d0b15864c29f0aa2862392361612069edec7bc85c45cef6855e2af7c4db488","sha256:d0df4d3d0f611ec65b56d2c10a22a67890d1f85b89e8d7810dae45f071df6660"],"state_sha256":"6c4b82cd0adb128c2e9e485c44ce137b26f7648ec97de86afdf3d64279ad06d8"}