{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E36REIBDOSITXMEMJTAD4EKXND","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":"dc566380ee511d0a748357d58d32d55feed9b52b49505dcc59cb555b900a1e69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-21T07:45:36Z","title_canon_sha256":"a65b11719f0b5599063d3b41c801f77ea544ed58d676261a196ace2bbe4c461f"},"schema_version":"1.0","source":{"id":"1705.07409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07409","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07409v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07409","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"E36REIBDOSIT","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E36REIBDOSITXMEM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E36REIBD","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:1f6084b32d81cb68c5a7228ac90ff76ec7558b779d98f3b83bc393f2c1c5dddb","target":"graph","created_at":"2026-05-18T00:44:05Z","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 an integer $k$ at least $2$, and a graph $G$, let $f_k(G)$ be the minimum cardinality of a set $X$ of vertices of $G$ such that $G-X$ has either $k$ vertices of maximum degree or order less than $k$. Caro and Yuster (Discrete Mathematics 310 (2010) 742-747) conjectured that, for every $k$, there is a constant $c_k$ such that $f_k(G)\\leq c_k \\sqrt{n(G)}$ for every graph $G$. Verifying a conjecture of Caro, Lauri, and Zarb (arXiv:1704.08472v1), we show the best possible result that, if $t$ is a positive integer, and $F$ is a forest of order at most $\\frac{1}{6}\\left(t^3+6t^2+17t+12\\right)$, ","authors_text":"D. Rautenbach, M.A. Henning, M. F\\\"urst, M. Gentner, S. J\\\"ager","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-21T07:45:36Z","title":"Equating $k$ Maximum Degrees in Graphs without Short Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07409","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:5e6eaecde5be8aaa5792f47fe5a186209760b2e687fb2ded42d3bdcd1ba00c98","target":"record","created_at":"2026-05-18T00:44:05Z","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":"dc566380ee511d0a748357d58d32d55feed9b52b49505dcc59cb555b900a1e69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-21T07:45:36Z","title_canon_sha256":"a65b11719f0b5599063d3b41c801f77ea544ed58d676261a196ace2bbe4c461f"},"schema_version":"1.0","source":{"id":"1705.07409","kind":"arxiv","version":1}},"canonical_sha256":"26fd12202374913bb08c4cc03e115768c5a71a30e37c700c66a1eac604c1cb70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26fd12202374913bb08c4cc03e115768c5a71a30e37c700c66a1eac604c1cb70","first_computed_at":"2026-05-18T00:44:05.687086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:05.687086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R5irq6Uh9Q/nSGowiOg0NgL6AxgHc+dBLUDC4e3z43BhOBx6R75d7CPUchO6nZHkuqg/T/oAp6imjbsPNV97Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:05.687640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e6eaecde5be8aaa5792f47fe5a186209760b2e687fb2ded42d3bdcd1ba00c98","sha256:1f6084b32d81cb68c5a7228ac90ff76ec7558b779d98f3b83bc393f2c1c5dddb"],"state_sha256":"855b0bb544135314386b71b1e9e5422020baf1a237a20da731959fb79c17b9c2"}