{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MJFS6UNEOB6RTBXVC6QG7KC6ZL","short_pith_number":"pith:MJFS6UNE","schema_version":"1.0","canonical_sha256":"624b2f51a4707d1986f517a06fa85ecaf2b62a710534f902aa7bc47f6401ce98","source":{"kind":"arxiv","id":"1608.08704","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Christoph Berkholz, Jakob Nordstr\\\"om","submitted_at":"2016-08-31T01:58:56Z","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 "},"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":"1608.08704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-31T01:58:56Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"eb5960c9596d175c94c1d468d063c7e886c7c387315b59feaccd8347ffa8300a","abstract_canon_sha256":"43773b237b48b9bb38bf86ad52cced91527b182f198a7fb22378a7e755f6f904"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:28.284585Z","signature_b64":"hsd4+dvTaiDFjR9+F/kCfbfJput8nV796icR80cqZP9rGRJJAA1O1W/0AxQT7lOn0N0Sj0+bh7L0sO77gM5rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"624b2f51a4707d1986f517a06fa85ecaf2b62a710534f902aa7bc47f6401ce98","last_reissued_at":"2026-05-18T01:06:28.284032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:28.284032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Christoph Berkholz, Jakob Nordstr\\\"om","submitted_at":"2016-08-31T01:58:56Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08704","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":""},"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":"1608.08704","created_at":"2026-05-18T01:06:28.284113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08704v2","created_at":"2026-05-18T01:06:28.284113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08704","created_at":"2026-05-18T01:06:28.284113+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJFS6UNEOB6R","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJFS6UNEOB6RTBXV","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJFS6UNE","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJFS6UNEOB6RTBXVC6QG7KC6ZL","json":"https://pith.science/pith/MJFS6UNEOB6RTBXVC6QG7KC6ZL.json","graph_json":"https://pith.science/api/pith-number/MJFS6UNEOB6RTBXVC6QG7KC6ZL/graph.json","events_json":"https://pith.science/api/pith-number/MJFS6UNEOB6RTBXVC6QG7KC6ZL/events.json","paper":"https://pith.science/paper/MJFS6UNE"},"agent_actions":{"view_html":"https://pith.science/pith/MJFS6UNEOB6RTBXVC6QG7KC6ZL","download_json":"https://pith.science/pith/MJFS6UNEOB6RTBXVC6QG7KC6ZL.json","view_paper":"https://pith.science/paper/MJFS6UNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08704&json=true","fetch_graph":"https://pith.science/api/pith-number/MJFS6UNEOB6RTBXVC6QG7KC6ZL/graph.json","fetch_events":"https://pith.science/api/pith-number/MJFS6UNEOB6RTBXVC6QG7KC6ZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJFS6UNEOB6RTBXVC6QG7KC6ZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJFS6UNEOB6RTBXVC6QG7KC6ZL/action/storage_attestation","attest_author":"https://pith.science/pith/MJFS6UNEOB6RTBXVC6QG7KC6ZL/action/author_attestation","sign_citation":"https://pith.science/pith/MJFS6UNEOB6RTBXVC6QG7KC6ZL/action/citation_signature","submit_replication":"https://pith.science/pith/MJFS6UNEOB6RTBXVC6QG7KC6ZL/action/replication_record"}},"created_at":"2026-05-18T01:06:28.284113+00:00","updated_at":"2026-05-18T01:06:28.284113+00:00"}