{"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/t2v","entry":"t2v","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":5,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"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":2,"ran_fixture":2,"ran":1,"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":"2608.30399","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-30399","title":"SemPOI-RL: Aligning LLM Semantic Reasoning for Interpretable Out-of-Town POI Sequential Generation","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Wind-Flipped/SemPOI-RL","path":"code/ARmodel.py","file_url":"https://github.com/Wind-Flipped/SemPOI-RL/blob/HEAD/code/ARmodel.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, Wind-Flipped/SemPOI-RL when it was checked","code_sha256":"e9f89fa9674bbe4e","code_sha256_prefix":"e9f89fa9674bbe4e","mcp_get_code":{"code_sha256":"e9f89fa9674bbe4e"}},{"arxiv_id":"2410.14970","arxiv_id_is_arxiv":true,"paper":"/paper/taming-the-long-tail-in-human-mobility","title":"Taming the Long Tail in Human Mobility Prediction","date":"2024-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukayo/lotnext","path":"model.py","file_url":"https://github.com/yukayo/lotnext/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"56be6093d5ee62df","code_sha256_prefix":"56be6093d5ee62df","mcp_get_code":{"code_sha256":"56be6093d5ee62df"}},{"arxiv_id":"2410.14970","arxiv_id_is_arxiv":true,"paper":"/paper/taming-the-long-tail-in-human-mobility","title":"Taming the Long Tail in Human Mobility Prediction","date":"2024-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukayo/lotnext","path":"network.py","file_url":"https://github.com/yukayo/lotnext/blob/HEAD/network.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bc78b05475081c66","code_sha256_prefix":"bc78b05475081c66","mcp_get_code":{"code_sha256":"bc78b05475081c66"}},{"arxiv_id":"2310.04486","arxiv_id_is_arxiv":true,"paper":"/paper/t-rep-representation-learning-for-time-series","title":"T-Rep: Representation Learning for Time Series using Time-Embeddings","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e4bdfc21bb19cabb","code_sha256_prefix":"e4bdfc21bb19cabb","mcp_get_code":{"code_sha256":"e4bdfc21bb19cabb"}},{"arxiv_id":"2211.08568","arxiv_id_is_arxiv":true,"paper":"/paper/graph-sequential-neural-ode-process-for-link","title":"Graph Sequential Neural ODE Process for Link Prediction on Dynamic and Sparse Graphs","date":"2022-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rmanluo/gsnop","path":"code/layers.py","file_url":"https://github.com/rmanluo/gsnop/blob/HEAD/code/layers.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4827bf624c11e4fc","code_sha256_prefix":"4827bf624c11e4fc","mcp_get_code":{"code_sha256":"4827bf624c11e4fc"}},{"arxiv_id":"2103.12413","arxiv_id_is_arxiv":true,"paper":"/paper/neural-ode-processes-1","title":"Neural ODE Processes","date":"2021-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csjtx1021/neural_ode_processes_for_network_dynamics-master","path":"NDP4ND.py","file_url":"https://github.com/csjtx1021/neural_ode_processes_for_network_dynamics-master/blob/HEAD/NDP4ND.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4827bf624c11e4fc","code_sha256_prefix":"4827bf624c11e4fc","mcp_get_code":{"code_sha256":"4827bf624c11e4fc"}},{"arxiv_id":"1907.05321","arxiv_id_is_arxiv":true,"paper":"/paper/time2vec-learning-a-vector-representation-of","title":"Time2Vec: Learning a Vector Representation of Time","date":"2019-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ojus1/Time2Vec-PyTorch","path":"periodic_activations.py","file_url":"https://github.com/ojus1/Time2Vec-PyTorch/blob/HEAD/periodic_activations.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e4bdfc21bb19cabb","code_sha256_prefix":"e4bdfc21bb19cabb","mcp_get_code":{"code_sha256":"e4bdfc21bb19cabb"}}],"record_sha256":"0ef645e5c1599dcb87162a0ab8510dbe762358553c8ae50ec73900704ec33a64","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}