{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UKNUIFXWS6FBHQCEOXDCDCM3T7","short_pith_number":"pith:UKNUIFXW","schema_version":"1.0","canonical_sha256":"a29b4416f6978a13c04475c621899b9fd8ed726a42a3d7018e4030d222f85da9","source":{"kind":"arxiv","id":"1905.03682","version":2},"attestation_state":"computed","paper":{"title":"Operator growth bounds from graph theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th","math.MP","quant-ph"],"primary_cat":"math-ph","authors_text":"Andrew Lucas, Chi-Fang Chen","submitted_at":"2019-05-09T15:17:19Z","abstract_excerpt":"Let $A$ and $B$ be local operators in Hamiltonian quantum systems with $N $ degrees of freedom and finite-dimensional Hilbert space. We prove that the commutator norm $\\lVert [A(t),B]\\rVert$ is upper bounded by a topological combinatorial problem: counting irreducible weighted paths between two points on the Hamiltonian's factor graph. Our bounds sharpen existing Lieb-Robinson bounds by removing extraneous growth. In quantum systems drawn from zero-mean random ensembles with few-body interactions, we prove stronger bounds on the ensemble-averaged out-of-time-ordered correlator $\\mathbb{E}\\left"},"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":"1905.03682","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2019-05-09T15:17:19Z","cross_cats_sorted":["hep-th","math.MP","quant-ph"],"title_canon_sha256":"bcf7eff064d2ebc40e8fc853076b2a3bf67875ac7e924073f0d961c2dc365670","abstract_canon_sha256":"6ab69b772248d72ddcaf466b924bccb888c221bc7a6bea9add9e32731bd31abe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:57:48.695889Z","signature_b64":"9SI5KXSUB/hIMdV6rQDaV0OoBm3dznMz00T8zKTHCSKj1l1IYiJgk8qcVtmwDEMUubkuv5nHmIuGaaIdsfb9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a29b4416f6978a13c04475c621899b9fd8ed726a42a3d7018e4030d222f85da9","last_reissued_at":"2026-07-05T02:57:48.695432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:57:48.695432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Operator growth bounds from graph theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th","math.MP","quant-ph"],"primary_cat":"math-ph","authors_text":"Andrew Lucas, Chi-Fang Chen","submitted_at":"2019-05-09T15:17:19Z","abstract_excerpt":"Let $A$ and $B$ be local operators in Hamiltonian quantum systems with $N $ degrees of freedom and finite-dimensional Hilbert space. We prove that the commutator norm $\\lVert [A(t),B]\\rVert$ is upper bounded by a topological combinatorial problem: counting irreducible weighted paths between two points on the Hamiltonian's factor graph. Our bounds sharpen existing Lieb-Robinson bounds by removing extraneous growth. In quantum systems drawn from zero-mean random ensembles with few-body interactions, we prove stronger bounds on the ensemble-averaged out-of-time-ordered correlator $\\mathbb{E}\\left"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03682","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/1905.03682/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":"1905.03682","created_at":"2026-07-05T02:57:48.695488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03682v2","created_at":"2026-07-05T02:57:48.695488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03682","created_at":"2026-07-05T02:57:48.695488+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKNUIFXWS6FB","created_at":"2026-07-05T02:57:48.695488+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKNUIFXWS6FBHQCE","created_at":"2026-07-05T02:57:48.695488+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKNUIFXW","created_at":"2026-07-05T02:57:48.695488+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07668","citing_title":"Bridging Krylov Complexity and Universal Analog Quantum Simulator","ref_index":77,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UKNUIFXWS6FBHQCEOXDCDCM3T7","json":"https://pith.science/pith/UKNUIFXWS6FBHQCEOXDCDCM3T7.json","graph_json":"https://pith.science/api/pith-number/UKNUIFXWS6FBHQCEOXDCDCM3T7/graph.json","events_json":"https://pith.science/api/pith-number/UKNUIFXWS6FBHQCEOXDCDCM3T7/events.json","paper":"https://pith.science/paper/UKNUIFXW"},"agent_actions":{"view_html":"https://pith.science/pith/UKNUIFXWS6FBHQCEOXDCDCM3T7","download_json":"https://pith.science/pith/UKNUIFXWS6FBHQCEOXDCDCM3T7.json","view_paper":"https://pith.science/paper/UKNUIFXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03682&json=true","fetch_graph":"https://pith.science/api/pith-number/UKNUIFXWS6FBHQCEOXDCDCM3T7/graph.json","fetch_events":"https://pith.science/api/pith-number/UKNUIFXWS6FBHQCEOXDCDCM3T7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKNUIFXWS6FBHQCEOXDCDCM3T7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKNUIFXWS6FBHQCEOXDCDCM3T7/action/storage_attestation","attest_author":"https://pith.science/pith/UKNUIFXWS6FBHQCEOXDCDCM3T7/action/author_attestation","sign_citation":"https://pith.science/pith/UKNUIFXWS6FBHQCEOXDCDCM3T7/action/citation_signature","submit_replication":"https://pith.science/pith/UKNUIFXWS6FBHQCEOXDCDCM3T7/action/replication_record"}},"created_at":"2026-07-05T02:57:48.695488+00:00","updated_at":"2026-07-05T02:57:48.695488+00:00"}