{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PZ4VEQMTEUVPNJFMJZJ3HGDAWX","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":"10c3d70d9a19c46ea2e4148ba72d55f00794b87e17bb0b963ac6ceef407931e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-31T18:04:43Z","title_canon_sha256":"3ab80d201fcaab52f93bd37e27e92804625b6f176d671ab6cc50ca3c05f665a3"},"schema_version":"1.0","source":{"id":"1511.00159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00159","created_at":"2026-05-18T01:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00159v2","created_at":"2026-05-18T01:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00159","created_at":"2026-05-18T01:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"PZ4VEQMTEUVP","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZ4VEQMTEUVPNJFM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZ4VEQMT","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:888c9c3676733e906e57907ec2eca9676abbda6883738b708c01c39cf0fb6d38","target":"graph","created_at":"2026-05-18T01:26:33Z","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":"Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=\\sum_{i=1}^n d(G,i) x^i$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. The $n$-barbell graph $Bar_n$ with $2n$ vertices, is formed by joining two copies of a complete graph $K_n$ by a single edge. We prove that for every $n\\geq 2$, $Bar_n$ is not $\\mathcal{D}$-unique, that is, there is another non-isomorphic graph with the same domination polynomial. More precisely, we show that for every $n$, the $\\mathcal{D}$-equivalence class of barbell graph, $[Bar_n]$, contains many g","authors_text":"Saeid Alikhani, Somayeh Jahari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-31T18:04:43Z","title":"On $\\mathcal{D}$-equivalence classes of some graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00159","kind":"arxiv","version":2},"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:62d64b33921c5d70af20d036e7946ddeba6ce72e13cfd28a35be0ac57afc4eed","target":"record","created_at":"2026-05-18T01:26:33Z","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":"10c3d70d9a19c46ea2e4148ba72d55f00794b87e17bb0b963ac6ceef407931e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-31T18:04:43Z","title_canon_sha256":"3ab80d201fcaab52f93bd37e27e92804625b6f176d671ab6cc50ca3c05f665a3"},"schema_version":"1.0","source":{"id":"1511.00159","kind":"arxiv","version":2}},"canonical_sha256":"7e79524193252af6a4ac4e53b39860b5d7e4513696bfe61b16e626bc68013255","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e79524193252af6a4ac4e53b39860b5d7e4513696bfe61b16e626bc68013255","first_computed_at":"2026-05-18T01:26:33.525667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:33.525667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"00bIHnaENhGQ9wBiUec7ep4Fayh74/I5elWXoiHHX+W6arp8f5e68KLVeKXhuq8PCwRUrDNiqXUkxofZ9bWrBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:33.526416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.00159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62d64b33921c5d70af20d036e7946ddeba6ce72e13cfd28a35be0ac57afc4eed","sha256:888c9c3676733e906e57907ec2eca9676abbda6883738b708c01c39cf0fb6d38"],"state_sha256":"29ee444ff05740bd97b4cf7df656edb94299060ed578184581f5b1c74ad625a4"}