{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F4IKHZXDHBPXPFANMNP5WYOILA","short_pith_number":"pith:F4IKHZXD","canonical_record":{"source":{"id":"1805.08215","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2018-05-21T18:00:01Z","cross_cats_sorted":["cond-mat.stat-mech","hep-th","quant-ph"],"title_canon_sha256":"45e63be5997fb963c93a9b172edd6f834cf71db8c7ee72ec75b4087be76e2e68","abstract_canon_sha256":"99797d454b838838135d24cd202f5b3ea30f183c5b0c27569945e616550a0071"},"schema_version":"1.0"},"canonical_sha256":"2f10a3e6e3385f77940d635fdb61c8582b7b0c16117da7bb06b9caeac54b4f42","source":{"kind":"arxiv","id":"1805.08215","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08215","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08215v3","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08215","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"F4IKHZXDHBPX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F4IKHZXDHBPXPFAN","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F4IKHZXD","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F4IKHZXDHBPXPFANMNP5WYOILA","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08215","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2018-05-21T18:00:01Z","cross_cats_sorted":["cond-mat.stat-mech","hep-th","quant-ph"],"title_canon_sha256":"45e63be5997fb963c93a9b172edd6f834cf71db8c7ee72ec75b4087be76e2e68","abstract_canon_sha256":"99797d454b838838135d24cd202f5b3ea30f183c5b0c27569945e616550a0071"},"schema_version":"1.0"},"canonical_sha256":"2f10a3e6e3385f77940d635fdb61c8582b7b0c16117da7bb06b9caeac54b4f42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:33.596139Z","signature_b64":"QbXgPh+c4bgNSaQG5Lo21yPzpI9yGomNpkTT9dbzrdr5ywjmD/lykDDQkZUhIyr1w47hy7yfbozxGOxKxO+xDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f10a3e6e3385f77940d635fdb61c8582b7b0c16117da7bb06b9caeac54b4f42","last_reissued_at":"2026-05-17T23:49:33.595613Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:33.595613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08215","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gu4XtgyCwDDEUP78sceDVa5iHX8AfT5kfU9LtDStx/nRqH+zrkbY8ZLdTe2izWtaQKHGXUx5TQFyLuxyqK2YAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T19:25:47.566194Z"},"content_sha256":"c40533e3a8e8dbbbc2bbeb0dc9df194fea191c5be559996c72c2af4570a94a30","schema_version":"1.0","event_id":"sha256:c40533e3a8e8dbbbc2bbeb0dc9df194fea191c5be559996c72c2af4570a94a30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F4IKHZXDHBPXPFANMNP5WYOILA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast scrambling on sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","hep-th","quant-ph"],"primary_cat":"cond-mat.str-el","authors_text":"Andrew Lucas, Gregory Bentsen, Yingfei Gu","submitted_at":"2018-05-21T18:00:01Z","abstract_excerpt":"Given a quantum many-body system with few-body interactions, how rapidly can quantum information be hidden during time evolution? The fast scrambling conjecture is that the time to thoroughly mix information among N degrees of freedom grows at least logarithmically in N. We derive this inequality for generic quantum systems at infinite temperature, bounding the scrambling time by a finite decay time of local quantum correlations at late times. Using Lieb-Robinson bounds, generalized Sachdev-Ye-Kitaev models, and random unitary circuits, we propose that a logarithmic scrambling time can be achi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08215","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkOmNy8evXWGrVIqiIgEn+JBi792NiPcCAw/QbYQ6oUkEVKfCsfSUpBFcf+HiiSrwqO+/quT4dniCqZsLyBBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T19:25:47.566753Z"},"content_sha256":"cedbeb5569ba542d4e34b025023fc66299123b3790a55e7c8476a563ca59147c","schema_version":"1.0","event_id":"sha256:cedbeb5569ba542d4e34b025023fc66299123b3790a55e7c8476a563ca59147c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4IKHZXDHBPXPFANMNP5WYOILA/bundle.json","state_url":"https://pith.science/pith/F4IKHZXDHBPXPFANMNP5WYOILA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4IKHZXDHBPXPFANMNP5WYOILA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-02T19:25:47Z","links":{"resolver":"https://pith.science/pith/F4IKHZXDHBPXPFANMNP5WYOILA","bundle":"https://pith.science/pith/F4IKHZXDHBPXPFANMNP5WYOILA/bundle.json","state":"https://pith.science/pith/F4IKHZXDHBPXPFANMNP5WYOILA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4IKHZXDHBPXPFANMNP5WYOILA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F4IKHZXDHBPXPFANMNP5WYOILA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"99797d454b838838135d24cd202f5b3ea30f183c5b0c27569945e616550a0071","cross_cats_sorted":["cond-mat.stat-mech","hep-th","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2018-05-21T18:00:01Z","title_canon_sha256":"45e63be5997fb963c93a9b172edd6f834cf71db8c7ee72ec75b4087be76e2e68"},"schema_version":"1.0","source":{"id":"1805.08215","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08215","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08215v3","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08215","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"F4IKHZXDHBPX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F4IKHZXDHBPXPFAN","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F4IKHZXD","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:cedbeb5569ba542d4e34b025023fc66299123b3790a55e7c8476a563ca59147c","target":"graph","created_at":"2026-05-17T23:49:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Given a quantum many-body system with few-body interactions, how rapidly can quantum information be hidden during time evolution? The fast scrambling conjecture is that the time to thoroughly mix information among N degrees of freedom grows at least logarithmically in N. We derive this inequality for generic quantum systems at infinite temperature, bounding the scrambling time by a finite decay time of local quantum correlations at late times. Using Lieb-Robinson bounds, generalized Sachdev-Ye-Kitaev models, and random unitary circuits, we propose that a logarithmic scrambling time can be achi","authors_text":"Andrew Lucas, Gregory Bentsen, Yingfei Gu","cross_cats":["cond-mat.stat-mech","hep-th","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2018-05-21T18:00:01Z","title":"Fast scrambling on sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08215","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c40533e3a8e8dbbbc2bbeb0dc9df194fea191c5be559996c72c2af4570a94a30","target":"record","created_at":"2026-05-17T23:49:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"99797d454b838838135d24cd202f5b3ea30f183c5b0c27569945e616550a0071","cross_cats_sorted":["cond-mat.stat-mech","hep-th","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2018-05-21T18:00:01Z","title_canon_sha256":"45e63be5997fb963c93a9b172edd6f834cf71db8c7ee72ec75b4087be76e2e68"},"schema_version":"1.0","source":{"id":"1805.08215","kind":"arxiv","version":3}},"canonical_sha256":"2f10a3e6e3385f77940d635fdb61c8582b7b0c16117da7bb06b9caeac54b4f42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f10a3e6e3385f77940d635fdb61c8582b7b0c16117da7bb06b9caeac54b4f42","first_computed_at":"2026-05-17T23:49:33.595613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:33.595613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QbXgPh+c4bgNSaQG5Lo21yPzpI9yGomNpkTT9dbzrdr5ywjmD/lykDDQkZUhIyr1w47hy7yfbozxGOxKxO+xDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:33.596139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08215","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c40533e3a8e8dbbbc2bbeb0dc9df194fea191c5be559996c72c2af4570a94a30","sha256:cedbeb5569ba542d4e34b025023fc66299123b3790a55e7c8476a563ca59147c"],"state_sha256":"3efb7c8cdb49596adc26339d679513112ed8242006fde1062b34713cabe69d43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"di1AaM8qpnRW3KUJ91AVS8Vb4QBiYYmhOgABdmtMp9XEueSLW9beSHWA4EFfsc9aS097PHv3K/yCOjsVdZHOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T19:25:47.571897Z","bundle_sha256":"5e38b30ac856b26d96d9884e0389398487acef3a008b70c6932a7d3866b3b128"}}