{"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":"/dataset/v-rank","name":"V-Rank","full_name":"SIMULATED AIRCRAFT TRAJECTORY FOR THEORETICAL VELOCITY RANKING","description_markdown":"# Abstract \r\n\r\nThis data set is a data set used for aircraft theoretical velocity ranking. Four sensors are randomly arranged in a 1*1 square map, and three aircraft will fly over the map coverage area at the same time. The velocity of the aircraft is simulated by a random process. The theoretical velocities of the three aircraft are similar, and the velocity of the aircraft will be disturbed during actual flight, causing large fluctuations, so that it is difficult to distinguish the theoretical velocity order of the aircraft flying into the map. The coverage area of the sensor is circular with a fixed radius. The four sensors have a unified detection interval event and will detect the position of the aircraft within the coverage area with unified accuracy. The target task is to reason the theoretical velocity ranking of three aircraft through the trajectory data collected by the sensors.\r\n\r\n# Instructions\r\n\r\ncase_name is name of simulated case.\r\naircraft{k}_velocity is theoretical velocity of Aircarft {k}.\r\naircraft{k}_path is trajectory data of of Aircarft {k}with format (time, (x, y)).\r\nsensor{k}_position is position of sensor {x} with format (x,y).\r\nsensor{k}_radius is radius of sensor {x}.\r\nsensor{x}_precision is precision of sensor {x}.\r\n#Bibtex\r\n```bibtex\r\n@data{pcvh-0j22-24,\r\ndoi = {10.21227/pcvh-0j22},\r\nurl = {https://dx.doi.org/10.21227/pcvh-0j22},\r\nauthor = {Zhan, Tianxiang},\r\npublisher = {IEEE Dataport},\r\ntitle = {Simulated aircraft trajectory for theoretical velocity ranking},\r\nyear = {2024} }\r\n```","description_withheld":null,"homepage":"https://doi.org/10.21227/pcvh-0j22","introduced_date":"2024-02-20","introduced_date_note":null,"introduced_by":{"paper":"/paper/random-graph-set-and-evidence-pattern","title":"Random Graph Set and Evidence Pattern Reasoning Model","first_author":"Tianxiang Zhan","url":null},"license":null,"modalities":[{"name":"Tracking","url":"/datasets/modality/tracking"}],"tasks":[],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["V-Rank"],"data_loaders":[],"num_papers_in_archive":1,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":0,"of":0,"counts":{"papers_with_a_benchmark_row":0,"with_a_code_link":0,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":0,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[],"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":0,"samples_harvested":0,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":0,"papers_with_a_run_with_no_instrument_failure":0,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"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'","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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"c489f60480b5d8238fc11d8a589c3c239a4f8e42df5ef74c122bfa3c166d887a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}