{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TQYMPJ7HOCIUPDJLEWML4B2545","short_pith_number":"pith:TQYMPJ7H","schema_version":"1.0","canonical_sha256":"9c30c7a7e77091478d2b2598be075de77e4242f5f6131d64e5c185e381e55789","source":{"kind":"arxiv","id":"2110.13849","version":2},"attestation_state":"computed","paper":{"title":"Physical reservoir computing using finitely-sampled quantum systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fangjun Hu, Gerasimos Angelatos, Hakan E. T\\\"ureci, Saeed Ahmed Khan","submitted_at":"2021-10-26T16:46:14Z","abstract_excerpt":"The paradigm of reservoir computing exploits the nonlinear dynamics of a physical reservoir to perform complex time-series processing tasks such as speech recognition and forecasting. Unlike other machine-learning approaches, reservoir computing relaxes the need for optimization of intra-network parameters, and is thus particularly attractive for near-term hardware-efficient quantum implementations. However, the complete description of practical quantum reservoir computers requires accounting for their placement in a quantum measurement chain, and its conditional evolution under measurement. C"},"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":"2110.13849","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-26T16:46:14Z","cross_cats_sorted":[],"title_canon_sha256":"1fc2d6d4032a58d717e04332d5f8fc54ade572e7cffbb0354d9fc3c416b69cbc","abstract_canon_sha256":"a135ca78b50493f9c9b5a0c57619ea726222c3ae79dce8968337557233301f12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:19.534551Z","signature_b64":"9chM8xJ1JqAs0WU7LnKGQZ5R52ZaXMhuqMML+WMwJAyHSocPcV4UgYVjCC+7D4BQO5OQxrj6ELFZaSb2N+dvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c30c7a7e77091478d2b2598be075de77e4242f5f6131d64e5c185e381e55789","last_reissued_at":"2026-07-05T03:29:19.534130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:19.534130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Physical reservoir computing using finitely-sampled quantum systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fangjun Hu, Gerasimos Angelatos, Hakan E. T\\\"ureci, Saeed Ahmed Khan","submitted_at":"2021-10-26T16:46:14Z","abstract_excerpt":"The paradigm of reservoir computing exploits the nonlinear dynamics of a physical reservoir to perform complex time-series processing tasks such as speech recognition and forecasting. Unlike other machine-learning approaches, reservoir computing relaxes the need for optimization of intra-network parameters, and is thus particularly attractive for near-term hardware-efficient quantum implementations. However, the complete description of practical quantum reservoir computers requires accounting for their placement in a quantum measurement chain, and its conditional evolution under measurement. C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.13849","kind":"arxiv","version":2},"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/2110.13849/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":"2110.13849","created_at":"2026-07-05T03:29:19.534179+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.13849v2","created_at":"2026-07-05T03:29:19.534179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.13849","created_at":"2026-07-05T03:29:19.534179+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQYMPJ7HOCIU","created_at":"2026-07-05T03:29:19.534179+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQYMPJ7HOCIUPDJL","created_at":"2026-07-05T03:29:19.534179+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQYMPJ7H","created_at":"2026-07-05T03:29:19.534179+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.00171","citing_title":"Quantum reservoir computing in Jaynes-Cummings models: Nonlinear memory and time-series prediction","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TQYMPJ7HOCIUPDJLEWML4B2545","json":"https://pith.science/pith/TQYMPJ7HOCIUPDJLEWML4B2545.json","graph_json":"https://pith.science/api/pith-number/TQYMPJ7HOCIUPDJLEWML4B2545/graph.json","events_json":"https://pith.science/api/pith-number/TQYMPJ7HOCIUPDJLEWML4B2545/events.json","paper":"https://pith.science/paper/TQYMPJ7H"},"agent_actions":{"view_html":"https://pith.science/pith/TQYMPJ7HOCIUPDJLEWML4B2545","download_json":"https://pith.science/pith/TQYMPJ7HOCIUPDJLEWML4B2545.json","view_paper":"https://pith.science/paper/TQYMPJ7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.13849&json=true","fetch_graph":"https://pith.science/api/pith-number/TQYMPJ7HOCIUPDJLEWML4B2545/graph.json","fetch_events":"https://pith.science/api/pith-number/TQYMPJ7HOCIUPDJLEWML4B2545/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQYMPJ7HOCIUPDJLEWML4B2545/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQYMPJ7HOCIUPDJLEWML4B2545/action/storage_attestation","attest_author":"https://pith.science/pith/TQYMPJ7HOCIUPDJLEWML4B2545/action/author_attestation","sign_citation":"https://pith.science/pith/TQYMPJ7HOCIUPDJLEWML4B2545/action/citation_signature","submit_replication":"https://pith.science/pith/TQYMPJ7HOCIUPDJLEWML4B2545/action/replication_record"}},"created_at":"2026-07-05T03:29:19.534179+00:00","updated_at":"2026-07-05T03:29:19.534179+00:00"}