{"diffoscope-json-version": 1, "source1": "/srv/reproducible-results/rbuild-debian/r-b-build.fa6CMmS6/b1/mrmpi_1.0~20140404-3_armhf.changes", "source2": "/srv/reproducible-results/rbuild-debian/r-b-build.fa6CMmS6/b2/mrmpi_1.0~20140404-3_armhf.changes", "unified_diff": null, "details": [{"source1": "Files", "source2": "Files", "unified_diff": "@@ -1,5 +1,5 @@\n \n  25111c23924989d72cdd3dd8f4e66d4f 9640 libdevel optional libmrmpi-dev_1.0~20140404-3_armhf.deb\n  1b77ef0d4989968ea0ea23e36ff36fe9 133404 debug optional libmrmpi1-dbgsym_1.0~20140404-3_armhf.deb\n  45e47493688d4d20a6dd063d0ee6c7d5 43480 libs optional libmrmpi1_1.0~20140404-3_armhf.deb\n- bd33210d7c2c0376f12e53439a0db620 473320 doc optional mrmpi-doc_1.0~20140404-3_all.deb\n+ 11ee4dd6cd3187d9ebb3cb3377e24177 473320 doc optional mrmpi-doc_1.0~20140404-3_all.deb\n"}, {"source1": "mrmpi-doc_1.0~20140404-3_all.deb", "source2": "mrmpi-doc_1.0~20140404-3_all.deb", "unified_diff": null, "details": [{"source1": "control.tar.xz", "source2": "control.tar.xz", "unified_diff": null, "details": [{"source1": "control.tar", "source2": "control.tar", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "comments": ["Files differ"], "unified_diff": null}]}]}]}, {"source1": "data.tar.xz", "source2": "data.tar.xz", "unified_diff": null, "details": [{"source1": "data.tar", "source2": "data.tar", "unified_diff": null, "details": [{"source1": "./usr/share/doc/mrmpi-doc/Manual.pdf", "source2": "./usr/share/doc/mrmpi-doc/Manual.pdf", "unified_diff": null, "details": [{"source1": "pdftotext {} -", "source2": "pdftotext {} -", "comments": ["error from `pdftotext {} -` (b):", "Syntax Error (512757): Unknown operator 'nan'", "Syntax Error (512757): Too few (0) args to 'rg' operator"], "unified_diff": "@@ -2627,11 +2627,10 @@\n http://www.cs.cmu.edu/~deepay/mywww/papers/siam04.pdf.\n \n (Plimpton) Plimpton and Devine, \"MapReduce in MPI for Large-Scale Graph Algorithms\", to appear in Parallel\n 65\n \n \fComputing (2011).\n \n-.....................................................................................................................................................................................1\n 66\n \n \f\n"}]}]}]}]}]}