{"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/haversine","entry":"haversine","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":6,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":6,"n_places_pointer_only":1,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"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":"2602.22249","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22249","title":"Improving Spatial Allocation for Energy System Coupling with Graph Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"KIT-IAI/AllocateGNN","path":"ClusterBasedVoronoi/utils/geographic_conversion.py","file_url":"https://github.com/KIT-IAI/AllocateGNN/blob/HEAD/ClusterBasedVoronoi/utils/geographic_conversion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, KIT-IAI/AllocateGNN (NOASSERTION)","code_sha256":"d61d8867ee91ff1d","code_sha256_prefix":"d61d8867ee91ff1d","mcp_get_code":{"code_sha256":"d61d8867ee91ff1d"}},{"arxiv_id":"2503.16159","arxiv_id_is_arxiv":true,"paper":"/paper/neural-combinatorial-optimization-for-real","title":"Neural Combinatorial Optimization for Real-World Routing","date":"2025-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4co/real-routing-nco","path":"data_generation/utilities/haversine.py","file_url":"https://github.com/ai4co/real-routing-nco/blob/HEAD/data_generation/utilities/haversine.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":"2170bb4136b6af1c","code_sha256_prefix":"2170bb4136b6af1c","mcp_get_code":{"code_sha256":"2170bb4136b6af1c"}},{"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"870ae801eddcf615","code_sha256_prefix":"870ae801eddcf615","mcp_get_code":{"code_sha256":"870ae801eddcf615"}},{"arxiv_id":"2306.03838","arxiv_id_is_arxiv":true,"paper":"/paper/spherical-fourier-neural-operators-learning","title":"Spherical Fourier Neural Operators: Learning Stable Dynamics on the Sphere","date":"2023-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bernatj/ai-based-attribution","path":"3_extreme_events_case_studies/hurricane_florence_2018/tropical_cyclone_functions.py","file_url":"https://github.com/bernatj/ai-based-attribution/blob/HEAD/3_extreme_events_case_studies/hurricane_florence_2018/tropical_cyclone_functions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a16c9c0d4c6220e7","code_sha256_prefix":"a16c9c0d4c6220e7","mcp_get_code":{"code_sha256":"a16c9c0d4c6220e7"}},{"arxiv_id":"2211.13234","arxiv_id_is_arxiv":true,"paper":"/paper/rntrajrec-road-network-enhanced-trajectory","title":"RNTrajRec: Road Network Enhanced Trajectory Recovery with Spatial-Temporal Transformer","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenyuqi990215/rntrajrec","path":"preprocess/epsilon_trajectory.py","file_url":"https://github.com/chenyuqi990215/rntrajrec/blob/HEAD/preprocess/epsilon_trajectory.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":"d318a6bb973f586e","code_sha256_prefix":"d318a6bb973f586e","mcp_get_code":{"code_sha256":"d318a6bb973f586e"}},{"arxiv_id":"2208.05908","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-quantification-of-sparse-travel","title":"Uncertainty Quantification of Sparse Travel Demand Prediction with Spatial-Temporal Graph Neural Networks","date":"2022-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuangdingyi/stzinb","path":"utils.py","file_url":"https://github.com/zhuangdingyi/stzinb/blob/HEAD/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":"34b5b078f5062214","code_sha256_prefix":"34b5b078f5062214","mcp_get_code":{"code_sha256":"34b5b078f5062214"}}],"record_sha256":"41a75019f63d81df6880e61051b1ed4fc916c62b56b3770b29cdae1e9ebdbe3f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}