{"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/get-segments","entry":"get_segments","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":6,"n_papers_ran":3,"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":2,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":0,"unverified":3},"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":"2604.02899","paper":"/paper/arxiv-2604-02899","title":"Extracting Money Laundering Transactions from Quasi-Temporal Graph Representation","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"mhaseebtariq/exstraqt","path":"ethereum/features.py","file_url":"https://github.com/mhaseebtariq/exstraqt/blob/HEAD/ethereum/features.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f71970c971c210c6","mcp_get_code":{"code_sha256":"f71970c971c210c6"}},{"arxiv_id":"2604.01315","paper":"/paper/arxiv-2604-01315","title":"Detecting Complex Money Laundering Patterns with Incremental and Distributed Graph Modeling","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"mhaseebtariq/redirect","path":"ibm/features.py","file_url":"https://github.com/mhaseebtariq/redirect/blob/HEAD/ibm/features.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f71970c971c210c6","mcp_get_code":{"code_sha256":"f71970c971c210c6"}},{"arxiv_id":"2007.06866","paper":"/paper/alleviating-over-segmentation-errors-by","title":"Alleviating Over-segmentation Errors by Detecting Action Boundaries","date":"2020-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiskw713/asrf","path":"libs/metric.py","file_url":"https://github.com/yiskw713/asrf/blob/HEAD/libs/metric.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9168dfe61b67c0d","mcp_get_code":{"code_sha256":"f9168dfe61b67c0d"}},{"arxiv_id":"1805.08241","paper":"/paper/sparse-and-constrained-attention-for-neural","title":"Sparse and Constrained Attention for Neural Machine Translation","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Unbabel/sparse_constrained_attention","path":"aer/postprocess_attention_bpe.py","file_url":"https://github.com/Unbabel/sparse_constrained_attention/blob/HEAD/aer/postprocess_attention_bpe.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"883808c0a4cdfcfb","mcp_get_code":{"code_sha256":"883808c0a4cdfcfb"}},{"arxiv_id":"1804.07754","paper":"/paper/learning-semantic-textual-similarity-from","title":"Learning Semantic Textual Similarity from Conversations","date":"2018-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nickyeolk/info_retrieve","path":"src/bert_tokenization.py","file_url":"https://github.com/nickyeolk/info_retrieve/blob/HEAD/src/bert_tokenization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"922a8461783d514b","mcp_get_code":{"code_sha256":"922a8461783d514b"}},{"arxiv_id":"1609.08675","paper":"/paper/youtube-8m-a-large-scale-video-classification","title":"YouTube-8M: A Large-Scale Video Classification Benchmark","date":"2016-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/youtube-8m","path":"inference.py","file_url":"https://github.com/google/youtube-8m/blob/HEAD/inference.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2ef42071ff785910","mcp_get_code":{"code_sha256":"2ef42071ff785910"}}]}