{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YAS2YJSZ25B7KXGNKAO33UEVZU","short_pith_number":"pith:YAS2YJSZ","schema_version":"1.0","canonical_sha256":"c025ac2659d743f55ccd501dbdd095cd33ad79d14e2dce266c39cf139e2f0784","source":{"kind":"arxiv","id":"1904.02943","version":1},"attestation_state":"computed","paper":{"title":"Bounding the number of $(\\sigma,\\rho)$-dominating sets in trees, forests and graphs of bounded pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthieu Rosenfeld","submitted_at":"2019-04-05T09:06:37Z","abstract_excerpt":"The notion of $(\\sigma,\\rho)$-dominating set generalizes many notions including dominating set, induced matching, perfect codes or independent sets. Bounds on the maximal number of such (maximal, minimal) sets were established for different $\\sigma$ and $\\rho$ and different classes of graphs. In particular, Rote showed that the number of minimal dominating sets in trees of order $n$ is at most $95^{\\frac{n}{13}}$ and Golovach et Al. computed the asymptotic of the number of $(\\sigma,\\rho)$-dominating sets in paths for all $\\sigma$ and $\\rho$.\n  Here, we propose a method to compute bounds on the"},"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":"1904.02943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-05T09:06:37Z","cross_cats_sorted":[],"title_canon_sha256":"0315cbec49581ca6f7a57d4edc01c2899023b0c0b88785b03e80d9dcbe0d6bef","abstract_canon_sha256":"5ba0207691c758e36daf16d166b12bec5e131792e4af0b3fca9c5c58eb6dfede"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:19.133849Z","signature_b64":"BpfbVOJKX0hK1AyryS8nukxA4p7+ziMU1IMSjSyS9S/yIX+ysNhp/j1U3HWnoyTlI89zm2cnrkLjU2oOxmqTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c025ac2659d743f55ccd501dbdd095cd33ad79d14e2dce266c39cf139e2f0784","last_reissued_at":"2026-05-17T23:49:19.133170Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:19.133170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the number of $(\\sigma,\\rho)$-dominating sets in trees, forests and graphs of bounded pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthieu Rosenfeld","submitted_at":"2019-04-05T09:06:37Z","abstract_excerpt":"The notion of $(\\sigma,\\rho)$-dominating set generalizes many notions including dominating set, induced matching, perfect codes or independent sets. Bounds on the maximal number of such (maximal, minimal) sets were established for different $\\sigma$ and $\\rho$ and different classes of graphs. In particular, Rote showed that the number of minimal dominating sets in trees of order $n$ is at most $95^{\\frac{n}{13}}$ and Golovach et Al. computed the asymptotic of the number of $(\\sigma,\\rho)$-dominating sets in paths for all $\\sigma$ and $\\rho$.\n  Here, we propose a method to compute bounds on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02943","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":"1904.02943","created_at":"2026-05-17T23:49:19.133283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02943v1","created_at":"2026-05-17T23:49:19.133283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02943","created_at":"2026-05-17T23:49:19.133283+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAS2YJSZ25B7","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAS2YJSZ25B7KXGN","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAS2YJSZ","created_at":"2026-05-18T12:33:33.725879+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/YAS2YJSZ25B7KXGNKAO33UEVZU","json":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU.json","graph_json":"https://pith.science/api/pith-number/YAS2YJSZ25B7KXGNKAO33UEVZU/graph.json","events_json":"https://pith.science/api/pith-number/YAS2YJSZ25B7KXGNKAO33UEVZU/events.json","paper":"https://pith.science/paper/YAS2YJSZ"},"agent_actions":{"view_html":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU","download_json":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU.json","view_paper":"https://pith.science/paper/YAS2YJSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02943&json=true","fetch_graph":"https://pith.science/api/pith-number/YAS2YJSZ25B7KXGNKAO33UEVZU/graph.json","fetch_events":"https://pith.science/api/pith-number/YAS2YJSZ25B7KXGNKAO33UEVZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/action/storage_attestation","attest_author":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/action/author_attestation","sign_citation":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/action/citation_signature","submit_replication":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/action/replication_record"}},"created_at":"2026-05-17T23:49:19.133283+00:00","updated_at":"2026-05-17T23:49:19.133283+00:00"}