{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PKJRW6AGF36E6TJJJNQFEGQKKC","short_pith_number":"pith:PKJRW6AG","schema_version":"1.0","canonical_sha256":"7a931b78062efc4f4d294b60521a0a50ab22819fc6a16e3b14d34102d27d83bb","source":{"kind":"arxiv","id":"1611.06557","version":4},"attestation_state":"computed","paper":{"title":"A lower bound on the zero forcing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Randy Davila, Sudeep Stephen, Thomas Kalinowski","submitted_at":"2016-11-20T18:09:51Z","abstract_excerpt":"In this note, we study a dynamic vertex coloring for a graph $G$. In particular, one starts with a certain set of vertices black, and all other vertices white. Then, at each time step, a black vertex with exactly one white neighbor forces its white neighbor to become black. The initial set of black vertices is called a \\emph{zero forcing set} if by iterating this process, all of the vertices in $G$ become black. The \\emph{zero forcing number} of $G$ is the minimum cardinality of a zero forcing set in $G$, and is denoted by $Z(G)$. Davila and Kenter have conjectured in 2015 that $Z(G)\\geq (g-3)"},"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":"1611.06557","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-20T18:09:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"33479707be12ca069aaa4e9badfe97a44f153b87b6012cf2088d5d5f3455abdd","abstract_canon_sha256":"2aedc8b3bf01be4dc8e8538e549a5e3c24faf1850f3d6e887dde8f8c01de6cfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:49.205427Z","signature_b64":"rogCRqzB3uv4N/kEzpszoLOijHFue/ST7joXEbzP5a/Y5HcmInuJ4wnQhHnZ82yPTwd4SfbsMgOTVBdH5EohBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a931b78062efc4f4d294b60521a0a50ab22819fc6a16e3b14d34102d27d83bb","last_reissued_at":"2026-05-18T00:01:49.204653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:49.204653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on the zero forcing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Randy Davila, Sudeep Stephen, Thomas Kalinowski","submitted_at":"2016-11-20T18:09:51Z","abstract_excerpt":"In this note, we study a dynamic vertex coloring for a graph $G$. In particular, one starts with a certain set of vertices black, and all other vertices white. Then, at each time step, a black vertex with exactly one white neighbor forces its white neighbor to become black. The initial set of black vertices is called a \\emph{zero forcing set} if by iterating this process, all of the vertices in $G$ become black. The \\emph{zero forcing number} of $G$ is the minimum cardinality of a zero forcing set in $G$, and is denoted by $Z(G)$. Davila and Kenter have conjectured in 2015 that $Z(G)\\geq (g-3)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06557","kind":"arxiv","version":4},"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":"1611.06557","created_at":"2026-05-18T00:01:49.204777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06557v4","created_at":"2026-05-18T00:01:49.204777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06557","created_at":"2026-05-18T00:01:49.204777+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKJRW6AGF36E","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKJRW6AGF36E6TJJ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKJRW6AG","created_at":"2026-05-18T12:30:39.010887+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/PKJRW6AGF36E6TJJJNQFEGQKKC","json":"https://pith.science/pith/PKJRW6AGF36E6TJJJNQFEGQKKC.json","graph_json":"https://pith.science/api/pith-number/PKJRW6AGF36E6TJJJNQFEGQKKC/graph.json","events_json":"https://pith.science/api/pith-number/PKJRW6AGF36E6TJJJNQFEGQKKC/events.json","paper":"https://pith.science/paper/PKJRW6AG"},"agent_actions":{"view_html":"https://pith.science/pith/PKJRW6AGF36E6TJJJNQFEGQKKC","download_json":"https://pith.science/pith/PKJRW6AGF36E6TJJJNQFEGQKKC.json","view_paper":"https://pith.science/paper/PKJRW6AG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06557&json=true","fetch_graph":"https://pith.science/api/pith-number/PKJRW6AGF36E6TJJJNQFEGQKKC/graph.json","fetch_events":"https://pith.science/api/pith-number/PKJRW6AGF36E6TJJJNQFEGQKKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKJRW6AGF36E6TJJJNQFEGQKKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKJRW6AGF36E6TJJJNQFEGQKKC/action/storage_attestation","attest_author":"https://pith.science/pith/PKJRW6AGF36E6TJJJNQFEGQKKC/action/author_attestation","sign_citation":"https://pith.science/pith/PKJRW6AGF36E6TJJJNQFEGQKKC/action/citation_signature","submit_replication":"https://pith.science/pith/PKJRW6AGF36E6TJJJNQFEGQKKC/action/replication_record"}},"created_at":"2026-05-18T00:01:49.204777+00:00","updated_at":"2026-05-18T00:01:49.204777+00:00"}