{"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/clamp-preserve-gradients","entry":"clamp_preserve_gradients","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":7,"n_places_pointer_only":5,"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":1,"ran_fixture":0,"ran":3,"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.11462","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-11462","title":"Bridging Discrete Marks and Continuous Dynamics: Dual-Path Cross-Interaction for Marked Temporal Point Processes","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"AONE-NLP/NEXTPP","path":"tpp/model/iftpp.py","file_url":"https://github.com/AONE-NLP/NEXTPP/blob/HEAD/tpp/model/iftpp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, AONE-NLP/NEXTPP when it was checked","code_sha256":"3105c1d665ab0317","code_sha256_prefix":"3105c1d665ab0317","mcp_get_code":{"code_sha256":"3105c1d665ab0317"}},{"arxiv_id":"2510.20414","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-20414","title":"Addressing Mark Imbalance in Integration-free Neural Marked Temporal Point Processes","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"shchur/ifl-tpp","path":"code/dpp/utils.py","file_url":"https://github.com/shchur/ifl-tpp/blob/HEAD/code/dpp/utils.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":"c34d42dda3604d27","code_sha256_prefix":"c34d42dda3604d27","mcp_get_code":{"code_sha256":"c34d42dda3604d27"}},{"arxiv_id":"2411.00823","arxiv_id_is_arxiv":true,"paper":"/paper/mobility-llm-learning-visiting-intentions-and","title":"Mobility-LLM: Learning Visiting Intentions and Travel Preferences from Human Mobility Data with Large Language Models","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LetianGong/Mobility-LLM","path":"model/utils.py","file_url":"https://github.com/LetianGong/Mobility-LLM/blob/HEAD/model/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, LetianGong/Mobility-LLM when it was checked","code_sha256":"fbfecdfaead938c0","code_sha256_prefix":"fbfecdfaead938c0","mcp_get_code":{"code_sha256":"fbfecdfaead938c0"}},{"arxiv_id":"2405.15054","arxiv_id_is_arxiv":true,"paper":"/paper/controlling-behavioral-diversity-in-multi","title":"Controlling Behavioral Diversity in Multi-Agent Reinforcement Learning","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"proroklab/controllingbehavioraldiversity","path":"het_control/utils.py","file_url":"https://github.com/proroklab/controllingbehavioraldiversity/blob/HEAD/het_control/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, proroklab/controllingbehavioraldiversity when it was checked","code_sha256":"f29bfa2b9fbf8081","code_sha256_prefix":"f29bfa2b9fbf8081","mcp_get_code":{"code_sha256":"f29bfa2b9fbf8081"}},{"arxiv_id":"2307.08097","arxiv_id_is_arxiv":true,"paper":"/paper/easytpp-towards-open-benchmarking-the","title":"EasyTPP: Towards Open Benchmarking Temporal Point Processes","date":"2023-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ant-research/easytemporalpointprocess","path":"easy_tpp/model/intensity_free.py","file_url":"https://github.com/ant-research/easytemporalpointprocess/blob/HEAD/easy_tpp/model/intensity_free.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 AONE-NLP/NEXTPP, and GitHub detected no licence in that repository when it was checked","code_sha256":"3105c1d665ab0317","code_sha256_prefix":"3105c1d665ab0317","mcp_get_code":{"code_sha256":"3105c1d665ab0317"}},{"arxiv_id":"2305.16646","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-can-improve-event-prediction-1","title":"Language Models Can Improve Event Prediction by Few-Shot Abductive Reasoning","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ant-research/EasyTemporalPointProcess","path":"easy_tpp/model/intensity_free.py","file_url":"https://github.com/ant-research/EasyTemporalPointProcess/blob/HEAD/easy_tpp/model/intensity_free.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 AONE-NLP/NEXTPP, and GitHub detected no licence in that repository when it was checked","code_sha256":"3105c1d665ab0317","code_sha256_prefix":"3105c1d665ab0317","mcp_get_code":{"code_sha256":"3105c1d665ab0317"}},{"arxiv_id":"2210.15294","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-inter-dependence-between-time-and","title":"Modeling Inter-Dependence Between Time and Mark in Multivariate Temporal Point Processes","date":"2022-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"waghmaregovind/joint_tpp","path":"code/dpp/utils.py","file_url":"https://github.com/waghmaregovind/joint_tpp/blob/HEAD/code/dpp/utils.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":"c34d42dda3604d27","code_sha256_prefix":"c34d42dda3604d27","mcp_get_code":{"code_sha256":"c34d42dda3604d27"}}],"record_sha256":"fd569074a67cb94debcdaad185f813aa059d832cad05d39191f2d48598f93070","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}