{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U4ZYCRS4ZYIGKAK4AMUAWSMEWB","short_pith_number":"pith:U4ZYCRS4","canonical_record":{"source":{"id":"1608.04560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-16T11:54:29Z","cross_cats_sorted":[],"title_canon_sha256":"8be335c5519eef666eb576ea13bd24265baa74d776abbc6ab445950f4593c82d","abstract_canon_sha256":"c4a2096c9fa6189921753bd167e363ad222d85f3d4989e619c463564f1e1ff90"},"schema_version":"1.0"},"canonical_sha256":"a73381465cce1065015c03280b4984b07cbbbc0ff9734eb6db5a7942ec99d673","source":{"kind":"arxiv","id":"1608.04560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04560","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04560v1","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04560","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"U4ZYCRS4ZYIG","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U4ZYCRS4ZYIGKAK4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U4ZYCRS4","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U4ZYCRS4ZYIGKAK4AMUAWSMEWB","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-16T11:54:29Z","cross_cats_sorted":[],"title_canon_sha256":"8be335c5519eef666eb576ea13bd24265baa74d776abbc6ab445950f4593c82d","abstract_canon_sha256":"c4a2096c9fa6189921753bd167e363ad222d85f3d4989e619c463564f1e1ff90"},"schema_version":"1.0"},"canonical_sha256":"a73381465cce1065015c03280b4984b07cbbbc0ff9734eb6db5a7942ec99d673","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:36.853084Z","signature_b64":"QK6yojibz5q9Kvf+FBgAsTwSRov4hAsJzVhcQph4jxYFjIWpJBfjTPGBcIj2xQJX9BqO7FM60qdYMovPRd7TBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a73381465cce1065015c03280b4984b07cbbbc0ff9734eb6db5a7942ec99d673","last_reissued_at":"2026-05-18T01:08:36.852444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:36.852444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04560","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-18T01:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1/3WAwSbKWkMvFKSwFMPEnsdZIleSfeyEWBmQDWC/Dh5s+D5f67FIDAolE2nuP9LahxDxLtaNF5lY5b6c09DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:29:36.545645Z"},"content_sha256":"e7bd01eeafed625989437192523fece9968d7876ebcd219dfc540258316e01e2","schema_version":"1.0","event_id":"sha256:e7bd01eeafed625989437192523fece9968d7876ebcd219dfc540258316e01e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U4ZYCRS4ZYIGKAK4AMUAWSMEWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some Comments on the Slater number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Michael Gentner","submitted_at":"2016-08-16T11:54:29Z","abstract_excerpt":"Let $G$ be a graph with degree sequence $d_1\\geq \\ldots \\geq d_n$. Slater proposed $s\\ell(G)=\\min\\{ s: (d_1+1)+\\cdots+(d_s+1)\\geq n\\}$ as a lower bound on the domination number $\\gamma(G)$ of $G$. We show that deciding the equality of $\\gamma(G)$ and $s\\ell(G)$ for a given graph $G$ is NP-complete but that one can decide efficiently whether $\\gamma(G)>s\\ell(G)$ or $\\gamma(G)\\leq \\left(\\left\\lceil\\ln \\left(\\frac{n(G)}{s\\ell(G)}\\right)\\right\\rceil+1\\right)s\\ell(G)$. For real numbers $\\alpha$ and $\\beta$ with $\\alpha\\geq \\max\\{ 0,\\beta\\}$, let ${\\cal G}(\\alpha,\\beta)$ be the class of non-null gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04560","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-18T01:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6fUHLMIrPwnT5iVsIMHoAAww4lX1AmZajTvZrMuwLI7eBEa1cow4+DxXbt1v6VwsDvYi6F1WpA9HIywlt9uDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:29:36.546412Z"},"content_sha256":"fa499bd2a8d4ffe5bcc01c3f31ac5dfdee500065e26202e8def48ae120309770","schema_version":"1.0","event_id":"sha256:fa499bd2a8d4ffe5bcc01c3f31ac5dfdee500065e26202e8def48ae120309770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4ZYCRS4ZYIGKAK4AMUAWSMEWB/bundle.json","state_url":"https://pith.science/pith/U4ZYCRS4ZYIGKAK4AMUAWSMEWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4ZYCRS4ZYIGKAK4AMUAWSMEWB/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-11T08:29:36Z","links":{"resolver":"https://pith.science/pith/U4ZYCRS4ZYIGKAK4AMUAWSMEWB","bundle":"https://pith.science/pith/U4ZYCRS4ZYIGKAK4AMUAWSMEWB/bundle.json","state":"https://pith.science/pith/U4ZYCRS4ZYIGKAK4AMUAWSMEWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4ZYCRS4ZYIGKAK4AMUAWSMEWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U4ZYCRS4ZYIGKAK4AMUAWSMEWB","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":"c4a2096c9fa6189921753bd167e363ad222d85f3d4989e619c463564f1e1ff90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-16T11:54:29Z","title_canon_sha256":"8be335c5519eef666eb576ea13bd24265baa74d776abbc6ab445950f4593c82d"},"schema_version":"1.0","source":{"id":"1608.04560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04560","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04560v1","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04560","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"U4ZYCRS4ZYIG","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U4ZYCRS4ZYIGKAK4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U4ZYCRS4","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:fa499bd2a8d4ffe5bcc01c3f31ac5dfdee500065e26202e8def48ae120309770","target":"graph","created_at":"2026-05-18T01:08:36Z","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":"Let $G$ be a graph with degree sequence $d_1\\geq \\ldots \\geq d_n$. Slater proposed $s\\ell(G)=\\min\\{ s: (d_1+1)+\\cdots+(d_s+1)\\geq n\\}$ as a lower bound on the domination number $\\gamma(G)$ of $G$. We show that deciding the equality of $\\gamma(G)$ and $s\\ell(G)$ for a given graph $G$ is NP-complete but that one can decide efficiently whether $\\gamma(G)>s\\ell(G)$ or $\\gamma(G)\\leq \\left(\\left\\lceil\\ln \\left(\\frac{n(G)}{s\\ell(G)}\\right)\\right\\rceil+1\\right)s\\ell(G)$. For real numbers $\\alpha$ and $\\beta$ with $\\alpha\\geq \\max\\{ 0,\\beta\\}$, let ${\\cal G}(\\alpha,\\beta)$ be the class of non-null gra","authors_text":"Dieter Rautenbach, Michael Gentner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-16T11:54:29Z","title":"Some Comments on the Slater number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04560","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:e7bd01eeafed625989437192523fece9968d7876ebcd219dfc540258316e01e2","target":"record","created_at":"2026-05-18T01:08:36Z","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":"c4a2096c9fa6189921753bd167e363ad222d85f3d4989e619c463564f1e1ff90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-16T11:54:29Z","title_canon_sha256":"8be335c5519eef666eb576ea13bd24265baa74d776abbc6ab445950f4593c82d"},"schema_version":"1.0","source":{"id":"1608.04560","kind":"arxiv","version":1}},"canonical_sha256":"a73381465cce1065015c03280b4984b07cbbbc0ff9734eb6db5a7942ec99d673","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a73381465cce1065015c03280b4984b07cbbbc0ff9734eb6db5a7942ec99d673","first_computed_at":"2026-05-18T01:08:36.852444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:36.852444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QK6yojibz5q9Kvf+FBgAsTwSRov4hAsJzVhcQph4jxYFjIWpJBfjTPGBcIj2xQJX9BqO7FM60qdYMovPRd7TBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:36.853084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7bd01eeafed625989437192523fece9968d7876ebcd219dfc540258316e01e2","sha256:fa499bd2a8d4ffe5bcc01c3f31ac5dfdee500065e26202e8def48ae120309770"],"state_sha256":"f4c6772c05a65581f2925d602b170450a0deb8bde1a71b7bb6cf81e4ffb6a6f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9tf5oAj42iWhexobkHZc0TsbFkdOWXu3XnM3wD3/3qBv/3rLKcGaHChCiwcmIIcfGtCfMLJvMRtvJZ6MrUMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:29:36.550771Z","bundle_sha256":"3f75ca704458a76f4109ffd7f2bf82855ce926e45d557e84751a1daf6bf7cf06"}}