{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AGZEWXX45V3WJJV3FNPLFUMYZG","short_pith_number":"pith:AGZEWXX4","canonical_record":{"source":{"id":"1901.09412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T18:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"59b891e7e8bab083998303d35579fe2a7cb2d72d38dd1b0e0ce7b43acde94aa2","abstract_canon_sha256":"7f007782f6174311cd3ca166bc09ff88dfe0eaf0e4c9031d952e57241c2c1061"},"schema_version":"1.0"},"canonical_sha256":"01b24b5efced7764a6bb2b5eb2d198c98e7b28273267752919f4a3420b2c5883","source":{"kind":"arxiv","id":"1901.09412","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09412","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09412v1","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09412","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"AGZEWXX45V3W","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AGZEWXX45V3WJJV3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AGZEWXX4","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AGZEWXX45V3WJJV3FNPLFUMYZG","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T18:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"59b891e7e8bab083998303d35579fe2a7cb2d72d38dd1b0e0ce7b43acde94aa2","abstract_canon_sha256":"7f007782f6174311cd3ca166bc09ff88dfe0eaf0e4c9031d952e57241c2c1061"},"schema_version":"1.0"},"canonical_sha256":"01b24b5efced7764a6bb2b5eb2d198c98e7b28273267752919f4a3420b2c5883","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:24.874789Z","signature_b64":"JFTIEbTsgeclJM+z2D711JJQ+CqkEKTrXNGd7cnpv8Uuad6mrSnmBerYBoGuEifo5/HDOeBTQNhiQ/O6Ud+HDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01b24b5efced7764a6bb2b5eb2d198c98e7b28273267752919f4a3420b2c5883","last_reissued_at":"2026-05-17T23:55:24.874303Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:24.874303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09412","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-17T23:55:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qO3ykljfmQMrFcH8ScYwRiQojVN9lmJJVS5Sne0Eie1hs4arcEyO/m/1CV8kZ9qZcJZQ7sULQRa4ROrnwYRICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:07:12.665739Z"},"content_sha256":"497bdaf0bd17948a724d6272439ec9f56197cac74ea2aac5a93a26c1893fbd0c","schema_version":"1.0","event_id":"sha256:497bdaf0bd17948a724d6272439ec9f56197cac74ea2aac5a93a26c1893fbd0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AGZEWXX45V3WJJV3FNPLFUMYZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Singular Ramsey and Tur\\'an numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yair Caro, Zsolt Tuza","submitted_at":"2019-01-27T18:09:15Z","abstract_excerpt":"We say that a subgraph $F$ of a graph $G$ is singular if the degrees $d_G(v)$ are all equal or all distinct for the vertices $v\\in V(F)$. The singular Ramsey number Rs$(F)$ is the smallest positive integer $n$ such that, for every $m\\geq n$, in every edge 2-coloring of $K_m$, at least one of the color classes contains $F$ as a singular subgraph. In a similar flavor, the singular Tur\\'an number Ts$(n,F)$ is defined as the maximum number of edges in a graph of order $n$, which does not contain $F$ as a singular subgraph. In this paper we initiate the study of these extremal problems. We develop "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09412","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-17T23:55:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i7XQR7oZg322TctoSSHJVPC1MCf2KxOkj6FefHIcJHplVmPOdIzF6lEpe77gJa9LmcuiN+2/ov+eR5lH/1K7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:07:12.666086Z"},"content_sha256":"75c58e29ff12db17ab76d5872c47d6e9b5931984133b8157f66d31b01c449524","schema_version":"1.0","event_id":"sha256:75c58e29ff12db17ab76d5872c47d6e9b5931984133b8157f66d31b01c449524"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/bundle.json","state_url":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/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-06-20T08:07:12Z","links":{"resolver":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG","bundle":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/bundle.json","state":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AGZEWXX45V3WJJV3FNPLFUMYZG","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":"7f007782f6174311cd3ca166bc09ff88dfe0eaf0e4c9031d952e57241c2c1061","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T18:09:15Z","title_canon_sha256":"59b891e7e8bab083998303d35579fe2a7cb2d72d38dd1b0e0ce7b43acde94aa2"},"schema_version":"1.0","source":{"id":"1901.09412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09412","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09412v1","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09412","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"AGZEWXX45V3W","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AGZEWXX45V3WJJV3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AGZEWXX4","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:75c58e29ff12db17ab76d5872c47d6e9b5931984133b8157f66d31b01c449524","target":"graph","created_at":"2026-05-17T23:55:24Z","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":"We say that a subgraph $F$ of a graph $G$ is singular if the degrees $d_G(v)$ are all equal or all distinct for the vertices $v\\in V(F)$. The singular Ramsey number Rs$(F)$ is the smallest positive integer $n$ such that, for every $m\\geq n$, in every edge 2-coloring of $K_m$, at least one of the color classes contains $F$ as a singular subgraph. In a similar flavor, the singular Tur\\'an number Ts$(n,F)$ is defined as the maximum number of edges in a graph of order $n$, which does not contain $F$ as a singular subgraph. In this paper we initiate the study of these extremal problems. We develop ","authors_text":"Yair Caro, Zsolt Tuza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T18:09:15Z","title":"Singular Ramsey and Tur\\'an numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09412","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:497bdaf0bd17948a724d6272439ec9f56197cac74ea2aac5a93a26c1893fbd0c","target":"record","created_at":"2026-05-17T23:55:24Z","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":"7f007782f6174311cd3ca166bc09ff88dfe0eaf0e4c9031d952e57241c2c1061","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T18:09:15Z","title_canon_sha256":"59b891e7e8bab083998303d35579fe2a7cb2d72d38dd1b0e0ce7b43acde94aa2"},"schema_version":"1.0","source":{"id":"1901.09412","kind":"arxiv","version":1}},"canonical_sha256":"01b24b5efced7764a6bb2b5eb2d198c98e7b28273267752919f4a3420b2c5883","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01b24b5efced7764a6bb2b5eb2d198c98e7b28273267752919f4a3420b2c5883","first_computed_at":"2026-05-17T23:55:24.874303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:24.874303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JFTIEbTsgeclJM+z2D711JJQ+CqkEKTrXNGd7cnpv8Uuad6mrSnmBerYBoGuEifo5/HDOeBTQNhiQ/O6Ud+HDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:24.874789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:497bdaf0bd17948a724d6272439ec9f56197cac74ea2aac5a93a26c1893fbd0c","sha256:75c58e29ff12db17ab76d5872c47d6e9b5931984133b8157f66d31b01c449524"],"state_sha256":"fa5704941bc360dffade99c8dd557b5ddadd8c5f895ee2154b6fe8021fdeed54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1WORXO3ZPEACgINNd7ey1sWGYk9n9tN1NXRPuxl9qBto2q0x6GIqp2xuFFN/R8iOt4oLZDlIxPPWnv/pD7OBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:07:12.667930Z","bundle_sha256":"cb8653f99c6125e91c8233e804cdf896b59460cc9a568f73e972cede18fe289b"}}