{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LTJQ6JGNEYZLKRZ7JJ2RDPUVKB","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":"63e5ce8d933a15d3317f547361bb7d4157a7224fa31c1c67b7f2bd1ae10c9aed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-11T01:08:28Z","title_canon_sha256":"3ce3cad5c27cd06162df3e3802880d2c95576f308546d9f0060757b575c967f3"},"schema_version":"1.0","source":{"id":"1710.03871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03871","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03871v1","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03871","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"pith_short_12","alias_value":"LTJQ6JGNEYZL","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LTJQ6JGNEYZLKRZ7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LTJQ6JGN","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:c4e99f1ab742d770c0f105b60753a56104022bc061d35812d28f38b8b7523273","target":"graph","created_at":"2026-05-18T00:33:05Z","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 dominating set $S$ of a graph $G$ of order $n$ is a subset of the vertices of $G$ such that every vertex is either in $S$ or adjacent to a vertex of $S$. %The domination number $G$, denoted $\\gamma (G)$, is the cardinality of the smallest dominating set of $G$. The domination polynomial is defined by $D(G,x) = \\sum d(G,i)x^i$ where $d(G,i)$ is the number of dominating sets in $G$ with cardinality $i$. Two graphs $G$ and $H$ are considered $\\mathcal{D}$-equivalent if $D(G,x)=D(H,x)$. The equivalence class of $G$, denoted $[G]$, is the set of all graphs $\\mathcal{D}$-equivalent to $G$. Extendi","authors_text":"Iain Beaton, Jason I. Brown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-11T01:08:28Z","title":"The Domination Equivalence Classes of Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03871","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:c0bf335880e745d4e11bf9c457e46f564cf5b70daba4fae82e3bc06bb4a33be5","target":"record","created_at":"2026-05-18T00:33:05Z","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":"63e5ce8d933a15d3317f547361bb7d4157a7224fa31c1c67b7f2bd1ae10c9aed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-11T01:08:28Z","title_canon_sha256":"3ce3cad5c27cd06162df3e3802880d2c95576f308546d9f0060757b575c967f3"},"schema_version":"1.0","source":{"id":"1710.03871","kind":"arxiv","version":1}},"canonical_sha256":"5cd30f24cd2632b5473f4a7511be9550723fb6d2394dab1ea0b6aabc7e8c1e74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cd30f24cd2632b5473f4a7511be9550723fb6d2394dab1ea0b6aabc7e8c1e74","first_computed_at":"2026-05-18T00:33:05.764221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:05.764221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uE9wLYRZJeQDmT3Rub8PYVKTShz03Mnf/8mpGQJiRu/RE4mBF9ZtBmpHF3o8l2lmukH+dxnJRkXKYQPQDDEwAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:05.764867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0bf335880e745d4e11bf9c457e46f564cf5b70daba4fae82e3bc06bb4a33be5","sha256:c4e99f1ab742d770c0f105b60753a56104022bc061d35812d28f38b8b7523273"],"state_sha256":"bc869bd7b60bfee2ea4e44e8180f22187f85bb495f766081dfc656000c1a37b6"}