{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MTW5USNDSMFQHKY5LC5OICGBTB","short_pith_number":"pith:MTW5USND","canonical_record":{"source":{"id":"1908.03039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T12:35:34Z","cross_cats_sorted":[],"title_canon_sha256":"dd1c1044e6f021c086906dc57ca4e7f9ce1869f60f001c5836347c2dc74be48b","abstract_canon_sha256":"c3e3c2832b4753e9317603b692d57cf8cbde023b643d8e52f80c734015876615"},"schema_version":"1.0"},"canonical_sha256":"64edda49a3930b03ab1d58bae408c19872f29bfc9d22707e0daa2ebc225f4a8c","source":{"kind":"arxiv","id":"1908.03039","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03039","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03039v1","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03039","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"MTW5USNDSMFQ","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"pith_short_16","alias_value":"MTW5USNDSMFQHKY5","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"pith_short_8","alias_value":"MTW5USND","created_at":"2026-07-04T23:52:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MTW5USNDSMFQHKY5LC5OICGBTB","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T12:35:34Z","cross_cats_sorted":[],"title_canon_sha256":"dd1c1044e6f021c086906dc57ca4e7f9ce1869f60f001c5836347c2dc74be48b","abstract_canon_sha256":"c3e3c2832b4753e9317603b692d57cf8cbde023b643d8e52f80c734015876615"},"schema_version":"1.0"},"canonical_sha256":"64edda49a3930b03ab1d58bae408c19872f29bfc9d22707e0daa2ebc225f4a8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:25.630247Z","signature_b64":"e29QDh6n/YHWICnOgcfZw1XhMhXXG4nGwIkawQbrStEWvcx0BBppIl1VEnwI4GVMKPBu298aisF9w7X06HVMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64edda49a3930b03ab1d58bae408c19872f29bfc9d22707e0daa2ebc225f4a8c","last_reissued_at":"2026-07-04T23:52:25.629877Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:25.629877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03039","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-07-04T23:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkONzWuBZlAZEUbSJtGVShv30xge0gXrPH3TPWmCgVCDF5wGoZxjSwGvw/DLs4Tc5pyWVoUq7WdRG9yDDU0VAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:47:34.578511Z"},"content_sha256":"a65d8b5699ed444d9cd2264df6dc000df01e16488f4929ac1d18e7c9e923c126","schema_version":"1.0","event_id":"sha256:a65d8b5699ed444d9cd2264df6dc000df01e16488f4929ac1d18e7c9e923c126"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MTW5USNDSMFQHKY5LC5OICGBTB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Zero Forcing sets and Power Dominating sets of cardinality at most 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi, Ignacio M. Pelayo, Najibeh Shahbaznejad","submitted_at":"2019-08-08T12:35:34Z","abstract_excerpt":"Let $S$ be a set of vertices of a graph $G$. Let $cl(S)$ be the set of vertices built from $S$, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in $cl(S)$, then the remaining neighbor is also in $cl(S)$. A set $S$ is called a zero forcing set of $G$ if $cl(S)=V(G)$. The zero forcing number $Z(G)$ of $G$ is the minimum cardinality of a zero forcing set. Let $cl(N[S])$ be the set of vertices built from the closed neighborhood $N[S]$ of $S$, by iteratively applying the previous propagation rule. A set $S$ is called a power dominatin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03039","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03039/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/4eg3O9Ikd1PpRYlEEyKFefkTceirQxBxXxT2YHjJICwi1ZexZRW3Y6RM9ovt57I89h6rE3xvxDgix0KOpdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:47:34.579019Z"},"content_sha256":"38f7508377c30b191f9f0dceaf9639a9f6f5aa18e17a2584e1158c62d06eef97","schema_version":"1.0","event_id":"sha256:38f7508377c30b191f9f0dceaf9639a9f6f5aa18e17a2584e1158c62d06eef97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTW5USNDSMFQHKY5LC5OICGBTB/bundle.json","state_url":"https://pith.science/pith/MTW5USNDSMFQHKY5LC5OICGBTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTW5USNDSMFQHKY5LC5OICGBTB/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-08-05T20:47:34Z","links":{"resolver":"https://pith.science/pith/MTW5USNDSMFQHKY5LC5OICGBTB","bundle":"https://pith.science/pith/MTW5USNDSMFQHKY5LC5OICGBTB/bundle.json","state":"https://pith.science/pith/MTW5USNDSMFQHKY5LC5OICGBTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTW5USNDSMFQHKY5LC5OICGBTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MTW5USNDSMFQHKY5LC5OICGBTB","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":"c3e3c2832b4753e9317603b692d57cf8cbde023b643d8e52f80c734015876615","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T12:35:34Z","title_canon_sha256":"dd1c1044e6f021c086906dc57ca4e7f9ce1869f60f001c5836347c2dc74be48b"},"schema_version":"1.0","source":{"id":"1908.03039","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03039","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03039v1","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03039","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"MTW5USNDSMFQ","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"pith_short_16","alias_value":"MTW5USNDSMFQHKY5","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"pith_short_8","alias_value":"MTW5USND","created_at":"2026-07-04T23:52:25Z"}],"graph_snapshots":[{"event_id":"sha256:38f7508377c30b191f9f0dceaf9639a9f6f5aa18e17a2584e1158c62d06eef97","target":"graph","created_at":"2026-07-04T23:52:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.03039/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $S$ be a set of vertices of a graph $G$. Let $cl(S)$ be the set of vertices built from $S$, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in $cl(S)$, then the remaining neighbor is also in $cl(S)$. A set $S$ is called a zero forcing set of $G$ if $cl(S)=V(G)$. The zero forcing number $Z(G)$ of $G$ is the minimum cardinality of a zero forcing set. Let $cl(N[S])$ be the set of vertices built from the closed neighborhood $N[S]$ of $S$, by iteratively applying the previous propagation rule. A set $S$ is called a power dominatin","authors_text":"Adel P. Kazemi, Ignacio M. Pelayo, Najibeh Shahbaznejad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T12:35:34Z","title":"Zero Forcing sets and Power Dominating sets of cardinality at most 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03039","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:a65d8b5699ed444d9cd2264df6dc000df01e16488f4929ac1d18e7c9e923c126","target":"record","created_at":"2026-07-04T23:52:25Z","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":"c3e3c2832b4753e9317603b692d57cf8cbde023b643d8e52f80c734015876615","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T12:35:34Z","title_canon_sha256":"dd1c1044e6f021c086906dc57ca4e7f9ce1869f60f001c5836347c2dc74be48b"},"schema_version":"1.0","source":{"id":"1908.03039","kind":"arxiv","version":1}},"canonical_sha256":"64edda49a3930b03ab1d58bae408c19872f29bfc9d22707e0daa2ebc225f4a8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64edda49a3930b03ab1d58bae408c19872f29bfc9d22707e0daa2ebc225f4a8c","first_computed_at":"2026-07-04T23:52:25.629877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:25.629877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e29QDh6n/YHWICnOgcfZw1XhMhXXG4nGwIkawQbrStEWvcx0BBppIl1VEnwI4GVMKPBu298aisF9w7X06HVMCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:25.630247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03039","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a65d8b5699ed444d9cd2264df6dc000df01e16488f4929ac1d18e7c9e923c126","sha256:38f7508377c30b191f9f0dceaf9639a9f6f5aa18e17a2584e1158c62d06eef97"],"state_sha256":"278e65fa779ddf00820a1af99069e50c9fa9ec877c065aa10bfbef068af47483"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZZ34hMeKEuYRTZtYljsN+XRhn5pEt6Jx5No5UdsIwjDLzC1Tmr23fGp42QgEIRRHOGg1eQOv6G8S7ZpJs/ABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T20:47:34.582902Z","bundle_sha256":"7244fd3a2fdeeb33c1ef9324d3925a0fe23ee01de93538db499c2662d1be337f"}}