{"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":"/task/state-estimation/papers/ran/1","list_of":"/task/state-estimation","task":"State Estimation","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,22],"of":22,"counts":{"archive_papers_tagged":1067,"with_a_code_link":208,"where_syntology_ran_a_sample":22,"not_listed_spam_title":0,"listed":1067,"listed_where_code_ran":22,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":20,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":20,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/state-estimation/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/umotion-uncertainty-driven-human-motion","slug":"umotion-uncertainty-driven-human-motion","title":"UMotion: Uncertainty-driven Human Motion Estimation from Inertial and Ultra-wideband Units","date":"2025-05-14","arxiv_id":"2505.09393","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/umotion-uncertainty-driven-human-motion#ran","syntology_url":"https://syntology.ai/paper/2505.09393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.09393"}},"official":{"repos":["kk9six/umotion"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-cross-course-knowledge-tracing","slug":"contrastive-cross-course-knowledge-tracing","title":"Contrastive Cross-Course Knowledge Tracing via Concept Graph Guided Knowledge Transfer","date":"2025-05-14","arxiv_id":"2505.13489","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":5,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contrastive-cross-course-knowledge-tracing#ran","syntology_url":"https://syntology.ai/paper/2505.13489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.13489"}},"official":{"repos":["dqyzhwk/transkt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ai-aided-kalman-filters","slug":"ai-aided-kalman-filters","title":"AI-Aided Kalman Filters","date":"2024-10-16","arxiv_id":"2410.12289","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ai-aided-kalman-filters#ran","syntology_url":"https://syntology.ai/paper/2410.12289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12289"}},"official":{"repos":["shlezingerlab/ai_aided_kfs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/outlier-robust-kalman-filtering-through","slug":"outlier-robust-kalman-filtering-through","title":"Outlier-robust Kalman Filtering through Generalised Bayes","date":"2024-05-09","arxiv_id":"2405.05646","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/outlier-robust-kalman-filtering-through#ran","syntology_url":"https://syntology.ai/paper/2405.05646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.05646"}},"official":{"repos":["gerdm/weighted-likelihood-filter"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/high-cadence-thermospheric-density-estimation","slug":"high-cadence-thermospheric-density-estimation","title":"High-Cadence Thermospheric Density Estimation enabled by Machine Learning on Solar Imagery","date":"2023-11-12","arxiv_id":"2312.06845","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/high-cadence-thermospheric-density-estimation#ran","syntology_url":"https://syntology.ai/paper/2312.06845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.06845"}},"official":{"repos":["spaceml-org/karman"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transcendental-idealism-of-planner-evaluating","slug":"transcendental-idealism-of-planner-evaluating","title":"Transcendental Idealism of Planner: Evaluating Perception from Planning Perspective for Autonomous Driving","date":"2023-06-12","arxiv_id":"2306.07276","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/transcendental-idealism-of-planner-evaluating#ran","syntology_url":"https://syntology.ai/paper/2306.07276","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07276"}},"official":{"repos":["qcraftai/tip"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-optimal-feedback-control-with-local","slug":"neural-optimal-feedback-control-with-local","title":"Neural optimal feedback control with local learning rules","date":"2021-11-12","arxiv_id":"2111.06920","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/neural-optimal-feedback-control-with-local#ran","syntology_url":"https://syntology.ai/paper/2111.06920","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06920"}},"official":{"repos":["golkar/bio-ofc-gym","j-friedrich/neuralofc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/online-variational-filtering-and-parameter","slug":"online-variational-filtering-and-parameter","title":"Online Variational Filtering and Parameter Learning","date":"2021-10-26","arxiv_id":"2110.13549","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/online-variational-filtering-and-parameter#ran","syntology_url":"https://syntology.ai/paper/2110.13549","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13549"}},"official":{"repos":["andrew-cr/online_var_fil"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamical-wasserstein-barycenters-for-time","slug":"dynamical-wasserstein-barycenters-for-time","title":"Dynamical Wasserstein Barycenters for Time-series Modeling","date":"2021-10-13","arxiv_id":"2110.06741","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":2,"n_ran_checked":4,"n_instrument":4,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dynamical-wasserstein-barycenters-for-time#ran","syntology_url":"https://syntology.ai/paper/2110.06741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06741"}},"official":{"repos":["kevin-c-cheng/dynamicalwassbarycenters_gaussian"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-point-cloud-prediction-using","slug":"self-supervised-point-cloud-prediction-using","title":"Self-supervised Point Cloud Prediction Using 3D Spatio-temporal Convolutional Networks","date":"2021-09-28","arxiv_id":"2110.04076","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-point-cloud-prediction-using#ran","syntology_url":"https://syntology.ai/paper/2110.04076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04076"}},"official":{"repos":["prbonn/point-cloud-prediction"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistic-visual-place-recognition-for","slug":"probabilistic-visual-place-recognition-for","title":"Probabilistic Visual Place Recognition for Hierarchical Localization","date":"2021-05-07","arxiv_id":"2105.03091","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/probabilistic-visual-place-recognition-for#ran","syntology_url":"https://syntology.ai/paper/2105.03091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03091"}},"official":{"repos":["mingu6/ProbFiltersVPR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/action-conditional-recurrent-kalman-networks","slug":"action-conditional-recurrent-kalman-networks","title":"Action-Conditional Recurrent Kalman Networks For Forward and Inverse Dynamics Learning","date":"2020-10-20","arxiv_id":"2010.10201","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/action-conditional-recurrent-kalman-networks#ran","syntology_url":"https://syntology.ai/paper/2010.10201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.10201"}},"official":{"repos":["ALRhub/action-conditional-rkn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/assisted-perception-optimizing-observations","slug":"assisted-perception-optimizing-observations","title":"Assisted Perception: Optimizing Observations to Communicate State","date":"2020-08-06","arxiv_id":"2008.02840","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/assisted-perception-optimizing-observations#ran","syntology_url":"https://syntology.ai/paper/2008.02840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.02840"}},"official":null}},{"url":"/paper/neural-contraction-metrics-for-robust","slug":"neural-contraction-metrics-for-robust","title":"Neural Contraction Metrics for Robust Estimation and Control: A Convex Optimization Approach","date":"2020-06-08","arxiv_id":"2006.04361","repositories_listed":4,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":13,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 1 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-contraction-metrics-for-robust#ran","syntology_url":"https://syntology.ai/paper/2006.04361","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04361"}},"official":{"repos":["astrohiro/ncm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/airsim-drone-racing-lab","slug":"airsim-drone-racing-lab","title":"AirSim Drone Racing Lab","date":"2020-03-12","arxiv_id":"2003.05654","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/airsim-drone-racing-lab#ran","syntology_url":"https://syntology.ai/paper/2003.05654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05654"}},"official":{"repos":["microsoft/AirSim-NeurIPS2019-Drone-Racing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/siamfc-towards-robust-and-accurate-visual","slug":"siamfc-towards-robust-and-accurate-visual","title":"SiamFC++: Towards Robust and Accurate Visual Tracking with Target Estimation Guidelines","date":"2019-11-14","arxiv_id":"1911.06188","repositories_listed":6,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/siamfc-towards-robust-and-accurate-visual#ran","syntology_url":"https://syntology.ai/paper/1911.06188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06188"}},"official":{"repos":["MegviiDetection/video_analyst"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/kimera-an-open-source-library-for-real-time","slug":"kimera-an-open-source-library-for-real-time","title":"Kimera: an Open-Source Library for Real-Time Metric-Semantic Localization and Mapping","date":"2019-10-06","arxiv_id":"1910.02490","repositories_listed":12,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/kimera-an-open-source-library-for-real-time#ran","syntology_url":"https://syntology.ai/paper/1910.02490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02490"}},"official":{"repos":["MIT-SPARK/Kimera"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/monte-carlo-tree-search-for-efficient","slug":"monte-carlo-tree-search-for-efficient","title":"Monte-Carlo Tree Search for Efficient Visually Guided Rearrangement Planning","date":"2019-04-23","arxiv_id":"1904.10348","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/monte-carlo-tree-search-for-efficient#ran","syntology_url":"https://syntology.ai/paper/1904.10348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.10348"}},"official":{"repos":["ylabbe/rearrangement-planning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/atom-accurate-tracking-by-overlap","slug":"atom-accurate-tracking-by-overlap","title":"ATOM: Accurate Tracking by Overlap Maximization","date":"2018-11-19","arxiv_id":"1811.07628","repositories_listed":4,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/atom-accurate-tracking-by-overlap#ran","syntology_url":"https://syntology.ai/paper/1811.07628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.07628"}},"official":{"repos":["visionml/pytracking"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/differentiable-particle-filters-end-to-end","slug":"differentiable-particle-filters-end-to-end","title":"Differentiable Particle Filters: End-to-End Learning with Algorithmic Priors","date":"2018-05-28","arxiv_id":"1805.11122","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentiable-particle-filters-end-to-end#ran","syntology_url":"https://syntology.ai/paper/1805.11122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11122"}},"official":{"repos":["tu-rbo/differentiable-particle-filters"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/particle-filter-networks-with-application-to","slug":"particle-filter-networks-with-application-to","title":"Particle Filter Networks with Application to Visual Localization","date":"2018-05-23","arxiv_id":"1805.08975","repositories_listed":2,"syntology":{"n":14,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/particle-filter-networks-with-application-to#ran","syntology_url":"https://syntology.ai/paper/1805.08975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08975"}},"official":{"repos":["AdaCompNUS/pfnet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/backprop-kf-learning-discriminative","slug":"backprop-kf-learning-discriminative","title":"Backprop KF: Learning Discriminative Deterministic State Estimators","date":"2016-05-23","arxiv_id":"1605.07148","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/backprop-kf-learning-discriminative#ran","syntology_url":"https://syntology.ai/paper/1605.07148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.07148"}},"official":null}}],"record_sha256":"cec88ead1993c69ee5206c123ce187e3718c892b37d744f7c04fa65059d463b5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}