Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re: How should Perlmonks deal with Plagiarism?

by xdg (Monsignor)
on Oct 07, 2006 at 13:38 UTC ( #576840=note: print w/ replies, xml ) Need Help??


in reply to How should Perlmonks deal with Plagiarism?

Great work. Two comments on the post and various comments so far:

  • Evidence needs to be posted to plagiarised nodes. This is critical for transparency on all sides.
  • We should not encourage mass down-voting of unrelated nodes -- only the plagiarised ones. Punish the node, not the person.

-xdg

Code written by xdg and posted on PerlMonks is public domain. It is provided as is with no warranties, express or implied, of any kind. Posted code may not have been tested. Use of posted code is at your own risk.


Comment on Re: How should Perlmonks deal with Plagiarism?
Re^2: How should Perlmonks deal with Plagiarism?
by Anonymous Monk on Oct 07, 2006 at 13:59 UTC
    Monks should punish the node, gods should punish the person.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://576840]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (17)
As of 2014-10-30 14:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (208 votes), past polls