{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WGOROANOF55AVX7646LFQVHQKS","short_pith_number":"pith:WGOROANO","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"},"canonical_sha256":"b19d1701ae2f7a0adffee7965854f054b7f845a2966d99df19c34abc154be761","source":{"kind":"arxiv","id":"1312.1213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1213","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1213v1","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1213","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"WGOROANOF55A","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WGOROANOF55AVX76","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WGOROANO","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WGOROANOF55AVX7646LFQVHQKS","target":"record","payload":{"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"},"canonical_sha256":"b19d1701ae2f7a0adffee7965854f054b7f845a2966d99df19c34abc154be761","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"},"source_kind":"arxiv","source_id":"1312.1213","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QwZ6ria68md5+q8GzdMuNXLTGmMqaHWwNNqjimS2proBX11ipyZToJK9RB6hpm74AZWwkrqq7XmsOD4ZanCNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T00:31:46.196904Z"},"content_sha256":"b2bfcd98dab1a88de9bb9e077a3a5e23b2f9acd4e519e7f21b8c347df6688f9b","schema_version":"1.0","event_id":"sha256:b2bfcd98dab1a88de9bb9e077a3a5e23b2f9acd4e519e7f21b8c347df6688f9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WGOROANOF55AVX7646LFQVHQKS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buRhQHeOBhiMqv6f+0v1YZHm7ev9L3RKZqbffxk/PAGcdEe3a590dU+NpNgZXSLHPcN7tGazm0n/HBYxt4/LBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T00:31:46.197513Z"},"content_sha256":"c5541d1560eefab849c9d03dc7916721349bd4c716889e1cae09d5e7968b9489","schema_version":"1.0","event_id":"sha256:c5541d1560eefab849c9d03dc7916721349bd4c716889e1cae09d5e7968b9489"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS/bundle.json","state_url":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGOROANOF55AVX7646LFQVHQKS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T00:31:46Z","links":{"resolver":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS","bundle":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS/bundle.json","state":"https://pith.science/pith/WGOROANOF55AVX7646LFQVHQKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGOROANOF55AVX7646LFQVHQKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WGOROANOF55AVX7646LFQVHQKS","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":"00ed82f592f48e3b2cc876e870c116f4095f4a092c68a46704c7f117b33cc919","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-04T15:43:26Z","title_canon_sha256":"1c91854db7b2047c1caffb7ac88789bfc30c0a2901a89de864fcf6c456f3e0db"},"schema_version":"1.0","source":{"id":"1312.1213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1213","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1213v1","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1213","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"WGOROANOF55A","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WGOROANOF55AVX76","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WGOROANO","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:c5541d1560eefab849c9d03dc7916721349bd4c716889e1cae09d5e7968b9489","target":"graph","created_at":"2026-05-18T03:05:34Z","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":"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 ","authors_text":"Asaf Shapira, Raphael Yuster, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-04T15:43:26Z","title":"Forcing $k$-repetitions in degree sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1213","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:b2bfcd98dab1a88de9bb9e077a3a5e23b2f9acd4e519e7f21b8c347df6688f9b","target":"record","created_at":"2026-05-18T03:05:34Z","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":"00ed82f592f48e3b2cc876e870c116f4095f4a092c68a46704c7f117b33cc919","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-04T15:43:26Z","title_canon_sha256":"1c91854db7b2047c1caffb7ac88789bfc30c0a2901a89de864fcf6c456f3e0db"},"schema_version":"1.0","source":{"id":"1312.1213","kind":"arxiv","version":1}},"canonical_sha256":"b19d1701ae2f7a0adffee7965854f054b7f845a2966d99df19c34abc154be761","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b19d1701ae2f7a0adffee7965854f054b7f845a2966d99df19c34abc154be761","first_computed_at":"2026-05-18T03:05:34.653838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:34.653838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aqKyLiTnTPgNd385/NaEo94n+PsmsimZe25kfaoSBDZaC0iD5p9QQrNUsEtYZyxlPmNn7OMdcgSrNy3Dkt5vDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:34.654499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2bfcd98dab1a88de9bb9e077a3a5e23b2f9acd4e519e7f21b8c347df6688f9b","sha256:c5541d1560eefab849c9d03dc7916721349bd4c716889e1cae09d5e7968b9489"],"state_sha256":"31d501ef9e61adacd1cea465011feb36bf8431c364474ee8e72f4e1238449d01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpKm8OnfZhdr7MC9wOcxrqgcoyXc/shu6v0B0MsqBb/qRv0Z7SLa0toKKbxnOhxZA+MWuPPAR2OzFJrzzXjOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T00:31:46.199687Z","bundle_sha256":"121177730cb0ddad182ff7a71306316ba4291d35330d14c0e7bfc4cfc6980ad1"}}