{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SRSHGTZBXNOKFIXVA2IE4LL7NB","short_pith_number":"pith:SRSHGTZB","schema_version":"1.0","canonical_sha256":"9464734f21bb5ca2a2f506904e2d7f68717551e532346f875af6bcc0555686a6","source":{"kind":"arxiv","id":"2409.15666","version":2},"attestation_state":"computed","paper":{"title":"Multiseed Krylov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th"],"primary_cat":"quant-ph","authors_text":"Ben Craps, Gabriele Pascuzzi, Oleg Evnin","submitted_at":"2024-09-24T02:03:36Z","abstract_excerpt":"Krylov complexity is an attractive measure for the rate at which quantum operators spread in the space of all possible operators under dynamical evolution. One expects that its late-time plateau would distinguish between integrable and chaotic dynamics, but its ability to do so depends precariously on the choice of the initial seed. We propose to apply such considerations not to a single operator, but simultaneously to a collection of initial seeds in the manner of the block-Lanczos algorithm. We furthermore suggest that this collection should comprise all simple (few-body) operators in the th"},"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":"2409.15666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-09-24T02:03:36Z","cross_cats_sorted":["hep-th"],"title_canon_sha256":"46a57477c992bc0f47379f7a456e54894c35a2583ff6d49c90fc0fb4b1e1908f","abstract_canon_sha256":"f274491834a2423d035f42e10b9985f31a640e07c2b9b8a8cce14d759b7f70dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:09.284397Z","signature_b64":"hMQYzqIQPuIw5E++EIAV4RF65WB5GyIU084dc73XS4TP2TkWPKiwJvVWTWrhNKCE7Bd9d1LEe/F1zuNnni+XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9464734f21bb5ca2a2f506904e2d7f68717551e532346f875af6bcc0555686a6","last_reissued_at":"2026-07-05T10:09:09.283952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:09.283952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiseed Krylov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th"],"primary_cat":"quant-ph","authors_text":"Ben Craps, Gabriele Pascuzzi, Oleg Evnin","submitted_at":"2024-09-24T02:03:36Z","abstract_excerpt":"Krylov complexity is an attractive measure for the rate at which quantum operators spread in the space of all possible operators under dynamical evolution. One expects that its late-time plateau would distinguish between integrable and chaotic dynamics, but its ability to do so depends precariously on the choice of the initial seed. We propose to apply such considerations not to a single operator, but simultaneously to a collection of initial seeds in the manner of the block-Lanczos algorithm. We furthermore suggest that this collection should comprise all simple (few-body) operators in the th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.15666","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/2409.15666/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":"2409.15666","created_at":"2026-07-05T10:09:09.284020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.15666v2","created_at":"2026-07-05T10:09:09.284020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15666","created_at":"2026-07-05T10:09:09.284020+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRSHGTZBXNOK","created_at":"2026-07-05T10:09:09.284020+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRSHGTZBXNOKFIXV","created_at":"2026-07-05T10:09:09.284020+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRSHGTZB","created_at":"2026-07-05T10:09:09.284020+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05294","citing_title":"Polynomial Initial-State Jumps and Christoffel Transforms in Krylov Complexity","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2606.23785","citing_title":"Controlled Chaos in 4D SCFTs","ref_index":56,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00074","citing_title":"Holographic Spread Complexity from Branes and Strings","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2506.07257","citing_title":"A Quantum Computational Perspective on Spread Complexity","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07432","citing_title":"Holographic Krylov Complexity for Charged, Composite and Extended Probes","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07668","citing_title":"Bridging Krylov Complexity and Universal Analog Quantum Simulator","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SRSHGTZBXNOKFIXVA2IE4LL7NB","json":"https://pith.science/pith/SRSHGTZBXNOKFIXVA2IE4LL7NB.json","graph_json":"https://pith.science/api/pith-number/SRSHGTZBXNOKFIXVA2IE4LL7NB/graph.json","events_json":"https://pith.science/api/pith-number/SRSHGTZBXNOKFIXVA2IE4LL7NB/events.json","paper":"https://pith.science/paper/SRSHGTZB"},"agent_actions":{"view_html":"https://pith.science/pith/SRSHGTZBXNOKFIXVA2IE4LL7NB","download_json":"https://pith.science/pith/SRSHGTZBXNOKFIXVA2IE4LL7NB.json","view_paper":"https://pith.science/paper/SRSHGTZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.15666&json=true","fetch_graph":"https://pith.science/api/pith-number/SRSHGTZBXNOKFIXVA2IE4LL7NB/graph.json","fetch_events":"https://pith.science/api/pith-number/SRSHGTZBXNOKFIXVA2IE4LL7NB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRSHGTZBXNOKFIXVA2IE4LL7NB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRSHGTZBXNOKFIXVA2IE4LL7NB/action/storage_attestation","attest_author":"https://pith.science/pith/SRSHGTZBXNOKFIXVA2IE4LL7NB/action/author_attestation","sign_citation":"https://pith.science/pith/SRSHGTZBXNOKFIXVA2IE4LL7NB/action/citation_signature","submit_replication":"https://pith.science/pith/SRSHGTZBXNOKFIXVA2IE4LL7NB/action/replication_record"}},"created_at":"2026-07-05T10:09:09.284020+00:00","updated_at":"2026-07-05T10:09:09.284020+00:00"}