{"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/unrolling/papers/ran/1","list_of":"/task/unrolling","task":"Rolling Shutter Correction","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,18],"of":18,"counts":{"archive_papers_tagged":216,"with_a_code_link":94,"where_syntology_ran_a_sample":18,"not_listed_spam_title":0,"listed":216,"listed_where_code_ran":18,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":18,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":18,"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 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/unrolling/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/rolling-shutter-correction-with-intermediate","slug":"rolling-shutter-correction-with-intermediate","title":"Rolling Shutter Correction with Intermediate Distortion Flow Estimation","date":"2024-04-09","arxiv_id":"2404.06350","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/rolling-shutter-correction-with-intermediate#ran","syntology_url":"https://syntology.ai/paper/2404.06350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.06350"}},"official":{"repos":["ljzycmd/dfrsc"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pygsl-a-graph-structure-learning-toolkit","slug":"pygsl-a-graph-structure-learning-toolkit","title":"pyGSL: A Graph Structure Learning Toolkit","date":"2022-11-07","arxiv_id":"2211.03583","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pygsl-a-graph-structure-learning-toolkit#ran","syntology_url":"https://syntology.ai/paper/2211.03583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03583"}},"official":{"repos":["maxwass/pygsl"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ru-net-regularized-unrolling-network-for","slug":"ru-net-regularized-unrolling-network-for","title":"RU-Net: Regularized Unrolling Network for Scene Graph Generation","date":"2022-05-03","arxiv_id":"2205.01297","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ru-net-regularized-unrolling-network-for#ran","syntology_url":"https://syntology.ai/paper/2205.01297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01297"}},"official":{"repos":["siml3/ru-net"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-adaptive-warping-for-real-world","slug":"learning-adaptive-warping-for-real-world","title":"Learning Adaptive Warping for Real-World Rolling Shutter Correction","date":"2022-04-29","arxiv_id":"2204.13886","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/learning-adaptive-warping-for-real-world#ran","syntology_url":"https://syntology.ai/paper/2204.13886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13886"}},"official":{"repos":["ljzycmd/bsrsc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-training-implicit-models","slug":"on-training-implicit-models","title":"On Training Implicit Models","date":"2021-11-09","arxiv_id":"2111.05177","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-training-implicit-models#ran","syntology_url":"https://syntology.ai/paper/2111.05177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.05177"}},"official":{"repos":["gsunshine/phantom_grad"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/hyperparameter-tuning-is-all-you-need-for","slug":"hyperparameter-tuning-is-all-you-need-for","title":"Hyperparameter Tuning is All You Need for LISTA","date":"2021-10-29","arxiv_id":"2110.15900","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hyperparameter-tuning-is-all-you-need-for#ran","syntology_url":"https://syntology.ai/paper/2110.15900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15900"}},"official":{"repos":["vita-group/hyperlista"],"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/photon-limited-non-blind-deblurring-using","slug":"photon-limited-non-blind-deblurring-using","title":"Photon Limited Non-Blind Deblurring Using Algorithm Unrolling","date":"2021-10-28","arxiv_id":"2110.15314","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/photon-limited-non-blind-deblurring-using#ran","syntology_url":"https://syntology.ai/paper/2110.15314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15314"}},"official":{"repos":["sanghviyashiitb/poisson-deblurring"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-unfolding-total-variation-network","slug":"adaptive-unfolding-total-variation-network","title":"Adaptive Unfolding Total Variation Network for Low-Light Image Enhancement","date":"2021-10-03","arxiv_id":"2110.00984","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":5,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"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) · 4 unverified","sample_list":"/paper/adaptive-unfolding-total-variation-network#ran","syntology_url":"https://syntology.ai/paper/2110.00984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.00984"}},"official":{"repos":["charliezcj/utvnet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/unrolling-sgd-understanding-factors","slug":"unrolling-sgd-understanding-factors","title":"Unrolling SGD: Understanding Factors Influencing Machine Unlearning","date":"2021-09-27","arxiv_id":"2109.13398","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unrolling-sgd-understanding-factors#ran","syntology_url":"https://syntology.ai/paper/2109.13398","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.13398"}},"official":{"repos":["cleverhans-lab/unrolling-sgd"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fixed-points-of-monotonic-and-weakly-scalable","slug":"fixed-points-of-monotonic-and-weakly-scalable","title":"Fixed points of nonnegative neural networks","date":"2021-06-30","arxiv_id":"2106.16239","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fixed-points-of-monotonic-and-weakly-scalable#ran","syntology_url":"https://syntology.ai/paper/2106.16239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.16239"}},"official":{"repos":["mateuszgabor/nn_networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dictionary-and-prior-learning-with-unrolled","slug":"dictionary-and-prior-learning-with-unrolled","title":"Understanding approximate and unrolled dictionary learning for pattern recovery","date":"2021-06-11","arxiv_id":"2106.06338","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/dictionary-and-prior-learning-with-unrolled#ran","syntology_url":"https://syntology.ai/paper/2106.06338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06338"}},"official":{"repos":["bmalezieux/unrolled_dl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-reconstruction-meets-data-driven","slug":"end-to-end-reconstruction-meets-data-driven","title":"End-to-end reconstruction meets data-driven regularization for inverse problems","date":"2021-06-07","arxiv_id":"2106.03538","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/end-to-end-reconstruction-meets-data-driven#ran","syntology_url":"https://syntology.ai/paper/2106.03538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03538"}},"official":{"repos":["Subhadip-1/unrolling_meets_data_driven_regularization"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pudle-implicit-acceleration-of-dictionary","slug":"pudle-implicit-acceleration-of-dictionary","title":"Stable and Interpretable Unrolled Dictionary Learning","date":"2021-05-31","arxiv_id":"2106.00058","repositories_listed":1,"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/pudle-implicit-acceleration-of-dictionary#ran","syntology_url":"https://syntology.ai/paper/2106.00058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00058"}},"official":{"repos":["btolooshams/stable-interpretable-unrolled-dl"],"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/adversarial-training-as-stackelberg-game-an","slug":"adversarial-training-as-stackelberg-game-an","title":"Adversarial Regularization as Stackelberg Game: An Unrolled Optimization Approach","date":"2021-04-11","arxiv_id":"2104.04886","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-training-as-stackelberg-game-an#ran","syntology_url":"https://syntology.ai/paper/2104.04886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04886"}},"official":{"repos":["SimiaoZuo/Stackelberg-Adv"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/delta-stn-efficient-bilevel-optimization-for","slug":"delta-stn-efficient-bilevel-optimization-for","title":"Delta-STN: Efficient Bilevel Optimization for Neural Networks using Structured Response Jacobians","date":"2020-10-26","arxiv_id":"2010.13514","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/delta-stn-efficient-bilevel-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2010.13514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13514"}},"official":{"repos":["pomonam/Self-Tuning-Networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vs-net-variable-splitting-network-for","slug":"vs-net-variable-splitting-network-for","title":"VS-Net: Variable splitting network for accelerated parallel MRI reconstruction","date":"2019-07-19","arxiv_id":"1907.10033","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vs-net-variable-splitting-network-for#ran","syntology_url":"https://syntology.ai/paper/1907.10033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10033"}},"official":{"repos":["j-duan/VS-Net"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pointnetlk-robust-efficient-point-cloud","slug":"pointnetlk-robust-efficient-point-cloud","title":"PointNetLK: Robust & Efficient Point Cloud Registration using PointNet","date":"2019-03-13","arxiv_id":"1903.05711","repositories_listed":7,"syntology":{"n":24,"n_ran":20,"n_constructed":0,"n_ran_checked":18,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":18,"n_pointer_only":22,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 0 violated, 18 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/pointnetlk-robust-efficient-point-cloud#ran","syntology_url":"https://syntology.ai/paper/1903.05711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.05711"}},"official":{"repos":["hmgoforth/PointNetLK"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/continual-learning-of-recurrent-neural","slug":"continual-learning-of-recurrent-neural","title":"Continual Learning of Recurrent Neural Networks by Locally Aligning Distributed Representations","date":"2018-10-17","arxiv_id":"1810.07411","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/continual-learning-of-recurrent-neural#ran","syntology_url":"https://syntology.ai/paper/1810.07411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.07411"}},"official":{"repos":["AnkurMali/ContinualPTNCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"6c697fcfcf30562585c65fc65c74b318738b87cf21295561336f5031664f57c8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}