{"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/compute-softdtw","entry":"compute_softdtw","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":4,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":10,"n_places_pointer_only":7,"n_places_pointer_only_link_open":2,"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":0,"ran_fixture":3,"ran":4,"unverified":0},"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":"2603.08349","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-08349","title":"Towards plausibility in time series counterfactual explanations","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"genwro-ai/soft-dtw-counterfactual-explantions","path":"src/soft_dtw_cfe/method/solver.py","file_url":"https://github.com/genwro-ai/soft-dtw-counterfactual-explantions/blob/HEAD/src/soft_dtw_cfe/method/solver.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, genwro-ai/soft-dtw-counterfactual-explantions when it was checked","code_sha256":"efc2f25d38afb643","code_sha256_prefix":"efc2f25d38afb643","mcp_get_code":{"code_sha256":"efc2f25d38afb643"}},{"arxiv_id":"2412.09501","arxiv_id_is_arxiv":true,"paper":"/paper/lyra-an-efficient-and-speech-centric","title":"Lyra: An Efficient and Speech-Centric Framework for Omni-Cognition","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/Lyra","path":"lyra/model/soft_dtw_cuda.py","file_url":"https://github.com/dvlab-research/Lyra/blob/HEAD/lyra/model/soft_dtw_cuda.py","status":"ran","verification_level":1,"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":"34f95bf62dff3ebd","code_sha256_prefix":"34f95bf62dff3ebd","mcp_get_code":{"code_sha256":"34f95bf62dff3ebd"}},{"arxiv_id":"2407.12200","arxiv_id_is_arxiv":true,"paper":"/paper/this-probably-looks-exactly-like-that-an","title":"This Probably Looks Exactly Like That: An Invertible Prototypical Network","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"craymichael/ProtoFlow","path":"protoflow/kmeans/soft_dtw_cuda.py","file_url":"https://github.com/craymichael/ProtoFlow/blob/HEAD/protoflow/kmeans/soft_dtw_cuda.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-2.0, as GitHub detects it on this paper's repository, craymichael/ProtoFlow, is not in the permissive set Syntology serves inline","code_sha256":"168a9cabc7a9663b","code_sha256_prefix":"168a9cabc7a9663b","mcp_get_code":{"code_sha256":"168a9cabc7a9663b"}},{"arxiv_id":"2404.02394","arxiv_id_is_arxiv":true,"paper":"/paper/cohort-individual-cooperative-learning-for","title":"Cohort-Individual Cooperative Learning for Multimodal Cancer Survival Analysis","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moothes/ccl-survival","path":"models/CCL/kmeans/kmeans_pytorch/soft_dtw_cuda.py","file_url":"https://github.com/moothes/ccl-survival/blob/HEAD/models/CCL/kmeans/kmeans_pytorch/soft_dtw_cuda.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, moothes/ccl-survival when it was checked","code_sha256":"168a9cabc7a9663b","code_sha256_prefix":"168a9cabc7a9663b","mcp_get_code":{"code_sha256":"168a9cabc7a9663b"}},{"arxiv_id":"2306.02693","arxiv_id_is_arxiv":true,"paper":"/paper/celda-leveraging-black-box-language-model-as","title":"CELDA: Leveraging Black-box Language Model as Enhanced Classifier without Labels","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"subhadarship/kmeans_pytorch","path":"kmeans_pytorch/soft_dtw_cuda.py","file_url":"https://github.com/subhadarship/kmeans_pytorch/blob/HEAD/kmeans_pytorch/soft_dtw_cuda.py","status":"ran","verification_level":1,"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 craymichael/ProtoFlow, and GPL-2.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"168a9cabc7a9663b","code_sha256_prefix":"168a9cabc7a9663b","mcp_get_code":{"code_sha256":"168a9cabc7a9663b"}},{"arxiv_id":"2303.10778","arxiv_id_is_arxiv":true,"paper":"/paper/deep-declarative-dynamic-time-warping-for-end","title":"Deep Declarative Dynamic Time Warping for End-to-End Learning of Alignment Paths","date":"2023-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingu6/declarativedtw","path":"experiments/audio_score/comparisons.py","file_url":"https://github.com/mingu6/declarativedtw/blob/HEAD/experiments/audio_score/comparisons.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"63dedce93135c081","code_sha256_prefix":"63dedce93135c081","mcp_get_code":{"code_sha256":"63dedce93135c081"}},{"arxiv_id":"2303.10778","arxiv_id_is_arxiv":true,"paper":"/paper/deep-declarative-dynamic-time-warping-for-end","title":"Deep Declarative Dynamic Time Warping for End-to-End Learning of Alignment Paths","date":"2023-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingu6/declarativedtw","path":"experiments/audio_score/soft_dtw.py","file_url":"https://github.com/mingu6/declarativedtw/blob/HEAD/experiments/audio_score/soft_dtw.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"de6839d7b9993193","code_sha256_prefix":"de6839d7b9993193","mcp_get_code":{"code_sha256":"de6839d7b9993193"}},{"arxiv_id":"2211.00005","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-dtw-for-time-series-and-sequences","title":"Uncertainty-DTW for Time Series and Sequences","date":"2022-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leiwangr/udtw","path":"uDTW.py","file_url":"https://github.com/leiwangr/udtw/blob/HEAD/uDTW.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, leiwangr/udtw when it was checked","code_sha256":"7004997843b54cce","code_sha256_prefix":"7004997843b54cce","mcp_get_code":{"code_sha256":"7004997843b54cce"}},{"arxiv_id":"2104.02577","arxiv_id_is_arxiv":true,"paper":"/paper/learnable-dynamic-temporal-pooling-for-time","title":"Learnable Dynamic Temporal Pooling for Time Series Classification","date":"2021-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jihyeonseong/SoM-TP","path":"model/SoMTP.py","file_url":"https://github.com/jihyeonseong/SoM-TP/blob/HEAD/model/SoMTP.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jihyeonseong/SoM-TP when it was checked","code_sha256":"0257d02309524615","code_sha256_prefix":"0257d02309524615","mcp_get_code":{"code_sha256":"0257d02309524615"}},{"arxiv_id":"2006.12648","arxiv_id_is_arxiv":true,"paper":"/paper/aligning-time-series-on-incomparable-spaces","title":"Aligning Time Series on Incomparable Spaces","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samcohen16/Aligning-Time-Series","path":"Code/DTW.py","file_url":"https://github.com/samcohen16/Aligning-Time-Series/blob/HEAD/Code/DTW.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from genwro-ai/soft-dtw-counterfactual-explantions, and GitHub detected no licence in that repository when it was checked","code_sha256":"efc2f25d38afb643","code_sha256_prefix":"efc2f25d38afb643","mcp_get_code":{"code_sha256":"efc2f25d38afb643"}}],"record_sha256":"7f28cf998d1b3a111a526ee4c8e1814cd8053641faa4ae400d4ee92301edd375","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}