{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CIBZKBKSRMDWGEIR7QELB4GAC3","short_pith_number":"pith:CIBZKBKS","schema_version":"1.0","canonical_sha256":"12039505528b07631111fc08b0f0c016d5ac4899a694df30e82b40299a365087","source":{"kind":"arxiv","id":"1705.08365","version":1},"attestation_state":"computed","paper":{"title":"A Short Proof for a Lower Bound on the Zero Forcing Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, M. F\\\"urst","submitted_at":"2017-05-23T15:32:53Z","abstract_excerpt":"We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number $Z(G)$ of a graph $G$. More specifically, we show that $Z(G)\\geq (g-2)(\\delta-2)+2$ for every graph $G$ of girth $g$ at least $3$ and minimum degree $\\delta$ at least $2$."},"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.08365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T15:32:53Z","cross_cats_sorted":[],"title_canon_sha256":"86ddcab34a185938d285b9d2ae236a127b8686171ea6e89d996ce1dc4e5673ea","abstract_canon_sha256":"c4ce40e55494aaf5287b208f9bbfd7856509132948a4da79e4cb557f9d907a93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:48.461542Z","signature_b64":"A1Bo3hBDL4Oq2ZkNHSOPKguhS4Jp4/me9xeZx2vowv5uCU4jL8HdZ532qyaLOPa4ZIbKkpuUOs+vu8zbwsvVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12039505528b07631111fc08b0f0c016d5ac4899a694df30e82b40299a365087","last_reissued_at":"2026-05-18T00:43:48.460996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:48.460996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Short Proof for a Lower Bound on the Zero Forcing Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, M. F\\\"urst","submitted_at":"2017-05-23T15:32:53Z","abstract_excerpt":"We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number $Z(G)$ of a graph $G$. More specifically, we show that $Z(G)\\geq (g-2)(\\delta-2)+2$ for every graph $G$ of girth $g$ at least $3$ and minimum degree $\\delta$ at least $2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08365","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.08365","created_at":"2026-05-18T00:43:48.461060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08365v1","created_at":"2026-05-18T00:43:48.461060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08365","created_at":"2026-05-18T00:43:48.461060+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIBZKBKSRMDW","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIBZKBKSRMDWGEIR","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIBZKBKS","created_at":"2026-05-18T12:31:10.602751+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/CIBZKBKSRMDWGEIR7QELB4GAC3","json":"https://pith.science/pith/CIBZKBKSRMDWGEIR7QELB4GAC3.json","graph_json":"https://pith.science/api/pith-number/CIBZKBKSRMDWGEIR7QELB4GAC3/graph.json","events_json":"https://pith.science/api/pith-number/CIBZKBKSRMDWGEIR7QELB4GAC3/events.json","paper":"https://pith.science/paper/CIBZKBKS"},"agent_actions":{"view_html":"https://pith.science/pith/CIBZKBKSRMDWGEIR7QELB4GAC3","download_json":"https://pith.science/pith/CIBZKBKSRMDWGEIR7QELB4GAC3.json","view_paper":"https://pith.science/paper/CIBZKBKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08365&json=true","fetch_graph":"https://pith.science/api/pith-number/CIBZKBKSRMDWGEIR7QELB4GAC3/graph.json","fetch_events":"https://pith.science/api/pith-number/CIBZKBKSRMDWGEIR7QELB4GAC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIBZKBKSRMDWGEIR7QELB4GAC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIBZKBKSRMDWGEIR7QELB4GAC3/action/storage_attestation","attest_author":"https://pith.science/pith/CIBZKBKSRMDWGEIR7QELB4GAC3/action/author_attestation","sign_citation":"https://pith.science/pith/CIBZKBKSRMDWGEIR7QELB4GAC3/action/citation_signature","submit_replication":"https://pith.science/pith/CIBZKBKSRMDWGEIR7QELB4GAC3/action/replication_record"}},"created_at":"2026-05-18T00:43:48.461060+00:00","updated_at":"2026-05-18T00:43:48.461060+00:00"}