{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XX5ZS3V24V6RNWFWO4XEG7GAS2","short_pith_number":"pith:XX5ZS3V2","schema_version":"1.0","canonical_sha256":"bdfb996ebae57d16d8b6772e437cc096a93e8ffb3dd87dd98bb8788ecf1bd975","source":{"kind":"arxiv","id":"1704.08472","version":1},"attestation_state":"computed","paper":{"title":"Equating two maximum degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","submitted_at":"2017-04-27T08:18:50Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1704.08472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-27T08:18:50Z","cross_cats_sorted":[],"title_canon_sha256":"4bd6e3d29f09153b2d13a581fc9169907b475399ecfa8e9482ab42f61b94160a","abstract_canon_sha256":"3ad781df3f422322e9a786ffae886680c25a980d8dccb47bce60074fe1dbecd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.607059Z","signature_b64":"T2a0YkjTN5/v5cv/LuBpZ2ZVgpoD1ntRdlLZMpcRoClHmcNVpLv6e0HxyLb/FGcsIVVP2tEOkzd4OSe3k2mjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdfb996ebae57d16d8b6772e437cc096a93e8ffb3dd87dd98bb8788ecf1bd975","last_reissued_at":"2026-05-18T00:45:27.606560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.606560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equating two maximum degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","submitted_at":"2017-04-27T08:18:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08472","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.08472","created_at":"2026-05-18T00:45:27.606643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08472v1","created_at":"2026-05-18T00:45:27.606643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08472","created_at":"2026-05-18T00:45:27.606643+00:00"},{"alias_kind":"pith_short_12","alias_value":"XX5ZS3V24V6R","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XX5ZS3V24V6RNWFW","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XX5ZS3V2","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XX5ZS3V24V6RNWFWO4XEG7GAS2","json":"https://pith.science/pith/XX5ZS3V24V6RNWFWO4XEG7GAS2.json","graph_json":"https://pith.science/api/pith-number/XX5ZS3V24V6RNWFWO4XEG7GAS2/graph.json","events_json":"https://pith.science/api/pith-number/XX5ZS3V24V6RNWFWO4XEG7GAS2/events.json","paper":"https://pith.science/paper/XX5ZS3V2"},"agent_actions":{"view_html":"https://pith.science/pith/XX5ZS3V24V6RNWFWO4XEG7GAS2","download_json":"https://pith.science/pith/XX5ZS3V24V6RNWFWO4XEG7GAS2.json","view_paper":"https://pith.science/paper/XX5ZS3V2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08472&json=true","fetch_graph":"https://pith.science/api/pith-number/XX5ZS3V24V6RNWFWO4XEG7GAS2/graph.json","fetch_events":"https://pith.science/api/pith-number/XX5ZS3V24V6RNWFWO4XEG7GAS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XX5ZS3V24V6RNWFWO4XEG7GAS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XX5ZS3V24V6RNWFWO4XEG7GAS2/action/storage_attestation","attest_author":"https://pith.science/pith/XX5ZS3V24V6RNWFWO4XEG7GAS2/action/author_attestation","sign_citation":"https://pith.science/pith/XX5ZS3V24V6RNWFWO4XEG7GAS2/action/citation_signature","submit_replication":"https://pith.science/pith/XX5ZS3V24V6RNWFWO4XEG7GAS2/action/replication_record"}},"created_at":"2026-05-18T00:45:27.606643+00:00","updated_at":"2026-05-18T00:45:27.606643+00:00"}