{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5BYLTKG5XXH533UCMOQTPOCU4M","short_pith_number":"pith:5BYLTKG5","canonical_record":{"source":{"id":"1407.7017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-25T19:51:00Z","cross_cats_sorted":[],"title_canon_sha256":"6d20a1d8bf1482baffa99be9dbc7be51d4c0327c39970c00a9a8b0ed31de843b","abstract_canon_sha256":"85080d8ebf94e7cb2ae2aa15092af918522ec066fb4370c384b6aae846bd37e4"},"schema_version":"1.0"},"canonical_sha256":"e870b9a8ddbdcfddee8263a137b854e3352017ea26ae58c3772266db4e6ae4d8","source":{"kind":"arxiv","id":"1407.7017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7017","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7017v1","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7017","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"5BYLTKG5XXH5","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5BYLTKG5XXH533UC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5BYLTKG5","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5BYLTKG5XXH533UCMOQTPOCU4M","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-25T19:51:00Z","cross_cats_sorted":[],"title_canon_sha256":"6d20a1d8bf1482baffa99be9dbc7be51d4c0327c39970c00a9a8b0ed31de843b","abstract_canon_sha256":"85080d8ebf94e7cb2ae2aa15092af918522ec066fb4370c384b6aae846bd37e4"},"schema_version":"1.0"},"canonical_sha256":"e870b9a8ddbdcfddee8263a137b854e3352017ea26ae58c3772266db4e6ae4d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:31.888169Z","signature_b64":"4jJurjt+mMYLBgN6CcmFaxw0SjqZCThqzO703Whav6gVytKLWBmDR4COKLsFGNPOpTAe87JNnB9tAUD2oF5uCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e870b9a8ddbdcfddee8263a137b854e3352017ea26ae58c3772266db4e6ae4d8","last_reissued_at":"2026-05-18T02:46:31.887749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:31.887749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7017","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-18T02:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7YGpWR0j6WolXbx9Qnfnw7fXvgLEeYwZcVurTIcBRljiPxyhENeyaoC1I2rbH8VRUYtIhbR5ki8ATQLTKSQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:25:48.258554Z"},"content_sha256":"3db88f968d4c0105952e6e1fcb560108f186d81c79cdc021354491a60bb3750b","schema_version":"1.0","event_id":"sha256:3db88f968d4c0105952e6e1fcb560108f186d81c79cdc021354491a60bb3750b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5BYLTKG5XXH533UCMOQTPOCU4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of the Positive Semidefinite Zero Forcing Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boting Yang, Karen Meagher, Shaun Fallat","submitted_at":"2014-07-25T19:51:00Z","abstract_excerpt":"The positive zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring, and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and the fast-mixed searching, which implies some NP-completeness results for the zero forcing problem. For chordal graphs much is understood regarding the relationships between positive zero forcing and clique coverings. Building upon constructions associated with optimal tree covers and forest covers, we present a linear time algorithm for computing the positi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7017","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-18T02:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYtkW3Lj4+R8Q0u57gdmzfdIzCNjfYFUKQfu13T9zP9sFAV7VdkFKRjyRavR4Q/qjlblcZakeZ0xdaJrTzhTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:25:48.258906Z"},"content_sha256":"ae989681a4f20edcf1a6f1000a7427ede405ec11e18435ef4c9d42e07e125371","schema_version":"1.0","event_id":"sha256:ae989681a4f20edcf1a6f1000a7427ede405ec11e18435ef4c9d42e07e125371"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BYLTKG5XXH533UCMOQTPOCU4M/bundle.json","state_url":"https://pith.science/pith/5BYLTKG5XXH533UCMOQTPOCU4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BYLTKG5XXH533UCMOQTPOCU4M/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-05-28T08:25:48Z","links":{"resolver":"https://pith.science/pith/5BYLTKG5XXH533UCMOQTPOCU4M","bundle":"https://pith.science/pith/5BYLTKG5XXH533UCMOQTPOCU4M/bundle.json","state":"https://pith.science/pith/5BYLTKG5XXH533UCMOQTPOCU4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BYLTKG5XXH533UCMOQTPOCU4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5BYLTKG5XXH533UCMOQTPOCU4M","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":"85080d8ebf94e7cb2ae2aa15092af918522ec066fb4370c384b6aae846bd37e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-25T19:51:00Z","title_canon_sha256":"6d20a1d8bf1482baffa99be9dbc7be51d4c0327c39970c00a9a8b0ed31de843b"},"schema_version":"1.0","source":{"id":"1407.7017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7017","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7017v1","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7017","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"5BYLTKG5XXH5","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5BYLTKG5XXH533UC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5BYLTKG5","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:ae989681a4f20edcf1a6f1000a7427ede405ec11e18435ef4c9d42e07e125371","target":"graph","created_at":"2026-05-18T02:46:31Z","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 positive zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring, and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and the fast-mixed searching, which implies some NP-completeness results for the zero forcing problem. For chordal graphs much is understood regarding the relationships between positive zero forcing and clique coverings. Building upon constructions associated with optimal tree covers and forest covers, we present a linear time algorithm for computing the positi","authors_text":"Boting Yang, Karen Meagher, Shaun Fallat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-25T19:51:00Z","title":"On the Complexity of the Positive Semidefinite Zero Forcing Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7017","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:3db88f968d4c0105952e6e1fcb560108f186d81c79cdc021354491a60bb3750b","target":"record","created_at":"2026-05-18T02:46:31Z","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":"85080d8ebf94e7cb2ae2aa15092af918522ec066fb4370c384b6aae846bd37e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-25T19:51:00Z","title_canon_sha256":"6d20a1d8bf1482baffa99be9dbc7be51d4c0327c39970c00a9a8b0ed31de843b"},"schema_version":"1.0","source":{"id":"1407.7017","kind":"arxiv","version":1}},"canonical_sha256":"e870b9a8ddbdcfddee8263a137b854e3352017ea26ae58c3772266db4e6ae4d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e870b9a8ddbdcfddee8263a137b854e3352017ea26ae58c3772266db4e6ae4d8","first_computed_at":"2026-05-18T02:46:31.887749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:31.887749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4jJurjt+mMYLBgN6CcmFaxw0SjqZCThqzO703Whav6gVytKLWBmDR4COKLsFGNPOpTAe87JNnB9tAUD2oF5uCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:31.888169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3db88f968d4c0105952e6e1fcb560108f186d81c79cdc021354491a60bb3750b","sha256:ae989681a4f20edcf1a6f1000a7427ede405ec11e18435ef4c9d42e07e125371"],"state_sha256":"7e3c2e5cdfe1e410abbf857cf218def000aa60d692f9ca4fabc82d773351a79e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ed1vgWKWi64ihx+Hql2MvBok45LXfuEveiGC4yDaaRYdW6xfXzbYWQfnNaZRMLN47FOL2rPpKcFGpFk7Z/+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:25:48.261073Z","bundle_sha256":"1e5ed9e920d403385703831570ab899627e48a539fc9f52cf71f30371e11fa45"}}