{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DSWZNFV2UQ4CK5WLSBV4PIOVSR","short_pith_number":"pith:DSWZNFV2","canonical_record":{"source":{"id":"1805.10984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-28T15:46:02Z","cross_cats_sorted":[],"title_canon_sha256":"66620be4c4deaadabf65c1d7de7ee6a0ad94215f3e285a2e544b2fd7cdf7407c","abstract_canon_sha256":"1b6182f5c56766c24b016829a8e15403dd6e8e9c1f79316c06716bcd519bf55f"},"schema_version":"1.0"},"canonical_sha256":"1cad9696baa4382576cb906bc7a1d5947da408eabd7dab69427be30470af6e54","source":{"kind":"arxiv","id":"1805.10984","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10984","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10984v1","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10984","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"pith_short_12","alias_value":"DSWZNFV2UQ4C","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DSWZNFV2UQ4CK5WL","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DSWZNFV2","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DSWZNFV2UQ4CK5WLSBV4PIOVSR","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-28T15:46:02Z","cross_cats_sorted":[],"title_canon_sha256":"66620be4c4deaadabf65c1d7de7ee6a0ad94215f3e285a2e544b2fd7cdf7407c","abstract_canon_sha256":"1b6182f5c56766c24b016829a8e15403dd6e8e9c1f79316c06716bcd519bf55f"},"schema_version":"1.0"},"canonical_sha256":"1cad9696baa4382576cb906bc7a1d5947da408eabd7dab69427be30470af6e54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:48.622671Z","signature_b64":"u4O2yBVNkFV68ElQOul23klEjAG13dfurFaXItaYwWTQjyYYxTsQ0Ys12fhFPkd9XjsOU4L+la/3wNKyB6z6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cad9696baa4382576cb906bc7a1d5947da408eabd7dab69427be30470af6e54","last_reissued_at":"2026-05-18T00:14:48.621912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:48.621912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10984","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-18T00:14:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yiah/tuTgOd1ro1rs88bInp5nVWuQooPCjxFeKgnXuIChd6md2t+roeUNJASEAEWcLpFX+3AZsJQntmfqmR6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:13:32.152133Z"},"content_sha256":"c7cadef1c2505b62eb9b2f9edc1072e60d3152e6ee7aa933bc2121de4a1d6c83","schema_version":"1.0","event_id":"sha256:c7cadef1c2505b62eb9b2f9edc1072e60d3152e6ee7aa933bc2121de4a1d6c83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DSWZNFV2UQ4CK5WLSBV4PIOVSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power domination polynomials of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Teich, Boris Brimkov, Rutvik Patel, Varun Suriyanarayana","submitted_at":"2018-05-28T15:46:02Z","abstract_excerpt":"A power dominating set of a graph is a set of vertices that observes every vertex in the graph by combining classical domination with an iterative propagation process arising from electrical circuit theory. In this paper, we study the power domination polynomial of a graph $G$ of order $n$, defined as $\\mathcal{P}(G;x)=\\sum_{i=1}^n p(G;i) x^i$, where $p(G;i)$ is the number of power dominating sets of $G$ of size $i$. We relate the power domination polynomial to other graph polynomials, present structural and extremal results about its roots and coefficients, and identify some graph parameters "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10984","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-18T00:14:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"thwNDVcnGXF91PniM79jDNWraSuns6yvJydl9GpDrs1tIjcFsCXnNGfNi9aNx+/5BgNHv5oFJG7b7gJEbw5/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:13:32.152790Z"},"content_sha256":"b7c74b9a011801b2c1bec236c78625d9c6f84323d7d570c32906eb66ddfc81da","schema_version":"1.0","event_id":"sha256:b7c74b9a011801b2c1bec236c78625d9c6f84323d7d570c32906eb66ddfc81da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSWZNFV2UQ4CK5WLSBV4PIOVSR/bundle.json","state_url":"https://pith.science/pith/DSWZNFV2UQ4CK5WLSBV4PIOVSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSWZNFV2UQ4CK5WLSBV4PIOVSR/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-30T01:13:32Z","links":{"resolver":"https://pith.science/pith/DSWZNFV2UQ4CK5WLSBV4PIOVSR","bundle":"https://pith.science/pith/DSWZNFV2UQ4CK5WLSBV4PIOVSR/bundle.json","state":"https://pith.science/pith/DSWZNFV2UQ4CK5WLSBV4PIOVSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSWZNFV2UQ4CK5WLSBV4PIOVSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DSWZNFV2UQ4CK5WLSBV4PIOVSR","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":"1b6182f5c56766c24b016829a8e15403dd6e8e9c1f79316c06716bcd519bf55f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-28T15:46:02Z","title_canon_sha256":"66620be4c4deaadabf65c1d7de7ee6a0ad94215f3e285a2e544b2fd7cdf7407c"},"schema_version":"1.0","source":{"id":"1805.10984","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10984","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10984v1","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10984","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"pith_short_12","alias_value":"DSWZNFV2UQ4C","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DSWZNFV2UQ4CK5WL","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DSWZNFV2","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:b7c74b9a011801b2c1bec236c78625d9c6f84323d7d570c32906eb66ddfc81da","target":"graph","created_at":"2026-05-18T00:14:48Z","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":"A power dominating set of a graph is a set of vertices that observes every vertex in the graph by combining classical domination with an iterative propagation process arising from electrical circuit theory. In this paper, we study the power domination polynomial of a graph $G$ of order $n$, defined as $\\mathcal{P}(G;x)=\\sum_{i=1}^n p(G;i) x^i$, where $p(G;i)$ is the number of power dominating sets of $G$ of size $i$. We relate the power domination polynomial to other graph polynomials, present structural and extremal results about its roots and coefficients, and identify some graph parameters ","authors_text":"Alexander Teich, Boris Brimkov, Rutvik Patel, Varun Suriyanarayana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-28T15:46:02Z","title":"Power domination polynomials of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10984","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:c7cadef1c2505b62eb9b2f9edc1072e60d3152e6ee7aa933bc2121de4a1d6c83","target":"record","created_at":"2026-05-18T00:14:48Z","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":"1b6182f5c56766c24b016829a8e15403dd6e8e9c1f79316c06716bcd519bf55f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-28T15:46:02Z","title_canon_sha256":"66620be4c4deaadabf65c1d7de7ee6a0ad94215f3e285a2e544b2fd7cdf7407c"},"schema_version":"1.0","source":{"id":"1805.10984","kind":"arxiv","version":1}},"canonical_sha256":"1cad9696baa4382576cb906bc7a1d5947da408eabd7dab69427be30470af6e54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cad9696baa4382576cb906bc7a1d5947da408eabd7dab69427be30470af6e54","first_computed_at":"2026-05-18T00:14:48.621912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:48.621912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u4O2yBVNkFV68ElQOul23klEjAG13dfurFaXItaYwWTQjyYYxTsQ0Ys12fhFPkd9XjsOU4L+la/3wNKyB6z6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:48.622671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10984","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7cadef1c2505b62eb9b2f9edc1072e60d3152e6ee7aa933bc2121de4a1d6c83","sha256:b7c74b9a011801b2c1bec236c78625d9c6f84323d7d570c32906eb66ddfc81da"],"state_sha256":"d3c05a94d4e31aab608462fe7df26f990ffb79c5edf1cef91631e90a541bab48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fjLKAUMVUeVhJnEP1Fx29IXTaLiPW/h0qbS8wEggP6vOPBHMNfRpjSsjD/iyfyIelaw80HIgo7YxZ3ecxZXfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:13:32.157126Z","bundle_sha256":"f56cab02cb8efa6188b4c5a173974c309a32f6c409526723f439efa6029b51fd"}}