{"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/sequential-image-classification/papers/ran/1","list_of":"/task/sequential-image-classification","task":"Sequential Image Classification","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,19],"of":19,"counts":{"archive_papers_tagged":44,"with_a_code_link":38,"where_syntology_ran_a_sample":19,"not_listed_spam_title":0,"listed":44,"listed_where_code_ran":19,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":16,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":16,"listed_every_run_a_failure_of_syntologys_instrument":3,"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/sequential-image-classification/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/sequence-modeling-with-multiresolution","slug":"sequence-modeling-with-multiresolution","title":"Sequence Modeling with Multiresolution Convolutional Memory","date":"2023-05-02","arxiv_id":"2305.01638","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 5 unverified","sample_list":"/paper/sequence-modeling-with-multiresolution#ran","syntology_url":"https://syntology.ai/paper/2305.01638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.01638"}},"official":{"repos":["thjashin/multires-conv"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/smpconv-self-moving-point-representations-for","slug":"smpconv-self-moving-point-representations-for","title":"SMPConv: Self-moving Point Representations for Continuous Convolution","date":"2023-04-05","arxiv_id":"2304.02330","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/smpconv-self-moving-point-representations-for#ran","syntology_url":"https://syntology.ai/paper/2304.02330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.02330"}},"official":{"repos":["sangnekim/smpconv"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/resurrecting-recurrent-neural-networks-for","slug":"resurrecting-recurrent-neural-networks-for","title":"Resurrecting Recurrent Neural Networks for Long Sequences","date":"2023-03-11","arxiv_id":"2303.06349","repositories_listed":11,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"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 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) · 0 unverified","sample_list":"/paper/resurrecting-recurrent-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2303.06349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06349"}},"official":null}},{"url":"/paper/efficiently-modeling-long-sequences-with-1","slug":"efficiently-modeling-long-sequences-with-1","title":"Efficiently Modeling Long Sequences with Structured State Spaces","date":"2021-10-31","arxiv_id":"2111.00396","repositories_listed":8,"syntology":{"n":55,"n_ran":37,"n_constructed":8,"n_ran_checked":21,"n_instrument":16,"n_unverified":18,"n_honours":2,"n_violates":1,"n_no_contract":18,"n_pointer_only":3,"phrase":"37 ran (of which 8 constructed an object rather than computing a result; 21 with no instrument failure: 2 honoured, 1 violated, 18 with no contract checked; 16 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/efficiently-modeling-long-sequences-with-1#ran","syntology_url":"https://syntology.ai/paper/2111.00396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.00396"}},"official":{"repos":["state-spaces/s4"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["community","listed","official"]}}},{"url":"/paper/combining-recurrent-convolutional-and","slug":"combining-recurrent-convolutional-and","title":"Combining Recurrent, Convolutional, and Continuous-time Models with Linear State-Space Layers","date":"2021-10-26","arxiv_id":"2110.13985","repositories_listed":2,"syntology":{"n":53,"n_ran":19,"n_constructed":0,"n_ran_checked":5,"n_instrument":14,"n_unverified":34,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 14 where Syntology's instrument failed) · 34 unverified","sample_list":"/paper/combining-recurrent-convolutional-and#ran","syntology_url":"https://syntology.ai/paper/2110.13985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13985"}},"official":{"repos":["hazyresearch/state-spaces"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":16,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/long-expressive-memory-for-sequence-modeling-1","slug":"long-expressive-memory-for-sequence-modeling-1","title":"Long Expressive Memory for Sequence Modeling","date":"2021-10-10","arxiv_id":"2110.04744","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":1,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/long-expressive-memory-for-sequence-modeling-1#ran","syntology_url":"https://syntology.ai/paper/2110.04744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04744"}},"official":{"repos":["tk-rusch/lem"],"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":["found_in_text","official"]}}},{"url":"/paper/unicornn-a-recurrent-model-for-learning-very","slug":"unicornn-a-recurrent-model-for-learning-very","title":"UnICORNN: A recurrent model for learning very long time dependencies","date":"2021-03-09","arxiv_id":"2103.05487","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/unicornn-a-recurrent-model-for-learning-very#ran","syntology_url":"https://syntology.ai/paper/2103.05487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.05487"}},"official":{"repos":["tk-rusch/unicornn"],"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/coupled-oscillatory-recurrent-neural-network","slug":"coupled-oscillatory-recurrent-neural-network","title":"Coupled Oscillatory Recurrent Neural Network (coRNN): An accurate and (gradient) stable architecture for learning long time dependencies","date":"2020-10-02","arxiv_id":"2010.00951","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/coupled-oscillatory-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/2010.00951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00951"}},"official":{"repos":["tk-rusch/coRNN"],"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/hippo-recurrent-memory-with-optimal","slug":"hippo-recurrent-memory-with-optimal","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","date":"2020-08-17","arxiv_id":"2008.07669","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":5,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hippo-recurrent-memory-with-optimal#ran","syntology_url":"https://syntology.ai/paper/2008.07669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07669"}},"official":{"repos":["HazyResearch/hippo-code"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/learning-to-combine-top-down-and-bottom-up","slug":"learning-to-combine-top-down-and-bottom-up","title":"Learning to Combine Top-Down and Bottom-Up Signals in Recurrent Neural Networks with Attention over Modules","date":"2020-06-30","arxiv_id":"2006.16981","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-combine-top-down-and-bottom-up#ran","syntology_url":"https://syntology.ai/paper/2006.16981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16981"}},"official":{"repos":["sarthmit/BRIMs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/r-transformer-recurrent-neural-network","slug":"r-transformer-recurrent-neural-network","title":"R-Transformer: Recurrent Neural Network Enhanced Transformer","date":"2019-07-12","arxiv_id":"1907.05572","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/r-transformer-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1907.05572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05572"}},"official":{"repos":["DSE-MSU/R-transformer"],"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":["official"]}}},{"url":"/paper/learning-to-remember-more-with-less","slug":"learning-to-remember-more-with-less","title":"Learning to Remember More with Less Memorization","date":"2019-01-05","arxiv_id":"1901.01347","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-remember-more-with-less#ran","syntology_url":"https://syntology.ai/paper/1901.01347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.01347"}},"official":null}},{"url":"/paper/trellis-networks-for-sequence-modeling","slug":"trellis-networks-for-sequence-modeling","title":"Trellis Networks for Sequence Modeling","date":"2018-10-15","arxiv_id":"1810.06682","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/trellis-networks-for-sequence-modeling#ran","syntology_url":"https://syntology.ai/paper/1810.06682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.06682"}},"official":{"repos":["locuslab/trellisnet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/long-short-term-memory-and-learning-to-learn","slug":"long-short-term-memory-and-learning-to-learn","title":"Long short-term memory and learning-to-learn in networks of spiking neurons","date":"2018-03-26","arxiv_id":"1803.09574","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/long-short-term-memory-and-learning-to-learn#ran","syntology_url":"https://syntology.ai/paper/1803.09574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.09574"}},"official":null}},{"url":"/paper/independently-recurrent-neural-network-indrnn","slug":"independently-recurrent-neural-network-indrnn","title":"Independently Recurrent Neural Network (IndRNN): Building A Longer and Deeper RNN","date":"2018-03-13","arxiv_id":"1803.04831","repositories_listed":11,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/independently-recurrent-neural-network-indrnn#ran","syntology_url":"https://syntology.ai/paper/1803.04831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04831"}},"official":{"repos":["Sunnydreamrain/IndRNN_Theano_Lasagne"],"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/an-empirical-evaluation-of-generic","slug":"an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","arxiv_id":"1803.01271","repositories_listed":35,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-empirical-evaluation-of-generic#ran","syntology_url":"https://syntology.ai/paper/1803.01271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01271"}},"official":{"repos":["locuslab/TCN"],"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/dilated-recurrent-neural-networks","slug":"dilated-recurrent-neural-networks","title":"Dilated Recurrent Neural Networks","date":"2017-10-05","arxiv_id":"1710.02224","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dilated-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1710.02224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.02224"}},"official":{"repos":["code-terminator/DilatedRNN"],"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/recurrent-batch-normalization","slug":"recurrent-batch-normalization","title":"Recurrent Batch Normalization","date":"2016-03-30","arxiv_id":"1603.09025","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/recurrent-batch-normalization#ran","syntology_url":"https://syntology.ai/paper/1603.09025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.09025"}},"official":null}},{"url":"/paper/unitary-evolution-recurrent-neural-networks","slug":"unitary-evolution-recurrent-neural-networks","title":"Unitary Evolution Recurrent Neural Networks","date":"2015-11-20","arxiv_id":"1511.06464","repositories_listed":2,"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/unitary-evolution-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1511.06464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06464"}},"official":null}}],"record_sha256":"78cacf8de009ae0f41a51e38b949d5b6efbc65df3284d947f57eb56e4e5b3ce7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}