{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6UEFJCWKXGK3PIT562USUYHTCY","short_pith_number":"pith:6UEFJCWK","canonical_record":{"source":{"id":"1503.00998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-03T16:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"7053f1fa9fb7c7024e6f1493b817def69983f7661ccf856632f436475cc4907b","abstract_canon_sha256":"d4115b2a0ef341f5f7ac118c38fc8401c0083e199747a3831fd1ce80c069bd50"},"schema_version":"1.0"},"canonical_sha256":"f508548acab995b7a27df6a92a60f316036d5af99d4c1cdd1bfc1ae035c2bea8","source":{"kind":"arxiv","id":"1503.00998","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00998","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00998v1","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00998","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"6UEFJCWKXGK3","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6UEFJCWKXGK3PIT5","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6UEFJCWK","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6UEFJCWKXGK3PIT562USUYHTCY","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-03T16:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"7053f1fa9fb7c7024e6f1493b817def69983f7661ccf856632f436475cc4907b","abstract_canon_sha256":"d4115b2a0ef341f5f7ac118c38fc8401c0083e199747a3831fd1ce80c069bd50"},"schema_version":"1.0"},"canonical_sha256":"f508548acab995b7a27df6a92a60f316036d5af99d4c1cdd1bfc1ae035c2bea8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:47.937245Z","signature_b64":"BxmyMMVXpdhQ0UhlL6CvqBt1+3LB9Z+NTuUWP8zw8d1wdkayfVbgBkKcl7tC8F6HLAqcEwn/RVNVYtf8/bDVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f508548acab995b7a27df6a92a60f316036d5af99d4c1cdd1bfc1ae035c2bea8","last_reissued_at":"2026-05-18T02:25:47.936779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:47.936779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00998","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-18T02:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yp9nYwK7lai05IjzA/UrxCM7nj2p/1UN/Kb2o0MsEE+w+AL2ImOnq6dhBQhKzMecoT2tWelgjW+VPb2+q+0ZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:30:04.718579Z"},"content_sha256":"35fc042d63b065793e4d332c9a71fd0610a3e641c24104991de1a24ded0a463b","schema_version":"1.0","event_id":"sha256:35fc042d63b065793e4d332c9a71fd0610a3e641c24104991de1a24ded0a463b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6UEFJCWKXGK3PIT562USUYHTCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting dominating sets and related structures in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. J. Radcliffe, Jonathan Cutler","submitted_at":"2015-03-03T16:29:58Z","abstract_excerpt":"We consider some problems concerning the maximum number of (strong) dominating sets in a regular graph, and their weighted analogues. Our primary tool is Shearer's entropy lemma. These techniques extend to a reasonably broad class of graph parameters enumerating vertex colorings satisfying conditions on the multiset of colors appearing in (closed) neighborhoods. We also generalize further to enumeration problems for what we call existence homomorphisms. Here our results are substantially less complete, though we do solve some natural problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00998","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-18T02:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6Ui8U9WZ5OIrNBSwAgOvnfVsU2WOCeDsg5kCgHKUfiJ0jPDN4j4NKSNO7YBhpqDquNd4JzObb+KZD0piCF/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:30:04.718927Z"},"content_sha256":"eb032af484fe69e7d52cc8c463f9cf60a3d98001b07d0ab9eba95d30ae21f2e8","schema_version":"1.0","event_id":"sha256:eb032af484fe69e7d52cc8c463f9cf60a3d98001b07d0ab9eba95d30ae21f2e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6UEFJCWKXGK3PIT562USUYHTCY/bundle.json","state_url":"https://pith.science/pith/6UEFJCWKXGK3PIT562USUYHTCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6UEFJCWKXGK3PIT562USUYHTCY/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-03T06:30:04Z","links":{"resolver":"https://pith.science/pith/6UEFJCWKXGK3PIT562USUYHTCY","bundle":"https://pith.science/pith/6UEFJCWKXGK3PIT562USUYHTCY/bundle.json","state":"https://pith.science/pith/6UEFJCWKXGK3PIT562USUYHTCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6UEFJCWKXGK3PIT562USUYHTCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6UEFJCWKXGK3PIT562USUYHTCY","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":"d4115b2a0ef341f5f7ac118c38fc8401c0083e199747a3831fd1ce80c069bd50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-03T16:29:58Z","title_canon_sha256":"7053f1fa9fb7c7024e6f1493b817def69983f7661ccf856632f436475cc4907b"},"schema_version":"1.0","source":{"id":"1503.00998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00998","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00998v1","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00998","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"6UEFJCWKXGK3","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6UEFJCWKXGK3PIT5","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6UEFJCWK","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:eb032af484fe69e7d52cc8c463f9cf60a3d98001b07d0ab9eba95d30ae21f2e8","target":"graph","created_at":"2026-05-18T02:25:47Z","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 consider some problems concerning the maximum number of (strong) dominating sets in a regular graph, and their weighted analogues. Our primary tool is Shearer's entropy lemma. These techniques extend to a reasonably broad class of graph parameters enumerating vertex colorings satisfying conditions on the multiset of colors appearing in (closed) neighborhoods. We also generalize further to enumeration problems for what we call existence homomorphisms. Here our results are substantially less complete, though we do solve some natural problems.","authors_text":"A. J. Radcliffe, Jonathan Cutler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-03T16:29:58Z","title":"Counting dominating sets and related structures in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00998","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:35fc042d63b065793e4d332c9a71fd0610a3e641c24104991de1a24ded0a463b","target":"record","created_at":"2026-05-18T02:25:47Z","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":"d4115b2a0ef341f5f7ac118c38fc8401c0083e199747a3831fd1ce80c069bd50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-03T16:29:58Z","title_canon_sha256":"7053f1fa9fb7c7024e6f1493b817def69983f7661ccf856632f436475cc4907b"},"schema_version":"1.0","source":{"id":"1503.00998","kind":"arxiv","version":1}},"canonical_sha256":"f508548acab995b7a27df6a92a60f316036d5af99d4c1cdd1bfc1ae035c2bea8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f508548acab995b7a27df6a92a60f316036d5af99d4c1cdd1bfc1ae035c2bea8","first_computed_at":"2026-05-18T02:25:47.936779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:47.936779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BxmyMMVXpdhQ0UhlL6CvqBt1+3LB9Z+NTuUWP8zw8d1wdkayfVbgBkKcl7tC8F6HLAqcEwn/RVNVYtf8/bDVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:47.937245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35fc042d63b065793e4d332c9a71fd0610a3e641c24104991de1a24ded0a463b","sha256:eb032af484fe69e7d52cc8c463f9cf60a3d98001b07d0ab9eba95d30ae21f2e8"],"state_sha256":"fa4a0ce8395182d7563397fb97c48b14e94d120a59c53d63cbb72956027af9d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtVgfJLdQ50NurcEPXqln3pP/cO24ok4ntG88S3khIRltoufOWhRFOFmZftPLeEkt5VVp9omWveiz6wpLu0VAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:30:04.720859Z","bundle_sha256":"9d255f05cc9c5b06f695294cfb309471bb1653f0702ac215ef03cbdbf601e154"}}