{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2FXMT5SFCYWKQ5WDY6R4I5AI2F","short_pith_number":"pith:2FXMT5SF","schema_version":"1.0","canonical_sha256":"d16ec9f645162ca876c3c7a3c47408d1431411718bacf754d0cc4d32ca5053aa","source":{"kind":"arxiv","id":"1207.2430","version":1},"attestation_state":"computed","paper":{"title":"Subset-Sum Representations of Domination Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James Preen, Peter Tittmann, Tomer Kotek","submitted_at":"2012-07-10T18:03:36Z","abstract_excerpt":"The domination polynomial D(G,x) is the ordinary generating function for the dominating sets of an undirected graph G=(V,E) with respect to their cardinality. We consider in this paper representations of D(G,x) as a sum over subsets of the edge and vertex set of G. One of our main results is a representation of D(G,x) as a sum ranging over spanning bipartite subgraphs of G. We call a graph G conformal if all of its components are of even order. We show that the number of dominating sets of G equals a sum ranging over vertex-induced conformal subgraphs of G."},"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":"1207.2430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-10T18:03:36Z","cross_cats_sorted":[],"title_canon_sha256":"e6d70f146aa40c291950264f04b5f3258f7c071e8c3868e3191aba8faf76d904","abstract_canon_sha256":"845cb39790aa05c0c711ebb9ab6a4f662e33ce197b8adc1c1a2c940aeb89beeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:24.168951Z","signature_b64":"QwWbio/mPd4yyooMnppDm2s0m02g2VINUgSBXqvR22Rii5YPfWnm/wdKXjWzDhyGi6f+QmCBeEG6GVnP/71WDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d16ec9f645162ca876c3c7a3c47408d1431411718bacf754d0cc4d32ca5053aa","last_reissued_at":"2026-05-18T03:51:24.168220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:24.168220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subset-Sum Representations of Domination Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James Preen, Peter Tittmann, Tomer Kotek","submitted_at":"2012-07-10T18:03:36Z","abstract_excerpt":"The domination polynomial D(G,x) is the ordinary generating function for the dominating sets of an undirected graph G=(V,E) with respect to their cardinality. We consider in this paper representations of D(G,x) as a sum over subsets of the edge and vertex set of G. One of our main results is a representation of D(G,x) as a sum ranging over spanning bipartite subgraphs of G. We call a graph G conformal if all of its components are of even order. We show that the number of dominating sets of G equals a sum ranging over vertex-induced conformal subgraphs of G."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2430","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":"1207.2430","created_at":"2026-05-18T03:51:24.168343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2430v1","created_at":"2026-05-18T03:51:24.168343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2430","created_at":"2026-05-18T03:51:24.168343+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FXMT5SFCYWK","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FXMT5SFCYWKQ5WD","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FXMT5SF","created_at":"2026-05-18T12:26:50.516681+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/2FXMT5SFCYWKQ5WDY6R4I5AI2F","json":"https://pith.science/pith/2FXMT5SFCYWKQ5WDY6R4I5AI2F.json","graph_json":"https://pith.science/api/pith-number/2FXMT5SFCYWKQ5WDY6R4I5AI2F/graph.json","events_json":"https://pith.science/api/pith-number/2FXMT5SFCYWKQ5WDY6R4I5AI2F/events.json","paper":"https://pith.science/paper/2FXMT5SF"},"agent_actions":{"view_html":"https://pith.science/pith/2FXMT5SFCYWKQ5WDY6R4I5AI2F","download_json":"https://pith.science/pith/2FXMT5SFCYWKQ5WDY6R4I5AI2F.json","view_paper":"https://pith.science/paper/2FXMT5SF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2430&json=true","fetch_graph":"https://pith.science/api/pith-number/2FXMT5SFCYWKQ5WDY6R4I5AI2F/graph.json","fetch_events":"https://pith.science/api/pith-number/2FXMT5SFCYWKQ5WDY6R4I5AI2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FXMT5SFCYWKQ5WDY6R4I5AI2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FXMT5SFCYWKQ5WDY6R4I5AI2F/action/storage_attestation","attest_author":"https://pith.science/pith/2FXMT5SFCYWKQ5WDY6R4I5AI2F/action/author_attestation","sign_citation":"https://pith.science/pith/2FXMT5SFCYWKQ5WDY6R4I5AI2F/action/citation_signature","submit_replication":"https://pith.science/pith/2FXMT5SFCYWKQ5WDY6R4I5AI2F/action/replication_record"}},"created_at":"2026-05-18T03:51:24.168343+00:00","updated_at":"2026-05-18T03:51:24.168343+00:00"}