{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/sorted-nicely","entry":"sorted_nicely","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":6,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":5,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":2},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2508.06325","paper":"/paper/arxiv-2508-06325","title":"Anti-Tamper Protection for Unauthorized Individual Image Generation","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"Seeyn/Anti-Tamper-Perturbation","path":"authorization/infer.py","file_url":"https://github.com/Seeyn/Anti-Tamper-Perturbation/blob/HEAD/authorization/infer.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2cfdf5516f63cbbf","mcp_get_code":{"code_sha256":"2cfdf5516f63cbbf"}},{"arxiv_id":"2407.12383","paper":"/paper/reliable-and-efficient-concept-erasure-of","title":"Reliable and Efficient Concept Erasure of Text-to-Image Diffusion Models","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"charlesgong12/rece","path":"execs/clip_score.py","file_url":"https://github.com/charlesgong12/rece/blob/HEAD/execs/clip_score.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8517a5a2a142c0ca","mcp_get_code":{"code_sha256":"8517a5a2a142c0ca"}},{"arxiv_id":"2406.14929","paper":"/paper/efficient-graph-similarity-computation-with","title":"Efficient Graph Similarity Computation with Alignment Regularization","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JhuoW/ERIC","path":"DataHelper/simgnn_utils.py","file_url":"https://github.com/JhuoW/ERIC/blob/HEAD/DataHelper/simgnn_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5f1abfd2b5c44a6a","mcp_get_code":{"code_sha256":"5f1abfd2b5c44a6a"}},{"arxiv_id":"2402.11846","paper":"/paper/unlearncanvas-a-stylized-image-dataset-to","title":"UnlearnCanvas: Stylized Image Dataset for Enhanced Machine Unlearning Evaluation in Diffusion Models","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rohitgandikota/unified-concept-editing","path":"evalscripts/CLIP_classify.py","file_url":"https://github.com/rohitgandikota/unified-concept-editing/blob/HEAD/evalscripts/CLIP_classify.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8517a5a2a142c0ca","mcp_get_code":{"code_sha256":"8517a5a2a142c0ca"}},{"arxiv_id":"2204.11714","paper":"/paper/the-causal-news-corpus-annotating-causal","title":"The Causal News Corpus: Annotating Causal Relations in Event Sentences from News","date":"2022-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tanfiona/causalnewscorpus","path":"curation/kAlpha.py","file_url":"https://github.com/tanfiona/causalnewscorpus/blob/HEAD/curation/kAlpha.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"code_sha256_prefix":"a29154a26ced8064","mcp_get_code":{"code_sha256":"a29154a26ced8064"}},{"arxiv_id":"2110.10809","paper":"/paper/hierarchical-skills-for-efficient-exploration","title":"Hierarchical Skills for Efficient Exploration","date":"2021-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/hsd3","path":"hucc/utils.py","file_url":"https://github.com/facebookresearch/hsd3/blob/HEAD/hucc/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"e8ded132e7c6844c","mcp_get_code":{"code_sha256":"e8ded132e7c6844c"}},{"arxiv_id":"2106.14568","paper":"/paper/freetickets-accurate-robust-and-efficient","title":"Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsity","date":"2021-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/FreeTickets","path":"ensemble_freetickets.py","file_url":"https://github.com/VITA-Group/FreeTickets/blob/HEAD/ensemble_freetickets.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2cfdf5516f63cbbf","mcp_get_code":{"code_sha256":"2cfdf5516f63cbbf"}},{"arxiv_id":"2007.04395","paper":"/paper/hierarchical-graph-matching-networks-for-deep-1","title":"Multilevel Graph Matching Networks for Deep Graph Similarity Learning","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kleincup/MGMN","path":"src/simgnn_utils.py","file_url":"https://github.com/kleincup/MGMN/blob/HEAD/src/simgnn_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f1abfd2b5c44a6a","mcp_get_code":{"code_sha256":"5f1abfd2b5c44a6a"}}]}