On paths-based criteria for polynomial time complexity in proof-nets