{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LTJQ6JGNEYZLKRZ7JJ2RDPUVKB","short_pith_number":"pith:LTJQ6JGN","schema_version":"1.0","canonical_sha256":"5cd30f24cd2632b5473f4a7511be9550723fb6d2394dab1ea0b6aabc7e8c1e74","source":{"kind":"arxiv","id":"1710.03871","version":1},"attestation_state":"computed","paper":{"title":"The Domination Equivalence Classes of Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Iain Beaton, Jason I. Brown","submitted_at":"2017-10-11T01:08:28Z","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"},"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":"1710.03871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-11T01:08:28Z","cross_cats_sorted":[],"title_canon_sha256":"3ce3cad5c27cd06162df3e3802880d2c95576f308546d9f0060757b575c967f3","abstract_canon_sha256":"63e5ce8d933a15d3317f547361bb7d4157a7224fa31c1c67b7f2bd1ae10c9aed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:05.764867Z","signature_b64":"uE9wLYRZJeQDmT3Rub8PYVKTShz03Mnf/8mpGQJiRu/RE4mBF9ZtBmpHF3o8l2lmukH+dxnJRkXKYQPQDDEwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cd30f24cd2632b5473f4a7511be9550723fb6d2394dab1ea0b6aabc7e8c1e74","last_reissued_at":"2026-05-18T00:33:05.764221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:05.764221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Domination Equivalence Classes of Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Iain Beaton, Jason I. Brown","submitted_at":"2017-10-11T01:08:28Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03871","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.03871","created_at":"2026-05-18T00:33:05.764328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03871v1","created_at":"2026-05-18T00:33:05.764328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03871","created_at":"2026-05-18T00:33:05.764328+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTJQ6JGNEYZL","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTJQ6JGNEYZLKRZ7","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTJQ6JGN","created_at":"2026-05-18T12:31:28.150371+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/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB","json":"https://pith.science/pith/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB.json","graph_json":"https://pith.science/api/pith-number/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB/graph.json","events_json":"https://pith.science/api/pith-number/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB/events.json","paper":"https://pith.science/paper/LTJQ6JGN"},"agent_actions":{"view_html":"https://pith.science/pith/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB","download_json":"https://pith.science/pith/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB.json","view_paper":"https://pith.science/paper/LTJQ6JGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03871&json=true","fetch_graph":"https://pith.science/api/pith-number/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB/graph.json","fetch_events":"https://pith.science/api/pith-number/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB/action/storage_attestation","attest_author":"https://pith.science/pith/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB/action/author_attestation","sign_citation":"https://pith.science/pith/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB/action/citation_signature","submit_replication":"https://pith.science/pith/LTJQ6JGNEYZLKRZ7JJ2RDPUVKB/action/replication_record"}},"created_at":"2026-05-18T00:33:05.764328+00:00","updated_at":"2026-05-18T00:33:05.764328+00:00"}