{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4F2IXEAOUSWBPZUJYY44MA3EV5","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":"9bbd6a6708cd422969a71755a49874bf42c2f5afc2c5cbccc46bcf8065e0ac18","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-05-01T22:17:11Z","title_canon_sha256":"b43da1e16cd128b2d2199fbbb8c33928e3dbadac7c4bd35472205b94e5175cf9"},"schema_version":"1.0","source":{"id":"2505.00894","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.00894","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2505.00894v3","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00894","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"4F2IXEAOUSWB","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"4F2IXEAOUSWBPZUJ","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"4F2IXEAO","created_at":"2026-05-21T01:05:05Z"}],"graph_snapshots":[{"event_id":"sha256:cf3fcfaae0342eadd4e1f1e11b539fa81774b398db9fd3fb439003d6537086a8","target":"graph","created_at":"2026-05-21T01:05:05Z","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/2505.00894/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The power of adaptivity in algorithms has been intensively studied in diverse areas of theoretical computer science. In this paper, we obtain a number of sharp lower bound results which show that adaptivity provides a significant extra power in cryptanalytic time-space tradeoffs with (possibly unlimited) preprocessing time.\n  Most notably, we consider the discrete logarithm (DLOG) problem in a generic group of $N$ elements. The classical `baby-step giant-step' algorithm for the problem has time complexity $T=O(\\sqrt{N})$, uses $O(\\sqrt{N})$ bits of space (up to logarithmic factors in $N$) and ","authors_text":"Avichai Marmor, Itai Dinur, Nathan Keller","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-05-01T22:17:11Z","title":"Non-Adaptive Cryptanalytic Time-Space Lower Bounds via a Shearer-like Inequality for Permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00894","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:b56697fbb4aa607f9302ff525681980392bfdc6b32c27db7c39ee57e118d4a38","target":"record","created_at":"2026-05-21T01:05:05Z","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":"9bbd6a6708cd422969a71755a49874bf42c2f5afc2c5cbccc46bcf8065e0ac18","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-05-01T22:17:11Z","title_canon_sha256":"b43da1e16cd128b2d2199fbbb8c33928e3dbadac7c4bd35472205b94e5175cf9"},"schema_version":"1.0","source":{"id":"2505.00894","kind":"arxiv","version":3}},"canonical_sha256":"e1748b900ea4ac17e689c639c60364af6f3f5db0a2f25678c026bfe9d472cb41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1748b900ea4ac17e689c639c60364af6f3f5db0a2f25678c026bfe9d472cb41","first_computed_at":"2026-05-21T01:05:05.797475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:05.797475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QiaotHMiiNmACKSh/mVwJEyWpDfwVQEIOCzQO2ZtsIYukexclaIbp0WgYqRcokXGESw+bXIs0DXN94vuSaTCCA==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:05.798508Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.00894","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b56697fbb4aa607f9302ff525681980392bfdc6b32c27db7c39ee57e118d4a38","sha256:cf3fcfaae0342eadd4e1f1e11b539fa81774b398db9fd3fb439003d6537086a8"],"state_sha256":"c0173686ce8a76b716e32159be64425633185cfd659575798e421a953c916ccf"}