{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TWR6GIFU7N5EV6QE64J3LEAZ64","short_pith_number":"pith:TWR6GIFU","schema_version":"1.0","canonical_sha256":"9da3e320b4fb7a4afa04f713b59019f70607ce0ca7b68275aad236583d2b9114","source":{"kind":"arxiv","id":"2209.03930","version":1},"attestation_state":"computed","paper":{"title":"Graphs which satisfy a Vizing-like bound for power domination of Cartesian products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Houston Schuerger, Kirsti Kuenzel, Sarah E. Anderson","submitted_at":"2022-09-08T17:14:12Z","abstract_excerpt":"Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph $G$, a subset $S\\subseteq V(G)$ that can observe all vertices of $G$ using this process is known as a power dominating set of $G$, and the power domination number of $G$, $\\gamma_P(G)$, is the minimum number of vertices in a power dominating set. We introduce a new partition on the vertices of a graph to provide a lower bound for the power domination number. We also consider the power domination number of the Cartesian produc"},"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":"2209.03930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-08T17:14:12Z","cross_cats_sorted":[],"title_canon_sha256":"47f122f574844aa86cde9c9378a7d674bae14021f3fed8964c0a61a0f59401c9","abstract_canon_sha256":"1ebae303068452953c95245144bc0a8dbc062e38c22a1f841b01bc09fd7e4cd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:47.091712Z","signature_b64":"dcTTk5vKN8SKE+5qkGEfvK8UZxEEg0DPXnSq+doK6iihboj6t6tJfFmjwnMyTIvTssHJpaOkD4PrrEoo80aeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9da3e320b4fb7a4afa04f713b59019f70607ce0ca7b68275aad236583d2b9114","last_reissued_at":"2026-07-05T04:55:47.091255Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:47.091255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs which satisfy a Vizing-like bound for power domination of Cartesian products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Houston Schuerger, Kirsti Kuenzel, Sarah E. Anderson","submitted_at":"2022-09-08T17:14:12Z","abstract_excerpt":"Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph $G$, a subset $S\\subseteq V(G)$ that can observe all vertices of $G$ using this process is known as a power dominating set of $G$, and the power domination number of $G$, $\\gamma_P(G)$, is the minimum number of vertices in a power dominating set. We introduce a new partition on the vertices of a graph to provide a lower bound for the power domination number. We also consider the power domination number of the Cartesian produc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.03930","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/2209.03930/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2209.03930","created_at":"2026-07-05T04:55:47.091321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.03930v1","created_at":"2026-07-05T04:55:47.091321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.03930","created_at":"2026-07-05T04:55:47.091321+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWR6GIFU7N5E","created_at":"2026-07-05T04:55:47.091321+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWR6GIFU7N5EV6QE","created_at":"2026-07-05T04:55:47.091321+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWR6GIFU","created_at":"2026-07-05T04:55:47.091321+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/TWR6GIFU7N5EV6QE64J3LEAZ64","json":"https://pith.science/pith/TWR6GIFU7N5EV6QE64J3LEAZ64.json","graph_json":"https://pith.science/api/pith-number/TWR6GIFU7N5EV6QE64J3LEAZ64/graph.json","events_json":"https://pith.science/api/pith-number/TWR6GIFU7N5EV6QE64J3LEAZ64/events.json","paper":"https://pith.science/paper/TWR6GIFU"},"agent_actions":{"view_html":"https://pith.science/pith/TWR6GIFU7N5EV6QE64J3LEAZ64","download_json":"https://pith.science/pith/TWR6GIFU7N5EV6QE64J3LEAZ64.json","view_paper":"https://pith.science/paper/TWR6GIFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.03930&json=true","fetch_graph":"https://pith.science/api/pith-number/TWR6GIFU7N5EV6QE64J3LEAZ64/graph.json","fetch_events":"https://pith.science/api/pith-number/TWR6GIFU7N5EV6QE64J3LEAZ64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWR6GIFU7N5EV6QE64J3LEAZ64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWR6GIFU7N5EV6QE64J3LEAZ64/action/storage_attestation","attest_author":"https://pith.science/pith/TWR6GIFU7N5EV6QE64J3LEAZ64/action/author_attestation","sign_citation":"https://pith.science/pith/TWR6GIFU7N5EV6QE64J3LEAZ64/action/citation_signature","submit_replication":"https://pith.science/pith/TWR6GIFU7N5EV6QE64J3LEAZ64/action/replication_record"}},"created_at":"2026-07-05T04:55:47.091321+00:00","updated_at":"2026-07-05T04:55:47.091321+00:00"}