{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JUEMKM43TDJLJJMXKKUOXF7T2R","short_pith_number":"pith:JUEMKM43","schema_version":"1.0","canonical_sha256":"4d08c5339b98d2b4a59752a8eb97f3d453a542095455884a9177d345dc00ca2e","source":{"kind":"arxiv","id":"1409.5213","version":1},"attestation_state":"computed","paper":{"title":"The Saturation Number for the length of Degree Monotone Paths","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":"2014-09-18T07:43:29Z","abstract_excerpt":"A degree monotone path in a graph $G$ is a path $P$ such that the sequence of degrees of the vertices in the order in which they appear on $P$ is monotonic. The length of the longest degree monotone path in $G$ is denoted by $mp(G)$. This parameter, inspired by the well-known Erdos-Szekeres theorem, has been studied by the authors in two earlier papers. Here we consider a saturation problem for the parameter $mp(G)$. We call $G$ saturated if, for every edge $e$ added to $G$, $mp(G+e) >mp(G)$, and we define $h(n,k)$ to be the least possible number of edges in a saturated graph $G$ on $n$ vertic"},"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":"1409.5213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-18T07:43:29Z","cross_cats_sorted":[],"title_canon_sha256":"8acc8bf8787278fb9f04c29d0547eb7d1acc175da5b4ad07c2d4550e1938f997","abstract_canon_sha256":"be81d83661d836ebf3805bab53eadb12b9ef86b471890cb52bcdd28e90f61a73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:30.501743Z","signature_b64":"IYDD8AdP7urwAW8wjHJivIvgFXm7NM5cz5dbJe5jmm8LzG4JYA8YnCoiWvzF4iboI+0Le2Y1TFDnG3wCTOUICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d08c5339b98d2b4a59752a8eb97f3d453a542095455884a9177d345dc00ca2e","last_reissued_at":"2026-05-18T02:42:30.500883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:30.500883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Saturation Number for the length of Degree Monotone Paths","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":"2014-09-18T07:43:29Z","abstract_excerpt":"A degree monotone path in a graph $G$ is a path $P$ such that the sequence of degrees of the vertices in the order in which they appear on $P$ is monotonic. The length of the longest degree monotone path in $G$ is denoted by $mp(G)$. This parameter, inspired by the well-known Erdos-Szekeres theorem, has been studied by the authors in two earlier papers. Here we consider a saturation problem for the parameter $mp(G)$. We call $G$ saturated if, for every edge $e$ added to $G$, $mp(G+e) >mp(G)$, and we define $h(n,k)$ to be the least possible number of edges in a saturated graph $G$ on $n$ vertic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5213","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":"1409.5213","created_at":"2026-05-18T02:42:30.501062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5213v1","created_at":"2026-05-18T02:42:30.501062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5213","created_at":"2026-05-18T02:42:30.501062+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUEMKM43TDJL","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUEMKM43TDJLJJMX","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUEMKM43","created_at":"2026-05-18T12:28:35.611951+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/JUEMKM43TDJLJJMXKKUOXF7T2R","json":"https://pith.science/pith/JUEMKM43TDJLJJMXKKUOXF7T2R.json","graph_json":"https://pith.science/api/pith-number/JUEMKM43TDJLJJMXKKUOXF7T2R/graph.json","events_json":"https://pith.science/api/pith-number/JUEMKM43TDJLJJMXKKUOXF7T2R/events.json","paper":"https://pith.science/paper/JUEMKM43"},"agent_actions":{"view_html":"https://pith.science/pith/JUEMKM43TDJLJJMXKKUOXF7T2R","download_json":"https://pith.science/pith/JUEMKM43TDJLJJMXKKUOXF7T2R.json","view_paper":"https://pith.science/paper/JUEMKM43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5213&json=true","fetch_graph":"https://pith.science/api/pith-number/JUEMKM43TDJLJJMXKKUOXF7T2R/graph.json","fetch_events":"https://pith.science/api/pith-number/JUEMKM43TDJLJJMXKKUOXF7T2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUEMKM43TDJLJJMXKKUOXF7T2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUEMKM43TDJLJJMXKKUOXF7T2R/action/storage_attestation","attest_author":"https://pith.science/pith/JUEMKM43TDJLJJMXKKUOXF7T2R/action/author_attestation","sign_citation":"https://pith.science/pith/JUEMKM43TDJLJJMXKKUOXF7T2R/action/citation_signature","submit_replication":"https://pith.science/pith/JUEMKM43TDJLJJMXKKUOXF7T2R/action/replication_record"}},"created_at":"2026-05-18T02:42:30.501062+00:00","updated_at":"2026-05-18T02:42:30.501062+00:00"}