{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:53IG74YUF5HKFQN3KFBMJVYTFB","short_pith_number":"pith:53IG74YU","canonical_record":{"source":{"id":"1804.00158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-31T10:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"412f0159d8a6678c24b19cd2c2789ae3b490bbf55b12312b4a0d1909d72ff1ac","abstract_canon_sha256":"2d8bd5458b3f1ba6b13c3515e58aa5a696e70074d0c2b89ed16a002478d98912"},"schema_version":"1.0"},"canonical_sha256":"eed06ff3142f4ea2c1bb5142c4d71328489c154aacd1ee5b6bfbf17e5adb3163","source":{"kind":"arxiv","id":"1804.00158","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00158","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00158v2","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00158","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"53IG74YUF5HK","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"53IG74YUF5HKFQN3","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"53IG74YU","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:53IG74YUF5HKFQN3KFBMJVYTFB","target":"record","payload":{"canonical_record":{"source":{"id":"1804.00158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-31T10:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"412f0159d8a6678c24b19cd2c2789ae3b490bbf55b12312b4a0d1909d72ff1ac","abstract_canon_sha256":"2d8bd5458b3f1ba6b13c3515e58aa5a696e70074d0c2b89ed16a002478d98912"},"schema_version":"1.0"},"canonical_sha256":"eed06ff3142f4ea2c1bb5142c4d71328489c154aacd1ee5b6bfbf17e5adb3163","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:45.501732Z","signature_b64":"fYiit2BWSsMhIh4F0yPQRw67w4ckXFF+VSi7RLHNJ92XBvFPOttriS9izgSXsGTaZwHuB/FeaUrhPEbMzJ1mCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eed06ff3142f4ea2c1bb5142c4d71328489c154aacd1ee5b6bfbf17e5adb3163","last_reissued_at":"2026-05-18T00:18:45.501271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:45.501271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.00158","source_version":2,"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-18T00:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElQrtrdLI5HWQpMaVcGaQzUf5D4e0k4BUZR6SiUpGhWmg3uKjVIKed9+wQuYqdFhhsIGPlcbEJuioiNnGl1rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:30:17.291303Z"},"content_sha256":"6236aea6e80e78524b123dd9ff33d3b3b3e7dae656f838b35872388a4b340090","schema_version":"1.0","event_id":"sha256:6236aea6e80e78524b123dd9ff33d3b3b3e7dae656f838b35872388a4b340090"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:53IG74YUF5HKFQN3KFBMJVYTFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the maximum number of minimum dominating sets in forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, E. Mohr, J.D. Alvarado, S. Dantas","submitted_at":"2018-03-31T10:58:08Z","abstract_excerpt":"Fricke, Hedetniemi, Hedetniemi, and Hutson asked whether every tree with domination number $\\gamma$ has at most $2^\\gamma$ minimum dominating sets. Bien gave a counterexample, which allows to construct forests with domination number $\\gamma$ and $2.0598^\\gamma$ minimum dominating sets. We show that every forest with domination number $\\gamma$ has at most $2.4606^\\gamma$ minimum dominating sets, and that every tree with independence number $\\alpha$ has at most $2^{\\alpha-1}+1$ maximum independent sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00158","kind":"arxiv","version":2},"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-18T00:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJyyZpqt+6mGxQKN5WxDknPB8HrPmj03fXzdHItYUcvon3mEmnbDmYPd0l/BqdwUJ1Kvf4CGl0cDYThHR1PbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:30:17.291678Z"},"content_sha256":"ea05f4456473b82f7255e97c7a7bc8783033ed8badb64cb514e894d18ba20655","schema_version":"1.0","event_id":"sha256:ea05f4456473b82f7255e97c7a7bc8783033ed8badb64cb514e894d18ba20655"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/53IG74YUF5HKFQN3KFBMJVYTFB/bundle.json","state_url":"https://pith.science/pith/53IG74YUF5HKFQN3KFBMJVYTFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/53IG74YUF5HKFQN3KFBMJVYTFB/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-11T13:30:17Z","links":{"resolver":"https://pith.science/pith/53IG74YUF5HKFQN3KFBMJVYTFB","bundle":"https://pith.science/pith/53IG74YUF5HKFQN3KFBMJVYTFB/bundle.json","state":"https://pith.science/pith/53IG74YUF5HKFQN3KFBMJVYTFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/53IG74YUF5HKFQN3KFBMJVYTFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:53IG74YUF5HKFQN3KFBMJVYTFB","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":"2d8bd5458b3f1ba6b13c3515e58aa5a696e70074d0c2b89ed16a002478d98912","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-31T10:58:08Z","title_canon_sha256":"412f0159d8a6678c24b19cd2c2789ae3b490bbf55b12312b4a0d1909d72ff1ac"},"schema_version":"1.0","source":{"id":"1804.00158","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00158","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00158v2","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00158","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"53IG74YUF5HK","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"53IG74YUF5HKFQN3","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"53IG74YU","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:ea05f4456473b82f7255e97c7a7bc8783033ed8badb64cb514e894d18ba20655","target":"graph","created_at":"2026-05-18T00:18:45Z","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":"Fricke, Hedetniemi, Hedetniemi, and Hutson asked whether every tree with domination number $\\gamma$ has at most $2^\\gamma$ minimum dominating sets. Bien gave a counterexample, which allows to construct forests with domination number $\\gamma$ and $2.0598^\\gamma$ minimum dominating sets. We show that every forest with domination number $\\gamma$ has at most $2.4606^\\gamma$ minimum dominating sets, and that every tree with independence number $\\alpha$ has at most $2^{\\alpha-1}+1$ maximum independent sets.","authors_text":"D. Rautenbach, E. Mohr, J.D. Alvarado, S. Dantas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-31T10:58:08Z","title":"On the maximum number of minimum dominating sets in forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00158","kind":"arxiv","version":2},"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:6236aea6e80e78524b123dd9ff33d3b3b3e7dae656f838b35872388a4b340090","target":"record","created_at":"2026-05-18T00:18:45Z","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":"2d8bd5458b3f1ba6b13c3515e58aa5a696e70074d0c2b89ed16a002478d98912","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-31T10:58:08Z","title_canon_sha256":"412f0159d8a6678c24b19cd2c2789ae3b490bbf55b12312b4a0d1909d72ff1ac"},"schema_version":"1.0","source":{"id":"1804.00158","kind":"arxiv","version":2}},"canonical_sha256":"eed06ff3142f4ea2c1bb5142c4d71328489c154aacd1ee5b6bfbf17e5adb3163","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eed06ff3142f4ea2c1bb5142c4d71328489c154aacd1ee5b6bfbf17e5adb3163","first_computed_at":"2026-05-18T00:18:45.501271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:45.501271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fYiit2BWSsMhIh4F0yPQRw67w4ckXFF+VSi7RLHNJ92XBvFPOttriS9izgSXsGTaZwHuB/FeaUrhPEbMzJ1mCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:45.501732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00158","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6236aea6e80e78524b123dd9ff33d3b3b3e7dae656f838b35872388a4b340090","sha256:ea05f4456473b82f7255e97c7a7bc8783033ed8badb64cb514e894d18ba20655"],"state_sha256":"fb38bfa47e7c764ee38bb253f1a571330d4b43456803fe95b86a4279b7eab950"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXJvIFHZpMuFpMQ1FD+ue0VpmBsH/ZVZv2CQDVTrX76mzSwql704C5U6IZwgJ1OlM5KoN238BDPs+yME59YXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:30:17.293892Z","bundle_sha256":"6cc42cd16f0c00ce66e652e19aaff3b573b246242270b4f0ba7052ea005c0a07"}}