{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7XMJP4VNV4ZQHKWMMTTY2QEKIJ","short_pith_number":"pith:7XMJP4VN","schema_version":"1.0","canonical_sha256":"fdd897f2adaf3303aacc64e78d408a427140dc5cd34aa74a4d569bcb8163baed","source":{"kind":"arxiv","id":"1406.0482","version":2},"attestation_state":"computed","paper":{"title":"Bounds for the Zero-Forcing Number of Graphs with Large Girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Franklin Kenter, Randy Davila","submitted_at":"2014-06-02T19:23:43Z","abstract_excerpt":"We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, $\\delta \\le Z(G)$ where $\\delta$ is the minimum degree, in the triangle-free case. In particular, we show that $2 \\delta - 2 \\le Z(G)$ for graphs with girth of at least 5, and this can be further improved when $G$ has a small cut set. Using these results, we are able to prove the Graph Complement Conjecture on minimum rank for a large class of graphs. Lastly, we make a conjecture that the lower bound for $Z(G)$ increases as a function of the girth, $g$, and $\\delta$."},"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":"1406.0482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-02T19:23:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c4c8813ac6c4575ac5b43b1be0a48666950c22d22767eecc950f6eaaf8e33235","abstract_canon_sha256":"c4feeb391aee13ce8d64eb9cf1c18d32cf3e9c025b56d9d1df1b751b6d6c1e82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:53.355122Z","signature_b64":"GmANZtMWyMDQvuEeqbk0tWDP5YbyRCaeJwprVM5/TrUGxA4JbL/9UBK0aXqCM1nXsLApc+pVjNinpLEVZJb2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdd897f2adaf3303aacc64e78d408a427140dc5cd34aa74a4d569bcb8163baed","last_reissued_at":"2026-05-18T02:49:53.354591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:53.354591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds for the Zero-Forcing Number of Graphs with Large Girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Franklin Kenter, Randy Davila","submitted_at":"2014-06-02T19:23:43Z","abstract_excerpt":"We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, $\\delta \\le Z(G)$ where $\\delta$ is the minimum degree, in the triangle-free case. In particular, we show that $2 \\delta - 2 \\le Z(G)$ for graphs with girth of at least 5, and this can be further improved when $G$ has a small cut set. Using these results, we are able to prove the Graph Complement Conjecture on minimum rank for a large class of graphs. Lastly, we make a conjecture that the lower bound for $Z(G)$ increases as a function of the girth, $g$, and $\\delta$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0482","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":""},"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":"1406.0482","created_at":"2026-05-18T02:49:53.354668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0482v2","created_at":"2026-05-18T02:49:53.354668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0482","created_at":"2026-05-18T02:49:53.354668+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XMJP4VNV4ZQ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XMJP4VNV4ZQHKWM","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XMJP4VN","created_at":"2026-05-18T12:28:19.803747+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/7XMJP4VNV4ZQHKWMMTTY2QEKIJ","json":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ.json","graph_json":"https://pith.science/api/pith-number/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/graph.json","events_json":"https://pith.science/api/pith-number/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/events.json","paper":"https://pith.science/paper/7XMJP4VN"},"agent_actions":{"view_html":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ","download_json":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ.json","view_paper":"https://pith.science/paper/7XMJP4VN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0482&json=true","fetch_graph":"https://pith.science/api/pith-number/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/action/storage_attestation","attest_author":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/action/author_attestation","sign_citation":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/action/citation_signature","submit_replication":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/action/replication_record"}},"created_at":"2026-05-18T02:49:53.354668+00:00","updated_at":"2026-05-18T02:49:53.354668+00:00"}