{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FRSNX46FY6MHR2RY3TG6SFZJ63","short_pith_number":"pith:FRSNX46F","canonical_record":{"source":{"id":"1702.06711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-22T09:05:38Z","cross_cats_sorted":[],"title_canon_sha256":"4d846a113bb964c0e75045267ce0dde353be1419e2a7ea37e3ebf1731b1c7b45","abstract_canon_sha256":"e9d91d8025b8791dc76dcab8952d2907e91dbd6d91955baada5c5be5e7e29b2c"},"schema_version":"1.0"},"canonical_sha256":"2c64dbf3c5c79878ea38dccde91729f6d6f97384f790b78274c977c805b5e9b8","source":{"kind":"arxiv","id":"1702.06711","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06711","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06711v1","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06711","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"FRSNX46FY6MH","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRSNX46FY6MHR2RY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRSNX46F","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FRSNX46FY6MHR2RY3TG6SFZJ63","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-22T09:05:38Z","cross_cats_sorted":[],"title_canon_sha256":"4d846a113bb964c0e75045267ce0dde353be1419e2a7ea37e3ebf1731b1c7b45","abstract_canon_sha256":"e9d91d8025b8791dc76dcab8952d2907e91dbd6d91955baada5c5be5e7e29b2c"},"schema_version":"1.0"},"canonical_sha256":"2c64dbf3c5c79878ea38dccde91729f6d6f97384f790b78274c977c805b5e9b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:12.871935Z","signature_b64":"2wJpspcit65wzyxKccsKqM6Kmr8BrpATVXRyyuxqs35j7imgE6MGmX/Uql0oAD+ayo3YV2/mKtk+W0McOviTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c64dbf3c5c79878ea38dccde91729f6d6f97384f790b78274c977c805b5e9b8","last_reissued_at":"2026-05-18T00:50:12.871311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:12.871311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06711","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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S079D3VsjcwgYSM91iNCjZtVfAdC65vF6lSyLq7bzP2LdByA7RhADSCemNJAU/lP2ON03trFh1RQBndXcBXaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:31:49.930778Z"},"content_sha256":"76b004e34a8605f52707e02f6b11a766c966aa663f5128448bf698adcf28c393","schema_version":"1.0","event_id":"sha256:76b004e34a8605f52707e02f6b11a766c966aa663f5128448bf698adcf28c393"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FRSNX46FY6MHR2RY3TG6SFZJ63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected zero forcing sets and connected propagation time of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Sheikhhosseni, M. Khosravi, S. Rashidi 2","submitted_at":"2017-02-22T09:05:38Z","abstract_excerpt":"The zero forcing number $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ with colored (black) vertices which forces the set $V(G)$ to be colored (black) after some times. \"color change rule\": a white vertex is changed to a black vertex when it is the only white neighbor of a black vertex. In this case, we say that the black vertex forces the white vertex. We investigate here the concept of connected zero forcing set and connected zero forcing number. We discusses this subject for special graphs and some products of graphs. Also we introduce the connected propagation time. Graphs w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06711","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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTKaTUD3KLfoEe6iJ5Kfg+QZpbVxrB6tWJ8K7rJN8XQl54lelAGKkP8n4F7giw4nkd/1IZo01pHj5TKIHtDDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:31:49.931119Z"},"content_sha256":"09bff199156e14852e5e5bba477dbe32252fffd24eb801d83918c688ef45146c","schema_version":"1.0","event_id":"sha256:09bff199156e14852e5e5bba477dbe32252fffd24eb801d83918c688ef45146c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRSNX46FY6MHR2RY3TG6SFZJ63/bundle.json","state_url":"https://pith.science/pith/FRSNX46FY6MHR2RY3TG6SFZJ63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRSNX46FY6MHR2RY3TG6SFZJ63/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-06-24T06:31:49Z","links":{"resolver":"https://pith.science/pith/FRSNX46FY6MHR2RY3TG6SFZJ63","bundle":"https://pith.science/pith/FRSNX46FY6MHR2RY3TG6SFZJ63/bundle.json","state":"https://pith.science/pith/FRSNX46FY6MHR2RY3TG6SFZJ63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRSNX46FY6MHR2RY3TG6SFZJ63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FRSNX46FY6MHR2RY3TG6SFZJ63","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":"e9d91d8025b8791dc76dcab8952d2907e91dbd6d91955baada5c5be5e7e29b2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-22T09:05:38Z","title_canon_sha256":"4d846a113bb964c0e75045267ce0dde353be1419e2a7ea37e3ebf1731b1c7b45"},"schema_version":"1.0","source":{"id":"1702.06711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06711","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06711v1","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06711","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"FRSNX46FY6MH","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRSNX46FY6MHR2RY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRSNX46F","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:09bff199156e14852e5e5bba477dbe32252fffd24eb801d83918c688ef45146c","target":"graph","created_at":"2026-05-18T00:50:12Z","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 $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ with colored (black) vertices which forces the set $V(G)$ to be colored (black) after some times. \"color change rule\": a white vertex is changed to a black vertex when it is the only white neighbor of a black vertex. In this case, we say that the black vertex forces the white vertex. We investigate here the concept of connected zero forcing set and connected zero forcing number. We discusses this subject for special graphs and some products of graphs. Also we introduce the connected propagation time. Graphs w","authors_text":"A. Sheikhhosseni, M. Khosravi, S. Rashidi 2","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-22T09:05:38Z","title":"Connected zero forcing sets and connected propagation time of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06711","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:76b004e34a8605f52707e02f6b11a766c966aa663f5128448bf698adcf28c393","target":"record","created_at":"2026-05-18T00:50:12Z","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":"e9d91d8025b8791dc76dcab8952d2907e91dbd6d91955baada5c5be5e7e29b2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-22T09:05:38Z","title_canon_sha256":"4d846a113bb964c0e75045267ce0dde353be1419e2a7ea37e3ebf1731b1c7b45"},"schema_version":"1.0","source":{"id":"1702.06711","kind":"arxiv","version":1}},"canonical_sha256":"2c64dbf3c5c79878ea38dccde91729f6d6f97384f790b78274c977c805b5e9b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c64dbf3c5c79878ea38dccde91729f6d6f97384f790b78274c977c805b5e9b8","first_computed_at":"2026-05-18T00:50:12.871311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:12.871311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2wJpspcit65wzyxKccsKqM6Kmr8BrpATVXRyyuxqs35j7imgE6MGmX/Uql0oAD+ayo3YV2/mKtk+W0McOviTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:12.871935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76b004e34a8605f52707e02f6b11a766c966aa663f5128448bf698adcf28c393","sha256:09bff199156e14852e5e5bba477dbe32252fffd24eb801d83918c688ef45146c"],"state_sha256":"c799a04f1d54e7f74134f63283e9a0d6f139338dbe079d22f9fc884a06a4f108"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VWEB9hmV8irLLXKrgIlJtjV9CMQMNaxDKn9Z2lXheMtHJ0oESYnJjZAYr+7+M1uIMqfGzorpqgSZuqg6h7VBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:31:49.933506Z","bundle_sha256":"67b66b62dbfb96e00344dfde07234224522de636e14ca9c7dcd9694dee6a2dff"}}