{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7QYPNV3DBMHULOP3VVBSBPN7A5","short_pith_number":"pith:7QYPNV3D","schema_version":"1.0","canonical_sha256":"fc30f6d7630b0f45b9fbad4320bdbf074e81e9884ca9ab8eb754c5ff63bc5b03","source":{"kind":"arxiv","id":"1607.00658","version":1},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.00658","created_at":"2026-05-18T01:11:34.526595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00658v1","created_at":"2026-05-18T01:11:34.526595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00658","created_at":"2026-05-18T01:11:34.526595+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QYPNV3DBMHU","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QYPNV3DBMHULOP3","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QYPNV3D","created_at":"2026-05-18T12:30:04.600751+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/7QYPNV3DBMHULOP3VVBSBPN7A5","json":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5.json","graph_json":"https://pith.science/api/pith-number/7QYPNV3DBMHULOP3VVBSBPN7A5/graph.json","events_json":"https://pith.science/api/pith-number/7QYPNV3DBMHULOP3VVBSBPN7A5/events.json","paper":"https://pith.science/paper/7QYPNV3D"},"agent_actions":{"view_html":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5","download_json":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5.json","view_paper":"https://pith.science/paper/7QYPNV3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00658&json=true","fetch_graph":"https://pith.science/api/pith-number/7QYPNV3DBMHULOP3VVBSBPN7A5/graph.json","fetch_events":"https://pith.science/api/pith-number/7QYPNV3DBMHULOP3VVBSBPN7A5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/action/storage_attestation","attest_author":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/action/author_attestation","sign_citation":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/action/citation_signature","submit_replication":"https://pith.science/pith/7QYPNV3DBMHULOP3VVBSBPN7A5/action/replication_record"}},"created_at":"2026-05-18T01:11:34.526595+00:00","updated_at":"2026-05-18T01:11:34.526595+00:00"}