{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/disjoint-10-1","name":"Disjoint 10-1","slug":"disjoint-10-1","description_markdown":null,"categories":[{"name":"Adversarial","url":"/area/adversarial"},{"name":"Audio","url":"/area/audio"},{"name":"Computer Vision","url":"/area/computer-vision"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":7,"papers_with_code":6,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":2},"benchmarks":[{"leaderboard":"/sota/disjoint-10-1-on-pascal-voc-2012","slug":"disjoint-10-1-on-pascal-voc-2012","dataset":"PASCAL VOC 2012","dataset_url":null,"rows_in_archive":8,"metrics":["mIoU"],"first_row_in_archive_order":{"model":"SSUL-M","paper_title":"SSUL: Semantic Segmentation with Unknown Label for Exemplar-based Class-Incremental Learning","paper_url":"/paper/ssul-semantic-segmentation-with-unknown-label","paper_date":"2021-06-22","arxiv_id":"2106.11562","code_links":[{"title":"clovaai/SSUL","url":"https://github.com/clovaai/SSUL"}],"syntology":{"n":12,"n_ran":6,"n_constructed":6,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified; every one of the 6 samples that ran constructed an object rather than computing a result","sample_list":"/paper/ssul-semantic-segmentation-with-unknown-label#ran","syntology_url":"https://syntology.ai/paper/2106.11562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11562"}},"official":{"repos":["clovaai/SSUL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}}}],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/2d-semantic-segmentation","name":"2D Semantic Segmentation"},{"url":"/task/class-incremental-semantic-segmentation","name":"Class-Incremental Semantic Segmentation"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":7,"of":7,"of_with_code":6,"tagged_in_all":7,"counts":{"archive_papers_tagged":7,"with_a_code_link":6,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":7,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/learning-without-forgetting","slug":"learning-without-forgetting","title":"Learning without Forgetting","date":"2016-06-29","arxiv_id":"1606.09282","repositories_listed":12,"syntology":{"n":15,"n_ran":9,"n_constructed":3,"n_ran_checked":4,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"9 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-without-forgetting#ran","syntology_url":"https://syntology.ai/paper/1606.09282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.09282"}},"official":null}},{"url":"/paper/plop-learning-without-forgetting-for","slug":"plop-learning-without-forgetting-for","title":"PLOP: Learning without Forgetting for Continual Semantic Segmentation","date":"2020-11-23","arxiv_id":"2011.11390","repositories_listed":2,"syntology":null},{"url":"/paper/incremental-learning-techniques-for-semantic","slug":"incremental-learning-techniques-for-semantic","title":"Incremental Learning Techniques for Semantic Segmentation","date":"2019-07-31","arxiv_id":"1907.13372","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/incremental-learning-techniques-for-semantic#ran","syntology_url":"https://syntology.ai/paper/1907.13372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.13372"}},"official":null}},{"url":"/paper/representation-compensation-networks-for","slug":"representation-compensation-networks-for","title":"Representation Compensation Networks for Continual Semantic Segmentation","date":"2022-03-10","arxiv_id":"2203.05402","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/representation-compensation-networks-for#ran","syntology_url":"https://syntology.ai/paper/2203.05402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05402"}},"official":{"repos":["zhangchbin/rcil"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/ssul-semantic-segmentation-with-unknown-label","slug":"ssul-semantic-segmentation-with-unknown-label","title":"SSUL: Semantic Segmentation with Unknown Label for Exemplar-based Class-Incremental Learning","date":"2021-06-22","arxiv_id":"2106.11562","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":6,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified; every one of the 6 samples that ran constructed an object rather than computing a result","sample_list":"/paper/ssul-semantic-segmentation-with-unknown-label#ran","syntology_url":"https://syntology.ai/paper/2106.11562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11562"}},"official":{"repos":["clovaai/SSUL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/modeling-the-background-for-incremental","slug":"modeling-the-background-for-incremental","title":"Modeling the Background for Incremental Learning in Semantic Segmentation","date":"2020-02-03","arxiv_id":"2002.00718","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/modeling-the-background-for-incremental#ran","syntology_url":"https://syntology.ai/paper/2002.00718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.00718"}},"official":null}},{"url":"/paper/continual-semantic-segmentation-via-repulsion","slug":"continual-semantic-segmentation-via-repulsion","title":"Continual Semantic Segmentation via Repulsion-Attraction of Sparse and Disentangled Latent Representations","date":"2021-03-10","arxiv_id":"2103.06342","repositories_listed":0,"syntology":null}],"syntology_records":5,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/task/disjoint-10-1/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/disjoint-10-1/papers/ran/1","json":"/task/disjoint-10-1/papers/ran/1.json","rows":4}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"3996a02a8ce6aea48deabadb302dd34cd59bdabebb5b8acd87b507ebfc421fb6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}