{"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/translation-from-matrix","entry":"translation_from_matrix","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":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":15,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":15,"n_places_pointer_only":0,"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":0,"ran_fixture":0,"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":"2303.11739","arxiv_id_is_arxiv":true,"paper":"/paper/data-efficient-large-scale-place-recognition","title":"Data-efficient Large Scale Place Recognition with Graded Similarity Supervision","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marialeyvallina/generalized_contrastive_loss","path":"src/labeling/transformations.py","file_url":"https://github.com/marialeyvallina/generalized_contrastive_loss/blob/HEAD/src/labeling/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"2007.14628","arxiv_id_is_arxiv":true,"paper":"/paper/solving-the-blind-perspective-n-point-problem","title":"Solving the Blind Perspective-n-Point Problem End-To-End With Robust Differentiable Geometric Optimization","date":"2020-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liumouliu/Deep_blind_PnP","path":"lib/transformations.py","file_url":"https://github.com/Liumouliu/Deep_blind_PnP/blob/HEAD/lib/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"2003.00188","arxiv_id_is_arxiv":true,"paper":"/paper/robust-6d-object-pose-estimation-by-learning","title":"Robust 6D Object Pose Estimation by Learning RGB-D Features","date":"2020-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mentian/object-posenet","path":"lib/transformations.py","file_url":"https://github.com/mentian/object-posenet/blob/HEAD/lib/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"1910.10750","arxiv_id_is_arxiv":true,"paper":"/paper/6-pack-category-level-6d-pose-tracker-with","title":"6-PACK: Category-level 6D Pose Tracker with Anchor-Based Keypoints","date":"2019-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"j96w/6-PACK","path":"libs/transformations.py","file_url":"https://github.com/j96w/6-PACK/blob/HEAD/libs/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"1907.11200","arxiv_id_is_arxiv":true,"paper":"/paper/tunenet-one-shot-residual-tuning-for-system","title":"TuneNet: One-Shot Residual Tuning for System Identification and Sim-to-Real Robot Task Transfer","date":null,"month_inferred_from_arxiv_id":"2019-07","title_source":"archive","repo":"Kukanani/tune-net-release","path":"tune/transformations.py","file_url":"https://github.com/Kukanani/tune-net-release/blob/HEAD/tune/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"1901.04780","arxiv_id_is_arxiv":true,"paper":"/paper/densefusion-6d-object-pose-estimation-by","title":"DenseFusion: 6D Object Pose Estimation by Iterative Dense Fusion","date":"2019-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RiplleYang/DenseFusion","path":"lib/transformations.py","file_url":"https://github.com/RiplleYang/DenseFusion/blob/HEAD/lib/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"1807.00412","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-drive-in-a-day","title":"Learning to Drive in a Day","date":"2018-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"B-C-WANG/ReinforcementLearningInAutoPilot","path":"src/thirdParty/transformations.py","file_url":"https://github.com/B-C-WANG/ReinforcementLearningInAutoPilot/blob/HEAD/src/thirdParty/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"1805.01026","arxiv_id_is_arxiv":true,"paper":"/paper/computing-cnn-loss-and-gradients-for-pose","title":"Computing CNN Loss and Gradients for Pose Estimation with Riemannian Geometry","date":"2018-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"farrell236/SVRnet","path":"generate_data/transformations.py","file_url":"https://github.com/farrell236/SVRnet/blob/HEAD/generate_data/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"1803.04996","arxiv_id_is_arxiv":true,"paper":"/paper/comparing-task-simplifications-to-learn","title":"Comparing Task Simplifications to Learn Closed-Loop Object Picking Using Deep Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2018-03","title_source":"archive","repo":"BarisYazici/deep-rl-grasping","path":"manipulation_main/common/transformations.py","file_url":"https://github.com/BarisYazici/deep-rl-grasping/blob/HEAD/manipulation_main/common/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"1612.00593","arxiv_id_is_arxiv":true,"paper":"/paper/pointnet-deep-learning-on-point-sets-for-3d","title":"PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation","date":"2016-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SBPL-Cruz/perch_pose_sampler","path":"utils/transformations.py","file_url":"https://github.com/SBPL-Cruz/perch_pose_sampler/blob/HEAD/utils/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"aaai_25456","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25456","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SuhZhang/ConvMatch","path":"core/transformations.py","file_url":"https://github.com/SuhZhang/ConvMatch/blob/HEAD/core/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"aaai_20104","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20104","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"swords123/SSC-6D","path":"lib/models/transformations.py","file_url":"https://github.com/swords123/SSC-6D/blob/HEAD/lib/models/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"aaai_19917","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_19917","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ZhiChen902/DetarNet","path":"transformations.py","file_url":"https://github.com/ZhiChen902/DetarNet/blob/HEAD/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"Zhong_T-Net_Effective_Permutation-Equivariant_Network_for_Two-View_Correspondence_Learning_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhong_T-Net_Effective_Permutation-Equivariant_Network_for_Two-View_Correspondence_Learning_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"x-gb/T-Net","path":"transformations.py","file_url":"https://github.com/x-gb/T-Net/blob/HEAD/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}},{"arxiv_id":"Zhang_DeMatch_Deep_Decomposition_of_Motion_Field_for_Two-View_Correspondence_Learning_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhang_DeMatch_Deep_Decomposition_of_Motion_Field_for_Two-View_Correspondence_Learning_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SuhZhang/DeMatch","path":"core/transformations.py","file_url":"https://github.com/SuhZhang/DeMatch/blob/HEAD/core/transformations.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":"77cb383b0cd2a54e","code_sha256_prefix":"77cb383b0cd2a54e","mcp_get_code":{"code_sha256":"77cb383b0cd2a54e"}}],"record_sha256":"6b735cb828948b544f3c2226818d30b64a14079622578efbee4c68a1e081bdb5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}