{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VBGEQAWT74AJCBU54NE6OYL4CQ","short_pith_number":"pith:VBGEQAWT","schema_version":"1.0","canonical_sha256":"a84c4802d3ff0091069de349e7617c140801b5d5ec9bc6d7f111e7a6e7a71251","source":{"kind":"arxiv","id":"2505.10062","version":2},"attestation_state":"computed","paper":{"title":"Exponential concentration and symmetries in Quantum Reservoir Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Antonio Sannia, Gian Luca Giorgi, Roberta Zambrini","submitted_at":"2025-05-15T08:05:06Z","abstract_excerpt":"Quantum reservoir computing (QRC) is an emerging framework for near-term quantum machine learning that offers in-memory processing, platform versatility across analogue and digital systems, and avoids typical trainability challenges such as barren plateaus and local minima. The exponential number of independent features of quantum reservoirs opens the way to a potential performance improvement compared to classical settings. However, this exponential scaling can be hindered by exponential concentration, where finite-ensemble noise in quantum measurements requires exponentially many samples to "},"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":"2505.10062","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-15T08:05:06Z","cross_cats_sorted":[],"title_canon_sha256":"c0c0e253df8b4f90832a0fc5fd4c19ecdadb1588b1bf8f5c747de980e2c50735","abstract_canon_sha256":"0f646b15ddd2c6ab97aa1949c58a0eaa8b417d7294530772e4285441ef76a363"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:44.584345Z","signature_b64":"WM29GHU9CoOoTugpPZ5MqprnqCumx2hgP6/QpEuwQbQFbO725dn5HbasIKlZOdBC1BAJS7kM9w0hMqKUoIOMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a84c4802d3ff0091069de349e7617c140801b5d5ec9bc6d7f111e7a6e7a71251","last_reissued_at":"2026-07-05T11:05:44.583845Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:44.583845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential concentration and symmetries in Quantum Reservoir Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Antonio Sannia, Gian Luca Giorgi, Roberta Zambrini","submitted_at":"2025-05-15T08:05:06Z","abstract_excerpt":"Quantum reservoir computing (QRC) is an emerging framework for near-term quantum machine learning that offers in-memory processing, platform versatility across analogue and digital systems, and avoids typical trainability challenges such as barren plateaus and local minima. The exponential number of independent features of quantum reservoirs opens the way to a potential performance improvement compared to classical settings. However, this exponential scaling can be hindered by exponential concentration, where finite-ensemble noise in quantum measurements requires exponentially many samples to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10062","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/2505.10062/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":"2505.10062","created_at":"2026-07-05T11:05:44.583905+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.10062v2","created_at":"2026-07-05T11:05:44.583905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10062","created_at":"2026-07-05T11:05:44.583905+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBGEQAWT74AJ","created_at":"2026-07-05T11:05:44.583905+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBGEQAWT74AJCBU5","created_at":"2026-07-05T11:05:44.583905+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBGEQAWT","created_at":"2026-07-05T11:05:44.583905+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18991","citing_title":"Measurement-enabled online quantum processing with amplitude encoding","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2510.18623","citing_title":"Optimal quantum reservoir learning in proximity to universality","ref_index":82,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12441","citing_title":"Efficient classical training of model-free quantum photonic reservoir","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBGEQAWT74AJCBU54NE6OYL4CQ","json":"https://pith.science/pith/VBGEQAWT74AJCBU54NE6OYL4CQ.json","graph_json":"https://pith.science/api/pith-number/VBGEQAWT74AJCBU54NE6OYL4CQ/graph.json","events_json":"https://pith.science/api/pith-number/VBGEQAWT74AJCBU54NE6OYL4CQ/events.json","paper":"https://pith.science/paper/VBGEQAWT"},"agent_actions":{"view_html":"https://pith.science/pith/VBGEQAWT74AJCBU54NE6OYL4CQ","download_json":"https://pith.science/pith/VBGEQAWT74AJCBU54NE6OYL4CQ.json","view_paper":"https://pith.science/paper/VBGEQAWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.10062&json=true","fetch_graph":"https://pith.science/api/pith-number/VBGEQAWT74AJCBU54NE6OYL4CQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VBGEQAWT74AJCBU54NE6OYL4CQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBGEQAWT74AJCBU54NE6OYL4CQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBGEQAWT74AJCBU54NE6OYL4CQ/action/storage_attestation","attest_author":"https://pith.science/pith/VBGEQAWT74AJCBU54NE6OYL4CQ/action/author_attestation","sign_citation":"https://pith.science/pith/VBGEQAWT74AJCBU54NE6OYL4CQ/action/citation_signature","submit_replication":"https://pith.science/pith/VBGEQAWT74AJCBU54NE6OYL4CQ/action/replication_record"}},"created_at":"2026-07-05T11:05:44.583905+00:00","updated_at":"2026-07-05T11:05:44.583905+00:00"}