{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WGOROANOF55AVX7646LFQVHQKS","short_pith_number":"pith:WGOROANO","schema_version":"1.0","canonical_sha256":"b19d1701ae2f7a0adffee7965854f054b7f845a2966d99df19c34abc154be761","source":{"kind":"arxiv","id":"1312.1213","version":1},"attestation_state":"computed","paper":{"title":"Forcing $k$-repetitions in degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Raphael Yuster, Yair Caro","submitted_at":"2013-12-04T15:43:26Z","abstract_excerpt":"One of the most basic results in graph theory states that every graph with at least two vertices has two vertices with the same degree. Since there are graphs without $3$ vertices of the same degree, it is natural to ask if for any fixed $k$, every graph $G$ is ``close'' to a graph $G'$ with $k$ vertices of the same degree. Our main result in this paper is that this is indeed the case. Specifically, we show that for any positive integer $k$, there is a constant $C=C(k)$, so that given any graph $G$, one can remove from $G$ at most $C$ vertices and thus obtain a new graph $G'$ that contains at "},"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":"1312.1213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-04T15:43:26Z","cross_cats_sorted":[],"title_canon_sha256":"1c91854db7b2047c1caffb7ac88789bfc30c0a2901a89de864fcf6c456f3e0db","abstract_canon_sha256":"00ed82f592f48e3b2cc876e870c116f4095f4a092c68a46704c7f117b33cc919"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:34.654499Z","signature_b64":"aqKyLiTnTPgNd385/NaEo94n+PsmsimZe25kfaoSBDZaC0iD5p9QQrNUsEtYZyxlPmNn7OMdcgSrNy3Dkt5vDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b19d1701ae2f7a0adffee7965854f054b7f845a2966d99df19c34abc154be761","last_reissued_at":"2026-05-18T03:05:34.653838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:34.653838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forcing $k$-repetitions in degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Raphael Yuster, Yair Caro","submitted_at":"2013-12-04T15:43:26Z","abstract_excerpt":"One of the most basic results in graph theory states that every graph with at least two vertices has two vertices with the same degree. Since there are graphs without $3$ vertices of the same degree, it is natural to ask if for any fixed $k$, every graph $G$ is ``close'' to a graph $G'$ with $k$ vertices of the same degree. Our main result in this paper is that this is indeed the case. Specifically, we show that for any positive integer $k$, there is a constant $C=C(k)$, so that given any graph $G$, one can remove from $G$ at most $C$ vertices and thus obtain a new graph $G'$ that contains at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1213","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":"1312.1213","created_at":"2026-05-18T03:05:34.653936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1213v1","created_at":"2026-05-18T03:05:34.653936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1213","created_at":"2026-05-18T03:05:34.653936+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGOROANOF55A","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGOROANOF55AVX76","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGOROANO","created_at":"2026-05-18T12:28:04.890932+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/WGOROANOF55AVX7646LFQVHQKS","json":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS.json","graph_json":"https://pith.science/api/pith-number/WGOROANOF55AVX7646LFQVHQKS/graph.json","events_json":"https://pith.science/api/pith-number/WGOROANOF55AVX7646LFQVHQKS/events.json","paper":"https://pith.science/paper/WGOROANO"},"agent_actions":{"view_html":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS","download_json":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS.json","view_paper":"https://pith.science/paper/WGOROANO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1213&json=true","fetch_graph":"https://pith.science/api/pith-number/WGOROANOF55AVX7646LFQVHQKS/graph.json","fetch_events":"https://pith.science/api/pith-number/WGOROANOF55AVX7646LFQVHQKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS/action/storage_attestation","attest_author":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS/action/author_attestation","sign_citation":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS/action/citation_signature","submit_replication":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS/action/replication_record"}},"created_at":"2026-05-18T03:05:34.653936+00:00","updated_at":"2026-05-18T03:05:34.653936+00:00"}