{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3ALCOHOPGEWC7C66ZWMQNYEAI4","short_pith_number":"pith:3ALCOHOP","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"},"canonical_sha256":"d816271dcf312c2f8bdecd9906e0804736e5e57f967e0883a18e40cb84ac757a","source":{"kind":"arxiv","id":"1308.3210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3210","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3210v1","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3210","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"3ALCOHOPGEWC","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3ALCOHOPGEWC7C66","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3ALCOHOP","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3ALCOHOPGEWC7C66ZWMQNYEAI4","target":"record","payload":{"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"},"canonical_sha256":"d816271dcf312c2f8bdecd9906e0804736e5e57f967e0883a18e40cb84ac757a","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"},"source_kind":"arxiv","source_id":"1308.3210","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IHVePDZaRweUwdZXAHXe4uuYJoo2nP4cLMwK3E+juLJZbybQNvQtaPyH1Nw6d2qIrQd/TuSVUZ73ArGpJw8fCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:47:32.715000Z"},"content_sha256":"b08ca8f8ba2a0acb992dcdbc61ce6bf4d5517f12a669f85cbbe0b760acc4f5de","schema_version":"1.0","event_id":"sha256:b08ca8f8ba2a0acb992dcdbc61ce6bf4d5517f12a669f85cbbe0b760acc4f5de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3ALCOHOPGEWC7C66ZWMQNYEAI4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VYPtoHSSFz/OHXb5LW1+insK2DyyvYKM8tMcRppPEztXGnQb9jRUDwL3YAMAhdL/vY4tIHWu5NS+fo5M4MwXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:47:32.715362Z"},"content_sha256":"00d9633098f05bb4bfbec5c92d5f3d713195797c82573a6a5772dc13c4d49970","schema_version":"1.0","event_id":"sha256:00d9633098f05bb4bfbec5c92d5f3d713195797c82573a6a5772dc13c4d49970"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/bundle.json","state_url":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T04:47:32Z","links":{"resolver":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4","bundle":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/bundle.json","state":"https://pith.science/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ALCOHOPGEWC7C66ZWMQNYEAI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3ALCOHOPGEWC7C66ZWMQNYEAI4","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":"cc270eef962ca4a836a259607d3bc86d50cb838ea37ba0449545a99be85df830","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T19:00:25Z","title_canon_sha256":"fbac66c334ed2faad445bcab85f1dcb4945f49377bcc6d4465f2b45f7eda24f8"},"schema_version":"1.0","source":{"id":"1308.3210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3210","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3210v1","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3210","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"3ALCOHOPGEWC","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3ALCOHOPGEWC7C66","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3ALCOHOP","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:00d9633098f05bb4bfbec5c92d5f3d713195797c82573a6a5772dc13c4d49970","target":"graph","created_at":"2026-05-18T03:15:56Z","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":"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","authors_text":"Anant Godbole, Bill Kay, Samuel Connolly, Zachary Gabor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T19:00:25Z","title":"Bounds on the Maximum Number of Minimum Dominating Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3210","kind":"arxiv","version":1},"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:b08ca8f8ba2a0acb992dcdbc61ce6bf4d5517f12a669f85cbbe0b760acc4f5de","target":"record","created_at":"2026-05-18T03:15:56Z","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":"cc270eef962ca4a836a259607d3bc86d50cb838ea37ba0449545a99be85df830","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T19:00:25Z","title_canon_sha256":"fbac66c334ed2faad445bcab85f1dcb4945f49377bcc6d4465f2b45f7eda24f8"},"schema_version":"1.0","source":{"id":"1308.3210","kind":"arxiv","version":1}},"canonical_sha256":"d816271dcf312c2f8bdecd9906e0804736e5e57f967e0883a18e40cb84ac757a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d816271dcf312c2f8bdecd9906e0804736e5e57f967e0883a18e40cb84ac757a","first_computed_at":"2026-05-18T03:15:56.336148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:56.336148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NRcb4f6noiXwP9GjNwnwfQSuEpp8bnKS+bzQqDbk/lSyuIYjmcWAEOa5mzRB7ZN7bwQeNdi80yi+Jb3z+yODDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:56.336937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b08ca8f8ba2a0acb992dcdbc61ce6bf4d5517f12a669f85cbbe0b760acc4f5de","sha256:00d9633098f05bb4bfbec5c92d5f3d713195797c82573a6a5772dc13c4d49970"],"state_sha256":"92ce9141cd61a41d8e40d216b06ea24997e5bfadb8781707eb532da87ec58be7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v9Co8MNS2DW28TXWnWz9w9WGXEe+v6/5LpIDJXbkELJL3Xzq+yDII4/j1bxe6X2YtoCbj8g6zICSI2NT/WbNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:47:32.717263Z","bundle_sha256":"b3152e96ff6af443cf3692ed7916bf9e8627b77fd11390a37c9911d669907cdb"}}