{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QUZ5RXVIVBLOCM4KW2IVXBU3HU","short_pith_number":"pith:QUZ5RXVI","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"},"canonical_sha256":"8533d8dea8a856e1338ab6915b869b3d1068d9822ed994bf45b21f84f9854734","source":{"kind":"arxiv","id":"1607.04071","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04071","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04071v1","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04071","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"QUZ5RXVIVBLO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QUZ5RXVIVBLOCM4K","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QUZ5RXVI","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QUZ5RXVIVBLOCM4KW2IVXBU3HU","target":"record","payload":{"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"},"canonical_sha256":"8533d8dea8a856e1338ab6915b869b3d1068d9822ed994bf45b21f84f9854734","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"},"source_kind":"arxiv","source_id":"1607.04071","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MoXkO4PSAuBk1rw8r9MNV7AP/dvhSf4w0GGskK6EboH4lXIUk3jx8oX1q1IlEVEQc0b0UeuDnmbYViz3/pVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:00:20.178567Z"},"content_sha256":"f88b527c7d38ff833b9a2353d6b6891a1c8ac8a8221ac6b08f921ad666751dd8","schema_version":"1.0","event_id":"sha256:f88b527c7d38ff833b9a2353d6b6891a1c8ac8a8221ac6b08f921ad666751dd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QUZ5RXVIVBLOCM4KW2IVXBU3HU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFOOLXqGcbStRM8ojqff3wktO9cvwSxJ9I5xj4EjXAIXyH64MFJaNRXlngQ0iLd5m+zkRYf8f495+H9JBFBsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:00:20.179137Z"},"content_sha256":"c7fff1cfeaa6cfc70203e5568788ddeceb8e5a7e6cb8f3aa618264bddec58d85","schema_version":"1.0","event_id":"sha256:c7fff1cfeaa6cfc70203e5568788ddeceb8e5a7e6cb8f3aa618264bddec58d85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/bundle.json","state_url":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-01T23:00:20Z","links":{"resolver":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU","bundle":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/bundle.json","state":"https://pith.science/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUZ5RXVIVBLOCM4KW2IVXBU3HU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QUZ5RXVIVBLOCM4KW2IVXBU3HU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fd8b8d492c6d44a31bbd9331f1a4994ec359bfe217842c7d2dd3b4273692b460","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-14T10:26:34Z","title_canon_sha256":"eda30d4fb857ae1e37a2fc4f7c209abb719454172c7bdf9805029de9ffbfcc49"},"schema_version":"1.0","source":{"id":"1607.04071","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04071","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04071v1","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04071","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"QUZ5RXVIVBLO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QUZ5RXVIVBLOCM4K","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QUZ5RXVI","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:c7fff1cfeaa6cfc70203e5568788ddeceb8e5a7e6cb8f3aa618264bddec58d85","target":"graph","created_at":"2026-05-18T00:50:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"I. Irshad, I. Javaid, M. Batool, Z. Raza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-14T10:26:34Z","title":"On the zero forcing number of corona and lexicographic product of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04071","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f88b527c7d38ff833b9a2353d6b6891a1c8ac8a8221ac6b08f921ad666751dd8","target":"record","created_at":"2026-05-18T00:50:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fd8b8d492c6d44a31bbd9331f1a4994ec359bfe217842c7d2dd3b4273692b460","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-14T10:26:34Z","title_canon_sha256":"eda30d4fb857ae1e37a2fc4f7c209abb719454172c7bdf9805029de9ffbfcc49"},"schema_version":"1.0","source":{"id":"1607.04071","kind":"arxiv","version":1}},"canonical_sha256":"8533d8dea8a856e1338ab6915b869b3d1068d9822ed994bf45b21f84f9854734","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8533d8dea8a856e1338ab6915b869b3d1068d9822ed994bf45b21f84f9854734","first_computed_at":"2026-05-18T00:50:36.261824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:36.261824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vRAlWLPIvogSnJq0nWKqZcwftYMs1R5vsFLhd5u/w1d1auesJxc1IX3qJZsBWO95iSmxE1ifXq0uC7o2Ar7UBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:36.262487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04071","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f88b527c7d38ff833b9a2353d6b6891a1c8ac8a8221ac6b08f921ad666751dd8","sha256:c7fff1cfeaa6cfc70203e5568788ddeceb8e5a7e6cb8f3aa618264bddec58d85"],"state_sha256":"49025fe5f77c7eee964d4052ab793ccc0deb9d00e881b046c2fcec095f557371"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvJB9qCKW/qMQcoIQpFzmSJpSx6vGNiBc4n43GVX1vS/onat5XuP350ywysZr7Yqc0fQPVFZlHDvyIcE4NqSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:00:20.182125Z","bundle_sha256":"a32a05291971295f8d9b30b5f939fde18576df8c04f5f9a89e41e31b15cf8e2d"}}