{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GEJ7MGBMSXKS5ZUD2AGCNR3MFS","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":"1bc96024c0bce42e3c5c2d1f404b0d181e74ea0725fd30f7379853577fe4c9f0","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-01-13T17:57:02Z","title_canon_sha256":"f93d8f5f2ad71ee7710b95f31042dd73191d01199d6e66618c6b0efd3e4c2356"},"schema_version":"1.0","source":{"id":"2301.05680","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.05680","created_at":"2026-07-05T06:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"2301.05680v2","created_at":"2026-07-05T06:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05680","created_at":"2026-07-05T06:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"GEJ7MGBMSXKS","created_at":"2026-07-05T06:27:44Z"},{"alias_kind":"pith_short_16","alias_value":"GEJ7MGBMSXKS5ZUD","created_at":"2026-07-05T06:27:44Z"},{"alias_kind":"pith_short_8","alias_value":"GEJ7MGBM","created_at":"2026-07-05T06:27:44Z"}],"graph_snapshots":[{"event_id":"sha256:631f4c8736c62ae3f911b2b421b55356743c476227051f336bcf25778c610cec","target":"graph","created_at":"2026-07-05T06:27:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.05680/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cumulative memory -- the sum of space used per step over the duration of a computation -- is a fine-grained measure of time-space complexity that was introduced to analyze cryptographic applications like password hashing. It is a more accurate cost measure for algorithms that have infrequent spikes in memory usage and are run in environments such as cloud computing that allow dynamic allocation and de-allocation of resources during execution, or when many multiple instances of an algorithm are interleaved in parallel.\n  We prove the first lower bounds on cumulative memory complexity for both s","authors_text":"Niels Kornerup, Paul Beame","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-01-13T17:57:02Z","title":"Cumulative Memory Lower Bounds for Randomized and Quantum Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05680","kind":"arxiv","version":2},"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:269c30ce19ec4305faba25c131fc0261bb3b34b4ec36fe1ea761151a9ea9c6f3","target":"record","created_at":"2026-07-05T06:27:44Z","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":"1bc96024c0bce42e3c5c2d1f404b0d181e74ea0725fd30f7379853577fe4c9f0","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-01-13T17:57:02Z","title_canon_sha256":"f93d8f5f2ad71ee7710b95f31042dd73191d01199d6e66618c6b0efd3e4c2356"},"schema_version":"1.0","source":{"id":"2301.05680","kind":"arxiv","version":2}},"canonical_sha256":"3113f6182c95d52ee683d00c26c76c2cb0026036eea4bd49606d55a200161008","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3113f6182c95d52ee683d00c26c76c2cb0026036eea4bd49606d55a200161008","first_computed_at":"2026-07-05T06:27:44.903047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:27:44.903047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bQ/4gQLPVq42sgMQN5uQYz9Pciv8C0xQejspPRDmQI2XddS8n5FKFHHdXjnF9ut0OIYue0rqo/1S0oIf8PLzCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:27:44.903571Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.05680","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:269c30ce19ec4305faba25c131fc0261bb3b34b4ec36fe1ea761151a9ea9c6f3","sha256:631f4c8736c62ae3f911b2b421b55356743c476227051f336bcf25778c610cec"],"state_sha256":"a28f9cb28e08c62b9de5fcbce4d02b6b8f700d8ddb79fa18076d46e6554fcf9c"}