{"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":"/code/sequence-loss","entry":"sequence_loss","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":15,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":16,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":13,"n_samples_fingerprinted":1,"n_places":17,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":13},"key_notes":{"n_samples_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_samples_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)"},"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":"2411.01505","arxiv_id_is_arxiv":true,"paper":"/paper/object-segmentation-from-common-fate-motion","title":"Object segmentation from common fate: Motion energy processing enables human-like zero-shot generalization to random dot stimuli","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mtangemann/motion_energy_segmentation","path":"motion_energy_segmentation/flow_former_plus_plus/_extern/core/loss.py","file_url":"https://github.com/mtangemann/motion_energy_segmentation/blob/HEAD/motion_energy_segmentation/flow_former_plus_plus/_extern/core/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mtangemann/motion_energy_segmentation when it was checked","code_sha256":"3a939b9943ca2fb6","code_sha256_prefix":"3a939b9943ca2fb6","mcp_get_code":{"code_sha256":"3a939b9943ca2fb6"}},{"arxiv_id":"2410.09350","arxiv_id_is_arxiv":true,"paper":"/paper/generative-subgraph-retrieval-for-knowledge","title":"Generative Subgraph Retrieval for Knowledge Graph-Grounded Dialog Generation","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/dialoggsr","path":"utils/metrics.py","file_url":"https://github.com/mlvlab/dialoggsr/blob/HEAD/utils/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlvlab/dialoggsr when it was checked","code_sha256":"51b8af021c2c2a14","code_sha256_prefix":"51b8af021c2c2a14","mcp_get_code":{"code_sha256":"51b8af021c2c2a14"}},{"arxiv_id":"2409.00638","arxiv_id_is_arxiv":true,"paper":"/paper/igev-iterative-multi-range-geometry-encoding","title":"IGEV++: Iterative Multi-range Geometry Encoding Volumes for Stereo Matching","date":"2024-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gangweix/igev","path":"IGEV-Stereo/train_stereo.py","file_url":"https://github.com/gangweix/igev/blob/HEAD/IGEV-Stereo/train_stereo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19dc732a081fc3f0","code_sha256_prefix":"19dc732a081fc3f0","mcp_get_code":{"code_sha256":"19dc732a081fc3f0"}},{"arxiv_id":"2409.00638","arxiv_id_is_arxiv":true,"paper":"/paper/igev-iterative-multi-range-geometry-encoding","title":"IGEV++: Iterative Multi-range Geometry Encoding Volumes for Stereo Matching","date":"2024-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gangweix/igev-plusplus","path":"train_stereo.py","file_url":"https://github.com/gangweix/igev-plusplus/blob/HEAD/train_stereo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"15b7a863a68a8257","code_sha256_prefix":"15b7a863a68a8257","mcp_get_code":{"code_sha256":"15b7a863a68a8257"}},{"arxiv_id":"2407.12777","arxiv_id_is_arxiv":true,"paper":"/paper/generalizable-human-gaussians-for-sparse-view","title":"Generalizable Human Gaussians for Sparse View Synthesis","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"humansensinglab/Generalizable-Human-Gaussians","path":"lib/loss.py","file_url":"https://github.com/humansensinglab/Generalizable-Human-Gaussians/blob/HEAD/lib/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, humansensinglab/Generalizable-Human-Gaussians when it was checked","code_sha256":"520a398e387edf23","code_sha256_prefix":"520a398e387edf23","mcp_get_code":{"code_sha256":"520a398e387edf23"}},{"arxiv_id":"2407.11950","arxiv_id_is_arxiv":true,"paper":"/paper/temporally-consistent-stereo-matching","title":"Temporally Consistent Stereo Matching","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaxiZeng/Temporally-Consistent-Stereo-Matching","path":"train_stereo.py","file_url":"https://github.com/jiaxiZeng/Temporally-Consistent-Stereo-Matching/blob/HEAD/train_stereo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a43e7cd33696630d","code_sha256_prefix":"a43e7cd33696630d","mcp_get_code":{"code_sha256":"a43e7cd33696630d"}},{"arxiv_id":"2405.14793","arxiv_id_is_arxiv":true,"paper":"/paper/sea-raft-simple-efficient-accurate-raft-for","title":"SEA-RAFT: Simple, Efficient, Accurate RAFT for Optical Flow","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-vl/sea-raft","path":"core/loss.py","file_url":"https://github.com/princeton-vl/sea-raft/blob/HEAD/core/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"624b113436b6e1d0","code_sha256_prefix":"624b113436b6e1d0","mcp_get_code":{"code_sha256":"624b113436b6e1d0"}},{"arxiv_id":"2403.00486","arxiv_id_is_arxiv":true,"paper":"/paper/selective-stereo-adaptive-frequency","title":"Selective-Stereo: Adaptive Frequency Information Selection for Stereo Matching","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"windsrain/selective-stereo","path":"Selective-IGEV/train_stereo.py","file_url":"https://github.com/windsrain/selective-stereo/blob/HEAD/Selective-IGEV/train_stereo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"66a123d25e758c63","code_sha256_prefix":"66a123d25e758c63","mcp_get_code":{"code_sha256":"66a123d25e758c63"}},{"arxiv_id":"2403.00486","arxiv_id_is_arxiv":true,"paper":"/paper/selective-stereo-adaptive-frequency","title":"Selective-Stereo: Adaptive Frequency Information Selection for Stereo Matching","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"windsrain/selective-stereo","path":"Selective-RAFT/train_stereo.py","file_url":"https://github.com/windsrain/selective-stereo/blob/HEAD/Selective-RAFT/train_stereo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"24ddd9cddf71ea9c","code_sha256_prefix":"24ddd9cddf71ea9c","mcp_get_code":{"code_sha256":"24ddd9cddf71ea9c"}},{"arxiv_id":"2312.02155","arxiv_id_is_arxiv":true,"paper":"/paper/gps-gaussian-generalizable-pixel-wise-3d","title":"GPS-Gaussian: Generalizable Pixel-wise 3D Gaussian Splatting for Real-time Human Novel View Synthesis","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aipixel/gps-gaussian","path":"lib/loss.py","file_url":"https://github.com/aipixel/gps-gaussian/blob/HEAD/lib/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from humansensinglab/Generalizable-Human-Gaussians, and GitHub detected no licence in that repository when it was checked","code_sha256":"520a398e387edf23","code_sha256_prefix":"520a398e387edf23","mcp_get_code":{"code_sha256":"520a398e387edf23"}},{"arxiv_id":"2202.13388","arxiv_id_is_arxiv":true,"paper":"/paper/panoflow-learning-optical-flow-for-panoramic","title":"PanoFlow: Learning 360° Optical Flow for Surrounding Temporal Understanding","date":"2022-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"masterhow/panoflow","path":"opticalflow/api/evaluate.py","file_url":"https://github.com/masterhow/panoflow/blob/HEAD/opticalflow/api/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b9d615da6657a1aa","code_sha256_prefix":"b9d615da6657a1aa","mcp_get_code":{"code_sha256":"b9d615da6657a1aa"}},{"arxiv_id":"2109.07547","arxiv_id_is_arxiv":true,"paper":"/paper/raft-stereo-multilevel-recurrent-field","title":"RAFT-Stereo: Multilevel Recurrent Field Transforms for Stereo Matching","date":"2021-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-vl/raft-stereo","path":"train_stereo.py","file_url":"https://github.com/princeton-vl/raft-stereo/blob/HEAD/train_stereo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d4668a6a0bade1f","code_sha256_prefix":"0d4668a6a0bade1f","mcp_get_code":{"code_sha256":"0d4668a6a0bade1f"}},{"arxiv_id":"1908.07195","arxiv_id_is_arxiv":true,"paper":"/paper/araml-a-stable-adversarial-training-framework","title":"ARAML: A Stable Adversarial Training Framework for Text Generation","date":"2019-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kepei1106/ARAML","path":"src/coco_emnlp/lm/my_loss.py","file_url":"https://github.com/kepei1106/ARAML/blob/HEAD/src/coco_emnlp/lm/my_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"59c960268be04f6d","code_sha256_prefix":"59c960268be04f6d","mcp_get_code":{"code_sha256":"59c960268be04f6d"}},{"arxiv_id":"1809.02079","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-over-sensitivity-and-over","title":"Adversarial Over-Sensitivity and Over-Stability Strategies for Dialogue Models","date":"2018-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WolfNiu/AdversarialDialogue","path":"src/model/util.py","file_url":"https://github.com/WolfNiu/AdversarialDialogue/blob/HEAD/src/model/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f678595b260df788","code_sha256_prefix":"f678595b260df788","mcp_get_code":{"code_sha256":"f678595b260df788"}},{"arxiv_id":"1511.06349","arxiv_id_is_arxiv":true,"paper":"/paper/generating-sentences-from-a-continuous-space","title":"Generating Sentences from a Continuous Space","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chung-I/Variational-Recurrent-Autoencoder-Tensorflow","path":"seq2seq.py","file_url":"https://github.com/Chung-I/Variational-Recurrent-Autoencoder-Tensorflow/blob/HEAD/seq2seq.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Chung-I/Variational-Recurrent-Autoencoder-Tensorflow when it was checked","code_sha256":"1f47f6d9b3d8e1b4","code_sha256_prefix":"1f47f6d9b3d8e1b4","mcp_get_code":{"code_sha256":"1f47f6d9b3d8e1b4"}},{"arxiv_id":"aaai_6453","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_6453","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"siat-nlp/TransDG","path":"src/model/seq_helper.py","file_url":"https://github.com/siat-nlp/TransDG/blob/HEAD/src/model/seq_helper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"de208a5655a13b94","code_sha256_prefix":"de208a5655a13b94","mcp_get_code":{"code_sha256":"de208a5655a13b94"}},{"arxiv_id":"Zeng_Parameterized_Cost_Volume_for_Stereo_Matching_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zeng_Parameterized_Cost_Volume_for_Stereo_Matching_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jiaxiZeng/Parameterized-Cost-Volume-for-Stereo-Matching","path":"train_stereo.py","file_url":"https://github.com/jiaxiZeng/Parameterized-Cost-Volume-for-Stereo-Matching/blob/HEAD/train_stereo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c804d535ba61504c","code_sha256_prefix":"c804d535ba61504c","mcp_get_code":{"code_sha256":"c804d535ba61504c"}}],"record_sha256":"993e0267e0d8c89cad129ae03b959ce107e234146a4637f4c735863d2d12b61d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}