{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7QYPNV3DBMHULOP3VVBSBPN7A5","short_pith_number":"pith:7QYPNV3D","canonical_record":{"source":{"id":"1607.00658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-03T17:16:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f7d764c345bdb7bf2eda6387e953493ca236339f7031e97a83c767a1a498a691","abstract_canon_sha256":"d233453ee80d3339bf88be1584e24f26b9c314cb025bf5aedf5ab2004d5c3189"},"schema_version":"1.0"},"canonical_sha256":"fc30f6d7630b0f45b9fbad4320bdbf074e81e9884ca9ab8eb754c5ff63bc5b03","source":{"kind":"arxiv","id":"1607.00658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00658","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00658v1","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00658","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"pith_short_12","alias_value":"7QYPNV3DBMHU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7QYPNV3DBMHULOP3","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7QYPNV3D","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7QYPNV3DBMHULOP3VVBSBPN7A5","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-03T17:16:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f7d764c345bdb7bf2eda6387e953493ca236339f7031e97a83c767a1a498a691","abstract_canon_sha256":"d233453ee80d3339bf88be1584e24f26b9c314cb025bf5aedf5ab2004d5c3189"},"schema_version":"1.0"},"canonical_sha256":"fc30f6d7630b0f45b9fbad4320bdbf074e81e9884ca9ab8eb754c5ff63bc5b03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:34.526992Z","signature_b64":"9rlxlpMXIP/SjExp7cJr5dktz8FSaeXuSgd8F9NC/Er22+8noaQAd6X88/Zbo4UpvzoFIChDnU6PuAw0k7q8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc30f6d7630b0f45b9fbad4320bdbf074e81e9884ca9ab8eb754c5ff63bc5b03","last_reissued_at":"2026-05-18T01:11:34.526534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:34.526534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00658","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-18T01:11:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g78SQULWUoJnVVFRm8Nsjwj8GfF4QzXMDShziDqC1ZLODlqzmk5bfw0TT0/M091qcqRcr/PQ1hs/fYebpNBxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:08:31.971043Z"},"content_sha256":"6816cd611d5695e81b2fb5d470e82e680c4f40fcbce8dc55598e47e038fb6402","schema_version":"1.0","event_id":"sha256:6816cd611d5695e81b2fb5d470e82e680c4f40fcbce8dc55598e47e038fb6402"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7QYPNV3DBMHULOP3VVBSBPN7A5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity and Computation of Connected Zero Forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Boris Brimkov","submitted_at":"2016-07-03T17:16:28Z","abstract_excerpt":"Zero forcing is an iterative graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum zero forcing set - a smallest set of initially colored vertices which forces the entire graph to be colored. We show that the problem remains NP-hard when the initially colored set induces a connected subgraph. We also give structural results about the connected zero forcing sets of a graph related to the graph's density, separating sets, and certain induced subgraphs, and we characterize the cardinality of the minimum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00658","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-18T01:11:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"scoV87LTbiThX+YD3Zd4vos7s6PVp4czSDyXwIhOnvavQgGRsDfO5ozLOCA/B6mq0rD7/Be/pHnrso64MvXkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:08:31.971396Z"},"content_sha256":"deba21c2a7642629009a3b2921df3a9f5d972ce9973e72a7aafe1c219db9c114","schema_version":"1.0","event_id":"sha256:deba21c2a7642629009a3b2921df3a9f5d972ce9973e72a7aafe1c219db9c114"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/bundle.json","state_url":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/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-03T13:08:31Z","links":{"resolver":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5","bundle":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/bundle.json","state":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7QYPNV3DBMHULOP3VVBSBPN7A5","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":"d233453ee80d3339bf88be1584e24f26b9c314cb025bf5aedf5ab2004d5c3189","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-03T17:16:28Z","title_canon_sha256":"f7d764c345bdb7bf2eda6387e953493ca236339f7031e97a83c767a1a498a691"},"schema_version":"1.0","source":{"id":"1607.00658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00658","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00658v1","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00658","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"pith_short_12","alias_value":"7QYPNV3DBMHU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7QYPNV3DBMHULOP3","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7QYPNV3D","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:deba21c2a7642629009a3b2921df3a9f5d972ce9973e72a7aafe1c219db9c114","target":"graph","created_at":"2026-05-18T01:11:34Z","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":"Zero forcing is an iterative graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum zero forcing set - a smallest set of initially colored vertices which forces the entire graph to be colored. We show that the problem remains NP-hard when the initially colored set induces a connected subgraph. We also give structural results about the connected zero forcing sets of a graph related to the graph's density, separating sets, and certain induced subgraphs, and we characterize the cardinality of the minimum","authors_text":"Boris Brimkov","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-03T17:16:28Z","title":"Complexity and Computation of Connected Zero Forcing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00658","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:6816cd611d5695e81b2fb5d470e82e680c4f40fcbce8dc55598e47e038fb6402","target":"record","created_at":"2026-05-18T01:11:34Z","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":"d233453ee80d3339bf88be1584e24f26b9c314cb025bf5aedf5ab2004d5c3189","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-03T17:16:28Z","title_canon_sha256":"f7d764c345bdb7bf2eda6387e953493ca236339f7031e97a83c767a1a498a691"},"schema_version":"1.0","source":{"id":"1607.00658","kind":"arxiv","version":1}},"canonical_sha256":"fc30f6d7630b0f45b9fbad4320bdbf074e81e9884ca9ab8eb754c5ff63bc5b03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc30f6d7630b0f45b9fbad4320bdbf074e81e9884ca9ab8eb754c5ff63bc5b03","first_computed_at":"2026-05-18T01:11:34.526534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:34.526534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9rlxlpMXIP/SjExp7cJr5dktz8FSaeXuSgd8F9NC/Er22+8noaQAd6X88/Zbo4UpvzoFIChDnU6PuAw0k7q8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:34.526992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6816cd611d5695e81b2fb5d470e82e680c4f40fcbce8dc55598e47e038fb6402","sha256:deba21c2a7642629009a3b2921df3a9f5d972ce9973e72a7aafe1c219db9c114"],"state_sha256":"e676f42ec7b15b2852f57920ea8ab67601aea8cddad555e2ede2846d5814ab65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dy8YMwJBksO3PqVg3p4F+g0P9PP6Jaj1f9dgRKaTfQznOg5N/8H5x6Kx5dr8gaQPzG52JKepDUX9ehvTNaCKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:08:31.973334Z","bundle_sha256":"831a7368b477a5787fc5c3359f3cbe2fb1a572d4688aaa442d94f37bb05bc268"}}