{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MJFS6UNEOB6RTBXVC6QG7KC6ZL","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":"43773b237b48b9bb38bf86ad52cced91527b182f198a7fb22378a7e755f6f904","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-31T01:58:56Z","title_canon_sha256":"eb5960c9596d175c94c1d468d063c7e886c7c387315b59feaccd8347ffa8300a"},"schema_version":"1.0","source":{"id":"1608.08704","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08704","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08704v2","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08704","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"MJFS6UNEOB6R","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MJFS6UNEOB6RTBXV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MJFS6UNE","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:59728f75639eabf30ec1fbb83969678b04c0f6b34a9cbc3a3c6d58dde346572d","target":"graph","created_at":"2026-05-18T01:06:28Z","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":"We prove near-optimal trade-offs for quantifier depth versus number of variables in first-order logic by exhibiting pairs of $n$-element structures that can be distinguished by a $k$-variable first-order sentence but where every such sentence requires quantifier depth at least $n^{\\Omega(k/\\log k)}$. Our trade-offs also apply to first-order counting logic, and by the known connection to the $k$-dimensional Weisfeiler--Leman algorithm imply near-optimal lower bounds on the number of refinement iterations.\n  A key component in our proof is the hardness condensation technique recently introduced ","authors_text":"Christoph Berkholz, Jakob Nordstr\\\"om","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-31T01:58:56Z","title":"Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08704","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:553c654efd020cbde4f7be7687b4d1ca47698b149c6e8c046b694d63e1192d36","target":"record","created_at":"2026-05-18T01:06:28Z","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":"43773b237b48b9bb38bf86ad52cced91527b182f198a7fb22378a7e755f6f904","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-31T01:58:56Z","title_canon_sha256":"eb5960c9596d175c94c1d468d063c7e886c7c387315b59feaccd8347ffa8300a"},"schema_version":"1.0","source":{"id":"1608.08704","kind":"arxiv","version":2}},"canonical_sha256":"624b2f51a4707d1986f517a06fa85ecaf2b62a710534f902aa7bc47f6401ce98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"624b2f51a4707d1986f517a06fa85ecaf2b62a710534f902aa7bc47f6401ce98","first_computed_at":"2026-05-18T01:06:28.284032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:28.284032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hsd4+dvTaiDFjR9+F/kCfbfJput8nV796icR80cqZP9rGRJJAA1O1W/0AxQT7lOn0N0Sj0+bh7L0sO77gM5rDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:28.284585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08704","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:553c654efd020cbde4f7be7687b4d1ca47698b149c6e8c046b694d63e1192d36","sha256:59728f75639eabf30ec1fbb83969678b04c0f6b34a9cbc3a3c6d58dde346572d"],"state_sha256":"41ae43cbb20a4f97e18d1e8584de52daf71254b4440a870961117675a65ee4f1"}