{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3ALCOHOPGEWC7C66ZWMQNYEAI4","short_pith_number":"pith:3ALCOHOP","schema_version":"1.0","canonical_sha256":"d816271dcf312c2f8bdecd9906e0804736e5e57f967e0883a18e40cb84ac757a","source":{"kind":"arxiv","id":"1308.3210","version":1},"attestation_state":"computed","paper":{"title":"Bounds on the Maximum Number of Minimum Dominating Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Bill Kay, Samuel Connolly, Zachary Gabor","submitted_at":"2013-08-14T19:00:25Z","abstract_excerpt":"We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \\gamma, of dominating sets of size \\gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all sets of size \\gamma. At the same time, we use a modified adjacency matrix to obtain lower bounds on the number of sets of a given size that do not dominate a graph on n vertices"},"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":"1308.3210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T19:00:25Z","cross_cats_sorted":[],"title_canon_sha256":"fbac66c334ed2faad445bcab85f1dcb4945f49377bcc6d4465f2b45f7eda24f8","abstract_canon_sha256":"cc270eef962ca4a836a259607d3bc86d50cb838ea37ba0449545a99be85df830"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:56.336937Z","signature_b64":"NRcb4f6noiXwP9GjNwnwfQSuEpp8bnKS+bzQqDbk/lSyuIYjmcWAEOa5mzRB7ZN7bwQeNdi80yi+Jb3z+yODDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d816271dcf312c2f8bdecd9906e0804736e5e57f967e0883a18e40cb84ac757a","last_reissued_at":"2026-05-18T03:15:56.336148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:56.336148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the Maximum Number of Minimum Dominating Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Bill Kay, Samuel Connolly, Zachary Gabor","submitted_at":"2013-08-14T19:00:25Z","abstract_excerpt":"We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \\gamma, of dominating sets of size \\gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all sets of size \\gamma. At the same time, we use a modified adjacency matrix to obtain lower bounds on the number of sets of a given size that do not dominate a graph on n vertices"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3210","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":"1308.3210","created_at":"2026-05-18T03:15:56.336279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3210v1","created_at":"2026-05-18T03:15:56.336279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3210","created_at":"2026-05-18T03:15:56.336279+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ALCOHOPGEWC","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ALCOHOPGEWC7C66","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ALCOHOP","created_at":"2026-05-18T12:27:32.513160+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/3ALCOHOPGEWC7C66ZWMQNYEAI4","json":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4.json","graph_json":"https://pith.science/api/pith-number/3ALCOHOPGEWC7C66ZWMQNYEAI4/graph.json","events_json":"https://pith.science/api/pith-number/3ALCOHOPGEWC7C66ZWMQNYEAI4/events.json","paper":"https://pith.science/paper/3ALCOHOP"},"agent_actions":{"view_html":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4","download_json":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4.json","view_paper":"https://pith.science/paper/3ALCOHOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3210&json=true","fetch_graph":"https://pith.science/api/pith-number/3ALCOHOPGEWC7C66ZWMQNYEAI4/graph.json","fetch_events":"https://pith.science/api/pith-number/3ALCOHOPGEWC7C66ZWMQNYEAI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/action/storage_attestation","attest_author":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/action/author_attestation","sign_citation":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/action/citation_signature","submit_replication":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/action/replication_record"}},"created_at":"2026-05-18T03:15:56.336279+00:00","updated_at":"2026-05-18T03:15:56.336279+00:00"}