{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HTRWJ3GWA5HFBGFJ6EZ2JPOUAJ","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":"58489e0bcd15b1b24cb4329d7cf9d93d35d087cdd554c5802efd19a6bd01893c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-16T16:48:35Z","title_canon_sha256":"525dc1d1a9e9ec297204aabb65973193cd3f129c8184379f5398a09718ca0270"},"schema_version":"1.0","source":{"id":"1507.04647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04647","created_at":"2026-05-18T01:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04647v1","created_at":"2026-05-18T01:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04647","created_at":"2026-05-18T01:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"HTRWJ3GWA5HF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HTRWJ3GWA5HFBGFJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HTRWJ3GW","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:d6dea51f4d174e7f9f1616310402509e8c7fb925a86d1f964540136d9a07ba5f","target":"graph","created_at":"2026-05-18T01:36:46Z","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":"For a sequence $d$ of non-negative integers, let ${\\cal G}(d)$ and ${\\cal F}(d)$ be the sets of all graphs and forests with degree sequence $d$, respectively. Let $\\gamma_{\\min}(d)=\\min\\{ \\gamma(G):G\\in {\\cal G}(d)\\}$, $\\alpha_{\\max}(d)=\\max\\{ \\alpha(G):G\\in {\\cal G}(d)\\}$, $\\gamma_{\\min}^{\\cal F}(d)=\\min\\{ \\gamma(F):F\\in {\\cal F}(d)\\}$, and $\\alpha_{\\max}^{\\cal F}(d)=\\max\\{ \\alpha(F):F\\in {\\cal F}(d)\\}$ where $\\gamma(G)$ is the domination number and $\\alpha(G)$ is the independence number of a graph $G$. Adapting results of Havel and Hakimi, Rao showed in 1979 that $\\alpha_{\\max}(d)$ can be de","authors_text":"Dieter Rautenbach, Michael A. Henning, Michael Gentner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-16T16:48:35Z","title":"Smallest Domination Number and Largest Independence Number of Graphs and Forests with given Degree Sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04647","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:2267f1d2fcedde95b2847d4fab4a53934655e5c54c0312021099d91423dd8c21","target":"record","created_at":"2026-05-18T01:36:46Z","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":"58489e0bcd15b1b24cb4329d7cf9d93d35d087cdd554c5802efd19a6bd01893c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-16T16:48:35Z","title_canon_sha256":"525dc1d1a9e9ec297204aabb65973193cd3f129c8184379f5398a09718ca0270"},"schema_version":"1.0","source":{"id":"1507.04647","kind":"arxiv","version":1}},"canonical_sha256":"3ce364ecd6074e5098a9f133a4bdd4027f5b876c43a49865185972b59cf1eacc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ce364ecd6074e5098a9f133a4bdd4027f5b876c43a49865185972b59cf1eacc","first_computed_at":"2026-05-18T01:36:46.786578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:46.786578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pxSQWHeT9e5WqkPoyrMwYuJqxVRElG+LW38r8qNPNVf2U6VQ8PWrvlMUWhASQoMNxjPEZDgmYGgsqmcE5t3oCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:46.787164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2267f1d2fcedde95b2847d4fab4a53934655e5c54c0312021099d91423dd8c21","sha256:d6dea51f4d174e7f9f1616310402509e8c7fb925a86d1f964540136d9a07ba5f"],"state_sha256":"22357e9b9c51775fd0644f66991764f8403912de13e71e0580573e669dc91efd"}