{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZMQUXI2WL4L3YYNV2YKXVZOTXN","short_pith_number":"pith:ZMQUXI2W","canonical_record":{"source":{"id":"1503.07891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-26T20:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"97b72f5fe46b0b0b96ea014baa5ce6c4d3508d37fd956aaff1dfe0559585c2ad","abstract_canon_sha256":"c699a83b5a71d669cfc327b1bbb25ad9da153228bd7b023319aa4a71fe25dc63"},"schema_version":"1.0"},"canonical_sha256":"cb214ba3565f17bc61b5d6157ae5d3bb534e3eb0a58846dab5f656978714f1a7","source":{"kind":"arxiv","id":"1503.07891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07891","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07891v1","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07891","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"ZMQUXI2WL4L3","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZMQUXI2WL4L3YYNV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZMQUXI2W","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZMQUXI2WL4L3YYNV2YKXVZOTXN","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-26T20:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"97b72f5fe46b0b0b96ea014baa5ce6c4d3508d37fd956aaff1dfe0559585c2ad","abstract_canon_sha256":"c699a83b5a71d669cfc327b1bbb25ad9da153228bd7b023319aa4a71fe25dc63"},"schema_version":"1.0"},"canonical_sha256":"cb214ba3565f17bc61b5d6157ae5d3bb534e3eb0a58846dab5f656978714f1a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:12.020257Z","signature_b64":"REr3vC+9v0pA4XAU5y9nEIZkpSsJHyefE/PA68nFI25V/5Ts6R7uOw7qJzOXeZyRmLVXxBOav3eAnRwRgwvwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb214ba3565f17bc61b5d6157ae5d3bb534e3eb0a58846dab5f656978714f1a7","last_reissued_at":"2026-05-18T02:20:12.019807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:12.019807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07891","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-18T02:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pd1N3wgUa9BBVUhA9W0GjHHoNlhnNruOLU/cvLp9M0FnFSdAZVjss35NQ3uYreY/u5ngR5yEfgZ6/I5OIdZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:52:53.981039Z"},"content_sha256":"07e7a5de04efd44386344b4548d391044b324084cdace7a77d3e3c98be83542e","schema_version":"1.0","event_id":"sha256:07e7a5de04efd44386344b4548d391044b324084cdace7a77d3e3c98be83542e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZMQUXI2WL4L3YYNV2YKXVZOTXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey numbers for degree monotone paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Raphael Yuster, Yair Caro","submitted_at":"2015-03-26T20:49:32Z","abstract_excerpt":"A path $v_1,v_2,\\ldots,v_m$ in a graph $G$ is $degree$-$monotone$ if $deg(v_1) \\leq deg(v_2) \\leq \\cdots \\leq deg(v_m)$ where $deg(v_i)$ is the degree of $v_i$ in $G$. Longest degree-monotone paths have been studied in several recent papers. Here we consider the Ramsey type problem for degree monotone paths. Denote by $M_k(m)$ the minimum number $M$ such that for all $n \\geq M$, in any $k$-edge coloring of $K_n$ there is some $1\\leq j \\leq k$ such that the graph formed by the edges colored $j$ has a degree-monotone path of order $m$. We prove several nontrivial upper and lower bounds for $M_k("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07891","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-18T02:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+tSN3rh/qbbvSAJ5hu9AHdYJWFfYEht1SiLJtnvEcqcjb/y8V/k65qiqVJ+vjxK9uwdbODIupdZn11LEd1iBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:52:53.981785Z"},"content_sha256":"1c895c3b8418e552826467a9a4d9c804e2caf501de3f4615a846a85824639597","schema_version":"1.0","event_id":"sha256:1c895c3b8418e552826467a9a4d9c804e2caf501de3f4615a846a85824639597"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMQUXI2WL4L3YYNV2YKXVZOTXN/bundle.json","state_url":"https://pith.science/pith/ZMQUXI2WL4L3YYNV2YKXVZOTXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMQUXI2WL4L3YYNV2YKXVZOTXN/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-31T15:52:53Z","links":{"resolver":"https://pith.science/pith/ZMQUXI2WL4L3YYNV2YKXVZOTXN","bundle":"https://pith.science/pith/ZMQUXI2WL4L3YYNV2YKXVZOTXN/bundle.json","state":"https://pith.science/pith/ZMQUXI2WL4L3YYNV2YKXVZOTXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMQUXI2WL4L3YYNV2YKXVZOTXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZMQUXI2WL4L3YYNV2YKXVZOTXN","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":"c699a83b5a71d669cfc327b1bbb25ad9da153228bd7b023319aa4a71fe25dc63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-26T20:49:32Z","title_canon_sha256":"97b72f5fe46b0b0b96ea014baa5ce6c4d3508d37fd956aaff1dfe0559585c2ad"},"schema_version":"1.0","source":{"id":"1503.07891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07891","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07891v1","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07891","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"ZMQUXI2WL4L3","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZMQUXI2WL4L3YYNV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZMQUXI2W","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:1c895c3b8418e552826467a9a4d9c804e2caf501de3f4615a846a85824639597","target":"graph","created_at":"2026-05-18T02:20:12Z","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":"A path $v_1,v_2,\\ldots,v_m$ in a graph $G$ is $degree$-$monotone$ if $deg(v_1) \\leq deg(v_2) \\leq \\cdots \\leq deg(v_m)$ where $deg(v_i)$ is the degree of $v_i$ in $G$. Longest degree-monotone paths have been studied in several recent papers. Here we consider the Ramsey type problem for degree monotone paths. Denote by $M_k(m)$ the minimum number $M$ such that for all $n \\geq M$, in any $k$-edge coloring of $K_n$ there is some $1\\leq j \\leq k$ such that the graph formed by the edges colored $j$ has a degree-monotone path of order $m$. We prove several nontrivial upper and lower bounds for $M_k(","authors_text":"Christina Zarb, Raphael Yuster, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-26T20:49:32Z","title":"Ramsey numbers for degree monotone paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07891","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:07e7a5de04efd44386344b4548d391044b324084cdace7a77d3e3c98be83542e","target":"record","created_at":"2026-05-18T02:20:12Z","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":"c699a83b5a71d669cfc327b1bbb25ad9da153228bd7b023319aa4a71fe25dc63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-26T20:49:32Z","title_canon_sha256":"97b72f5fe46b0b0b96ea014baa5ce6c4d3508d37fd956aaff1dfe0559585c2ad"},"schema_version":"1.0","source":{"id":"1503.07891","kind":"arxiv","version":1}},"canonical_sha256":"cb214ba3565f17bc61b5d6157ae5d3bb534e3eb0a58846dab5f656978714f1a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb214ba3565f17bc61b5d6157ae5d3bb534e3eb0a58846dab5f656978714f1a7","first_computed_at":"2026-05-18T02:20:12.019807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:12.019807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"REr3vC+9v0pA4XAU5y9nEIZkpSsJHyefE/PA68nFI25V/5Ts6R7uOw7qJzOXeZyRmLVXxBOav3eAnRwRgwvwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:12.020257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07e7a5de04efd44386344b4548d391044b324084cdace7a77d3e3c98be83542e","sha256:1c895c3b8418e552826467a9a4d9c804e2caf501de3f4615a846a85824639597"],"state_sha256":"fcbbc8a80264bd190f52108c49a1c083e971d033035bf9038cad18cb4809b2cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jqywXqbTKAiU64dvCmnWtdPjlwT3FiO/G+NathSprXbizchUxPr5orJRnqyPif2UHyUKZ9RX/P3bEVctmAkaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:52:53.985894Z","bundle_sha256":"b1fee1a26b2e62a32222e415bb023468e2dbfd52373f8f203f5c36df18d156db"}}