{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IZVHCTTU3HA2KDQEOAMDCMHBL5","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":"631b01b30db5a10f36667fb3b960da91bf6518ec60f9c5c28c62eff9a01498f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-17T21:08:01Z","title_canon_sha256":"cff34d1df2e18836d17d28a2342e4178fb6d1f48adc1f14cb9c64329fbacecaa"},"schema_version":"1.0","source":{"id":"1811.07221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07221","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07221v1","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07221","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"pith_short_12","alias_value":"IZVHCTTU3HA2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IZVHCTTU3HA2KDQE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IZVHCTTU","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:3fd7cc5f951d5bf78df00cd0d4cbe9980f60043a73078d95e361c1372b18ae83","target":"graph","created_at":"2026-05-18T00:00:28Z","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":"Erd\\H{o}s, Fajtlowicz and Staton asked for the least integer $f(k)$ such that every graph with more than $f(k)$ vertices has an induced regular subgraph with at least $k$ vertices. Here we consider the following relaxed notions. Let $g(k)$ be the least integer such that every graph with more than $g(k)$ vertices has an induced subgraph with at least $k$ repeated degrees and let $h(k)$ be the least integer such that every graph with more than $h(k)$ vertices has an induced subgraph with at least $k$ maximum degree vertices. We obtain polynomial lower bounds for $h(k)$ and $g(k)$ and nontrivial ","authors_text":"Raphael Yuster, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-17T21:08:01Z","title":"Induced subgraphs with many repeated degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07221","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:ab7519284b3789c45c716bfe52b8b3b43b671acf90367ef4260eea2eb41b63c4","target":"record","created_at":"2026-05-18T00:00:28Z","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":"631b01b30db5a10f36667fb3b960da91bf6518ec60f9c5c28c62eff9a01498f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-17T21:08:01Z","title_canon_sha256":"cff34d1df2e18836d17d28a2342e4178fb6d1f48adc1f14cb9c64329fbacecaa"},"schema_version":"1.0","source":{"id":"1811.07221","kind":"arxiv","version":1}},"canonical_sha256":"466a714e74d9c1a50e0470183130e15f7a39c78d41b35a629ebb4ba48e54211e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"466a714e74d9c1a50e0470183130e15f7a39c78d41b35a629ebb4ba48e54211e","first_computed_at":"2026-05-18T00:00:28.606724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:28.606724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Nsl9lYOt+rgP/sFlR1Ap6mpXdpqbzxtjh6NLCKfcIDoSZegUFmXgC0W46g3Tsi6YkkTALqeHxO1gJJfEXaSAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:28.607161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab7519284b3789c45c716bfe52b8b3b43b671acf90367ef4260eea2eb41b63c4","sha256:3fd7cc5f951d5bf78df00cd0d4cbe9980f60043a73078d95e361c1372b18ae83"],"state_sha256":"bddc804cbf7483ff064e57a19e7b9f67ffeb0b9212362cc9a970101ec50d9b61"}