{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SLRTUIFABOSPDEB6KYJSLBMX2O","short_pith_number":"pith:SLRTUIFA","schema_version":"1.0","canonical_sha256":"92e33a20a00ba4f1903e5613258597d39238c6110d167edbaa7a5d4450802ddf","source":{"kind":"arxiv","id":"2410.21724","version":2},"attestation_state":"computed","paper":{"title":"Zero Forcing and Vertex Independence Number on Cubic and Subcubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Houston Schuerger, Michael Young, Nathan Warnberg","submitted_at":"2024-10-29T04:23:10Z","abstract_excerpt":"Motivated by a conjecture from the automated conjecturing program TxGraffiti, in this paper the relationship between the zero forcing number, $Z(G)$, and the vertex independence number, $\\alpha(G)$, of cubic and subcubic graphs is explored. TxGraffiti conjectures that for all connected cubic graphs $G$, that are not $K_4$, $Z(G) \\leq \\alpha(G) + 1$. This work uses decycling partitions of upper-embeddable graphs to show that almost all cubic graphs satisfy $Z(G) \\leq \\alpha(G) + 2$, provides an infinite family of cubic graphs where $Z(G) = \\alpha(G) + 1$, and extends known bounds to subcubic gr"},"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":"2410.21724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-29T04:23:10Z","cross_cats_sorted":[],"title_canon_sha256":"e5e0b7ede689ea1821a2903939a010cfc358a662c1aacc02fa8d4e68a188d371","abstract_canon_sha256":"8a8987f3c3875bf018dd528b271e584d0482badcf679577b8d9259c2d126d0e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:35.023872Z","signature_b64":"YTI55oiy/pMIfUA+YTEmp1+DkKg/RptdsOYeaggE35F48j9f2oOqf0VsNMdKOrQn+O8l+oEk8iLFngkeSu0VDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92e33a20a00ba4f1903e5613258597d39238c6110d167edbaa7a5d4450802ddf","last_reissued_at":"2026-07-05T09:29:35.023391Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:35.023391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero Forcing and Vertex Independence Number on Cubic and Subcubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Houston Schuerger, Michael Young, Nathan Warnberg","submitted_at":"2024-10-29T04:23:10Z","abstract_excerpt":"Motivated by a conjecture from the automated conjecturing program TxGraffiti, in this paper the relationship between the zero forcing number, $Z(G)$, and the vertex independence number, $\\alpha(G)$, of cubic and subcubic graphs is explored. TxGraffiti conjectures that for all connected cubic graphs $G$, that are not $K_4$, $Z(G) \\leq \\alpha(G) + 1$. This work uses decycling partitions of upper-embeddable graphs to show that almost all cubic graphs satisfy $Z(G) \\leq \\alpha(G) + 2$, provides an infinite family of cubic graphs where $Z(G) = \\alpha(G) + 1$, and extends known bounds to subcubic gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21724","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.21724/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.21724","created_at":"2026-07-05T09:29:35.023462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.21724v2","created_at":"2026-07-05T09:29:35.023462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21724","created_at":"2026-07-05T09:29:35.023462+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLRTUIFABOSP","created_at":"2026-07-05T09:29:35.023462+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLRTUIFABOSPDEB6","created_at":"2026-07-05T09:29:35.023462+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLRTUIFA","created_at":"2026-07-05T09:29:35.023462+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17780","citing_title":"In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SLRTUIFABOSPDEB6KYJSLBMX2O","json":"https://pith.science/pith/SLRTUIFABOSPDEB6KYJSLBMX2O.json","graph_json":"https://pith.science/api/pith-number/SLRTUIFABOSPDEB6KYJSLBMX2O/graph.json","events_json":"https://pith.science/api/pith-number/SLRTUIFABOSPDEB6KYJSLBMX2O/events.json","paper":"https://pith.science/paper/SLRTUIFA"},"agent_actions":{"view_html":"https://pith.science/pith/SLRTUIFABOSPDEB6KYJSLBMX2O","download_json":"https://pith.science/pith/SLRTUIFABOSPDEB6KYJSLBMX2O.json","view_paper":"https://pith.science/paper/SLRTUIFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.21724&json=true","fetch_graph":"https://pith.science/api/pith-number/SLRTUIFABOSPDEB6KYJSLBMX2O/graph.json","fetch_events":"https://pith.science/api/pith-number/SLRTUIFABOSPDEB6KYJSLBMX2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLRTUIFABOSPDEB6KYJSLBMX2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLRTUIFABOSPDEB6KYJSLBMX2O/action/storage_attestation","attest_author":"https://pith.science/pith/SLRTUIFABOSPDEB6KYJSLBMX2O/action/author_attestation","sign_citation":"https://pith.science/pith/SLRTUIFABOSPDEB6KYJSLBMX2O/action/citation_signature","submit_replication":"https://pith.science/pith/SLRTUIFABOSPDEB6KYJSLBMX2O/action/replication_record"}},"created_at":"2026-07-05T09:29:35.023462+00:00","updated_at":"2026-07-05T09:29:35.023462+00:00"}