{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XX5ZS3V24V6RNWFWO4XEG7GAS2","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":"3ad781df3f422322e9a786ffae886680c25a980d8dccb47bce60074fe1dbecd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-27T08:18:50Z","title_canon_sha256":"4bd6e3d29f09153b2d13a581fc9169907b475399ecfa8e9482ab42f61b94160a"},"schema_version":"1.0","source":{"id":"1704.08472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08472","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08472v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08472","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"XX5ZS3V24V6R","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XX5ZS3V24V6RNWFW","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XX5ZS3V2","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:2c4973cd5d98804ce9ebf8f607af5c8891bae8401302830c87ac61ab285b61ba","target":"graph","created_at":"2026-05-18T00:45:27Z","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":"Given a graph $G$, we would like to find (if it exists) the largest induced subgraph $H$ in which there are at least $k$ vertices realizing the maximum degree of $H$. This problem was first posed by Caro and Yuster. They proved, for example, that for every graph $G$ on $n$ vertices we can guarantee, for $k = 2$, such an induced subgraph $H$ by deleting at most $2\\sqrt{n}$ vertices, but the question if $2\\sqrt{n}$ is best possible remains open.\n  Among the results obtained in this paper we prove that:\n  1. For every graph $G$ on $n \\geq 4$ vertices we can delete at most $\\lceil \\frac{- 3 + \\sqr","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-27T08:18:50Z","title":"Equating two maximum degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08472","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:eca1b9cff6d266f2df1b504f8e10c423428c514684c5a4e32dd78db2311cb3de","target":"record","created_at":"2026-05-18T00:45:27Z","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":"3ad781df3f422322e9a786ffae886680c25a980d8dccb47bce60074fe1dbecd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-27T08:18:50Z","title_canon_sha256":"4bd6e3d29f09153b2d13a581fc9169907b475399ecfa8e9482ab42f61b94160a"},"schema_version":"1.0","source":{"id":"1704.08472","kind":"arxiv","version":1}},"canonical_sha256":"bdfb996ebae57d16d8b6772e437cc096a93e8ffb3dd87dd98bb8788ecf1bd975","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdfb996ebae57d16d8b6772e437cc096a93e8ffb3dd87dd98bb8788ecf1bd975","first_computed_at":"2026-05-18T00:45:27.606560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:27.606560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T2a0YkjTN5/v5cv/LuBpZ2ZVgpoD1ntRdlLZMpcRoClHmcNVpLv6e0HxyLb/FGcsIVVP2tEOkzd4OSe3k2mjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:27.607059Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eca1b9cff6d266f2df1b504f8e10c423428c514684c5a4e32dd78db2311cb3de","sha256:2c4973cd5d98804ce9ebf8f607af5c8891bae8401302830c87ac61ab285b61ba"],"state_sha256":"f8d4d450e750672b554454ed466d0c71e9416013f611e2137c9331ceca4a8fef"}