{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4LXUOC6VKKUXHFUFRIQBMJTGSK","short_pith_number":"pith:4LXUOC6V","schema_version":"1.0","canonical_sha256":"e2ef470bd552a97396858a2016266692b4e6c8dad1c01495a1153d50fabe0344","source":{"kind":"arxiv","id":"1706.05400","version":2},"attestation_state":"computed","paper":{"title":"Chaos, Complexity, and Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","quant-ph"],"primary_cat":"hep-th","authors_text":"Beni Yoshida, Jordan Cotler, Junyu Liu, Nicholas Hunter-Jones","submitted_at":"2017-06-16T18:30:45Z","abstract_excerpt":"Chaos and complexity entail an entropic and computational obstruction to describing a system, and thus are intrinsically difficult to characterize. In this paper, we consider time evolution by Gaussian Unitary Ensemble (GUE) Hamiltonians and analytically compute out-of-time-ordered correlation functions (OTOCs) and frame potentials to quantify scrambling, Haar-randomness, and circuit complexity. While our random matrix analysis gives a qualitatively correct prediction of the late-time behavior of chaotic systems, we find unphysical behavior at early times including an $\\mathcal{O}(1)$ scrambli"},"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":"1706.05400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2017-06-16T18:30:45Z","cross_cats_sorted":["cond-mat.stat-mech","quant-ph"],"title_canon_sha256":"8b8ab448201fc089638db210e8af5ff7777a0d4521b1682a1a52b6ed0dc5d134","abstract_canon_sha256":"0f2630682d0620a2c86623e6bf51ab27555e18587f67be8acb36bc6102f44b80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:34.057179Z","signature_b64":"tsCwyrKdyqkbJ6R5ZB2j1BUXPn3vjcSM5mwtpsyYZYqXP3no6P8UNW5raxraUeKgpcIMnHxhwqF+81qDTIz3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2ef470bd552a97396858a2016266692b4e6c8dad1c01495a1153d50fabe0344","last_reissued_at":"2026-05-18T00:30:34.056637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:34.056637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chaos, Complexity, and Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","quant-ph"],"primary_cat":"hep-th","authors_text":"Beni Yoshida, Jordan Cotler, Junyu Liu, Nicholas Hunter-Jones","submitted_at":"2017-06-16T18:30:45Z","abstract_excerpt":"Chaos and complexity entail an entropic and computational obstruction to describing a system, and thus are intrinsically difficult to characterize. In this paper, we consider time evolution by Gaussian Unitary Ensemble (GUE) Hamiltonians and analytically compute out-of-time-ordered correlation functions (OTOCs) and frame potentials to quantify scrambling, Haar-randomness, and circuit complexity. While our random matrix analysis gives a qualitatively correct prediction of the late-time behavior of chaotic systems, we find unphysical behavior at early times including an $\\mathcal{O}(1)$ scrambli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05400","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":""},"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":"1706.05400","created_at":"2026-05-18T00:30:34.056734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05400v2","created_at":"2026-05-18T00:30:34.056734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05400","created_at":"2026-05-18T00:30:34.056734+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LXUOC6VKKUX","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LXUOC6VKKUXHFUF","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LXUOC6V","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2509.04075","citing_title":"Complexity of Quadratic Quantum Chaos","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2510.20902","citing_title":"Searching for emergent spacetime in spin glasses","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2604.10122","citing_title":"Unitary Designs from Two Chaotic Hamiltonians and a Random Pauli Operation","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4LXUOC6VKKUXHFUFRIQBMJTGSK","json":"https://pith.science/pith/4LXUOC6VKKUXHFUFRIQBMJTGSK.json","graph_json":"https://pith.science/api/pith-number/4LXUOC6VKKUXHFUFRIQBMJTGSK/graph.json","events_json":"https://pith.science/api/pith-number/4LXUOC6VKKUXHFUFRIQBMJTGSK/events.json","paper":"https://pith.science/paper/4LXUOC6V"},"agent_actions":{"view_html":"https://pith.science/pith/4LXUOC6VKKUXHFUFRIQBMJTGSK","download_json":"https://pith.science/pith/4LXUOC6VKKUXHFUFRIQBMJTGSK.json","view_paper":"https://pith.science/paper/4LXUOC6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05400&json=true","fetch_graph":"https://pith.science/api/pith-number/4LXUOC6VKKUXHFUFRIQBMJTGSK/graph.json","fetch_events":"https://pith.science/api/pith-number/4LXUOC6VKKUXHFUFRIQBMJTGSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LXUOC6VKKUXHFUFRIQBMJTGSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LXUOC6VKKUXHFUFRIQBMJTGSK/action/storage_attestation","attest_author":"https://pith.science/pith/4LXUOC6VKKUXHFUFRIQBMJTGSK/action/author_attestation","sign_citation":"https://pith.science/pith/4LXUOC6VKKUXHFUFRIQBMJTGSK/action/citation_signature","submit_replication":"https://pith.science/pith/4LXUOC6VKKUXHFUFRIQBMJTGSK/action/replication_record"}},"created_at":"2026-05-18T00:30:34.056734+00:00","updated_at":"2026-05-18T00:30:34.056734+00:00"}