{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KNAN5O3Q6T5AMXCCUNKXHBSZWC","short_pith_number":"pith:KNAN5O3Q","schema_version":"1.0","canonical_sha256":"5340debb70f4fa065c42a355738659b0990ee90e636558e8220ca57d66146e87","source":{"kind":"arxiv","id":"2011.00328","version":1},"attestation_state":"computed","paper":{"title":"On the rate of convergence of a deep recurrent neural network estimate in a regression problem with dependent data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Adam Krzyzak, Michael Kohler","submitted_at":"2020-10-31T18:07:06Z","abstract_excerpt":"A regression problem with dependent data is considered. Regularity assumptions on the dependency of the data are introduced, and it is shown that under suitable structural assumptions on the regression function a deep recurrent neural network estimate is able to circumvent the curse of dimensionality."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2011.00328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-10-31T18:07:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8521cc497d29007dbb002b532aad21085e43a83bb27ae07410c3575b1b2214b7","abstract_canon_sha256":"bfcfdba62baebac722872b254a119928736014f95a06145083e1717513ab1546"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:48:15.087889Z","signature_b64":"5yOP/kgZTFae4CGM+Q0IaYA2XIx7GWuz2sUYOaIHZx1G6kaiBHFqMrWbW2sTks/cz1mRIWfVD3SsnfLMXMTyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5340debb70f4fa065c42a355738659b0990ee90e636558e8220ca57d66146e87","last_reissued_at":"2026-07-05T01:48:15.087455Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:48:15.087455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the rate of convergence of a deep recurrent neural network estimate in a regression problem with dependent data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Adam Krzyzak, Michael Kohler","submitted_at":"2020-10-31T18:07:06Z","abstract_excerpt":"A regression problem with dependent data is considered. Regularity assumptions on the dependency of the data are introduced, and it is shown that under suitable structural assumptions on the regression function a deep recurrent neural network estimate is able to circumvent the curse of dimensionality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.00328","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.00328/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.00328","created_at":"2026-07-05T01:48:15.087510+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.00328v1","created_at":"2026-07-05T01:48:15.087510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.00328","created_at":"2026-07-05T01:48:15.087510+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNAN5O3Q6T5A","created_at":"2026-07-05T01:48:15.087510+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNAN5O3Q6T5AMXCC","created_at":"2026-07-05T01:48:15.087510+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNAN5O3Q","created_at":"2026-07-05T01:48:15.087510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02253","citing_title":"Simultaneous Inference for Nonlinear Time Series, a Sieve M-regression Approach","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KNAN5O3Q6T5AMXCCUNKXHBSZWC","json":"https://pith.science/pith/KNAN5O3Q6T5AMXCCUNKXHBSZWC.json","graph_json":"https://pith.science/api/pith-number/KNAN5O3Q6T5AMXCCUNKXHBSZWC/graph.json","events_json":"https://pith.science/api/pith-number/KNAN5O3Q6T5AMXCCUNKXHBSZWC/events.json","paper":"https://pith.science/paper/KNAN5O3Q"},"agent_actions":{"view_html":"https://pith.science/pith/KNAN5O3Q6T5AMXCCUNKXHBSZWC","download_json":"https://pith.science/pith/KNAN5O3Q6T5AMXCCUNKXHBSZWC.json","view_paper":"https://pith.science/paper/KNAN5O3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.00328&json=true","fetch_graph":"https://pith.science/api/pith-number/KNAN5O3Q6T5AMXCCUNKXHBSZWC/graph.json","fetch_events":"https://pith.science/api/pith-number/KNAN5O3Q6T5AMXCCUNKXHBSZWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNAN5O3Q6T5AMXCCUNKXHBSZWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNAN5O3Q6T5AMXCCUNKXHBSZWC/action/storage_attestation","attest_author":"https://pith.science/pith/KNAN5O3Q6T5AMXCCUNKXHBSZWC/action/author_attestation","sign_citation":"https://pith.science/pith/KNAN5O3Q6T5AMXCCUNKXHBSZWC/action/citation_signature","submit_replication":"https://pith.science/pith/KNAN5O3Q6T5AMXCCUNKXHBSZWC/action/replication_record"}},"created_at":"2026-07-05T01:48:15.087510+00:00","updated_at":"2026-07-05T01:48:15.087510+00:00"}