{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QUZ5RXVIVBLOCM4KW2IVXBU3HU","short_pith_number":"pith:QUZ5RXVI","schema_version":"1.0","canonical_sha256":"8533d8dea8a856e1338ab6915b869b3d1068d9822ed994bf45b21f84f9854734","source":{"kind":"arxiv","id":"1607.04071","version":1},"attestation_state":"computed","paper":{"title":"On the zero forcing number of corona and lexicographic product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I. Irshad, I. Javaid, M. Batool, Z. Raza","submitted_at":"2016-07-14T10:26:34Z","abstract_excerpt":"The zero forcing number of a graph $G$, denoted by $Z(G)$, is the minimum cardinality of a set $S$ of black vertices (where vertices in $V(G)\\setminus S$ are colored white) such that $V(G)$ is turned black after finitely many applications of $\"$the color change rule$\"$: a white vertex is turned black if it is the only white neighbor of a black vertex. In this paper, we study the zero forcing number of corona product, $G\\odot H$ and lexicographic product, $G\\circ H$ of two graphs $G$ and $H$. It is shown that if $G$ and $H$ are connected graphs of order $n_{1}\\geq2$ and $n_{2}\\geq2$ respectivel"},"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":"1607.04071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-14T10:26:34Z","cross_cats_sorted":[],"title_canon_sha256":"eda30d4fb857ae1e37a2fc4f7c209abb719454172c7bdf9805029de9ffbfcc49","abstract_canon_sha256":"fd8b8d492c6d44a31bbd9331f1a4994ec359bfe217842c7d2dd3b4273692b460"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:36.262487Z","signature_b64":"vRAlWLPIvogSnJq0nWKqZcwftYMs1R5vsFLhd5u/w1d1auesJxc1IX3qJZsBWO95iSmxE1ifXq0uC7o2Ar7UBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8533d8dea8a856e1338ab6915b869b3d1068d9822ed994bf45b21f84f9854734","last_reissued_at":"2026-05-18T00:50:36.261824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:36.261824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the zero forcing number of corona and lexicographic product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I. Irshad, I. Javaid, M. Batool, Z. Raza","submitted_at":"2016-07-14T10:26:34Z","abstract_excerpt":"The zero forcing number of a graph $G$, denoted by $Z(G)$, is the minimum cardinality of a set $S$ of black vertices (where vertices in $V(G)\\setminus S$ are colored white) such that $V(G)$ is turned black after finitely many applications of $\"$the color change rule$\"$: a white vertex is turned black if it is the only white neighbor of a black vertex. In this paper, we study the zero forcing number of corona product, $G\\odot H$ and lexicographic product, $G\\circ H$ of two graphs $G$ and $H$. It is shown that if $G$ and $H$ are connected graphs of order $n_{1}\\geq2$ and $n_{2}\\geq2$ respectivel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04071","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":"1607.04071","created_at":"2026-05-18T00:50:36.261924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04071v1","created_at":"2026-05-18T00:50:36.261924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04071","created_at":"2026-05-18T00:50:36.261924+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUZ5RXVIVBLO","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUZ5RXVIVBLOCM4K","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUZ5RXVI","created_at":"2026-05-18T12:30:41.710351+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/QUZ5RXVIVBLOCM4KW2IVXBU3HU","json":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU.json","graph_json":"https://pith.science/api/pith-number/QUZ5RXVIVBLOCM4KW2IVXBU3HU/graph.json","events_json":"https://pith.science/api/pith-number/QUZ5RXVIVBLOCM4KW2IVXBU3HU/events.json","paper":"https://pith.science/paper/QUZ5RXVI"},"agent_actions":{"view_html":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU","download_json":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU.json","view_paper":"https://pith.science/paper/QUZ5RXVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04071&json=true","fetch_graph":"https://pith.science/api/pith-number/QUZ5RXVIVBLOCM4KW2IVXBU3HU/graph.json","fetch_events":"https://pith.science/api/pith-number/QUZ5RXVIVBLOCM4KW2IVXBU3HU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/action/storage_attestation","attest_author":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/action/author_attestation","sign_citation":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/action/citation_signature","submit_replication":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/action/replication_record"}},"created_at":"2026-05-18T00:50:36.261924+00:00","updated_at":"2026-05-18T00:50:36.261924+00:00"}