{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VMSZGSGSDG7N4L4B3VKGLH76A3","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":"83753bb64cd6fefeb24e2a92de9dd22237075ec8e4b91a464d79951b0839349c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-07T16:21:20Z","title_canon_sha256":"fc8f835c05040ab8cc6016da6f285a521b16878ed3d0e1cc1425258c478f2ce5"},"schema_version":"1.0","source":{"id":"1405.6222","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6222","created_at":"2026-05-18T01:55:53Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6222v2","created_at":"2026-05-18T01:55:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6222","created_at":"2026-05-18T01:55:53Z"},{"alias_kind":"pith_short_12","alias_value":"VMSZGSGSDG7N","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VMSZGSGSDG7N4L4B","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VMSZGSGS","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:69bf59d8a1cdb87b6b827fd2e96417ed410fcd143a0df805228ba72580935e61","target":"graph","created_at":"2026-05-18T01:55:53Z","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 is a graph invariant introduced to study the minimum rank of the graph. In 2008, Aazami proved the NP-hardness of computing the zero forcing number of a simple undirected graph. We complete this NP-hardness result by showing that the non-equivalent problem of computing the zero forcing number of a directed graph allowing loops is also NP-hard. The rest of the paper is devoted to the strong controllability of a networked system. This kind of controllability takes into account only the structure of the interconnection graph, but not the interconnection strengths along the","authors_text":"Jean-Charles Delvenne, Maguy Trefois","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-07T16:21:20Z","title":"Zero forcing number, constrained matchings and strong structural controllability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6222","kind":"arxiv","version":2},"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:b64c09e9e8412214a824ddbedccb99b1bd9bdc01bbac3bcb36f0e328076b1758","target":"record","created_at":"2026-05-18T01:55:53Z","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":"83753bb64cd6fefeb24e2a92de9dd22237075ec8e4b91a464d79951b0839349c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-07T16:21:20Z","title_canon_sha256":"fc8f835c05040ab8cc6016da6f285a521b16878ed3d0e1cc1425258c478f2ce5"},"schema_version":"1.0","source":{"id":"1405.6222","kind":"arxiv","version":2}},"canonical_sha256":"ab259348d219bede2f81dd54659ffe06db968d461557c2d49c5e7829cd9eca38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab259348d219bede2f81dd54659ffe06db968d461557c2d49c5e7829cd9eca38","first_computed_at":"2026-05-18T01:55:53.451852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:53.451852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LIScfYdfit7GZb2QYa7kgPNjBi/PWEzztwjdRP0l9ytA4SFZh33lG2KdE4FliqeyUXm6Z6Y3LGqq6N+mU1ufAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:53.452345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6222","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b64c09e9e8412214a824ddbedccb99b1bd9bdc01bbac3bcb36f0e328076b1758","sha256:69bf59d8a1cdb87b6b827fd2e96417ed410fcd143a0df805228ba72580935e61"],"state_sha256":"c5fea46d7f55304a8706a974dc3a249d7fe5946f7b34ba12181fc0300a26b5be"}