{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:C44O4AMJG3LKUE2JURGL5IYRGJ","short_pith_number":"pith:C44O4AMJ","canonical_record":{"source":{"id":"1212.2747","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-12T09:43:17Z","cross_cats_sorted":[],"title_canon_sha256":"13d4e109fe765f1b12f7b604199d995cda0077bff07a3692999af51bfab6a27c","abstract_canon_sha256":"85ddaec363340c22e48b9d22ee2f87db3ae796e7047d76bf6b18df7f3d6dc3e7"},"schema_version":"1.0"},"canonical_sha256":"1738ee018936d6aa1349a44cbea311324fdb8de80e153d4bf0befae1bc8456de","source":{"kind":"arxiv","id":"1212.2747","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2747","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2747v4","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2747","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"C44O4AMJG3LK","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C44O4AMJG3LKUE2J","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C44O4AMJ","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:C44O4AMJG3LKUE2JURGL5IYRGJ","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2747","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-12T09:43:17Z","cross_cats_sorted":[],"title_canon_sha256":"13d4e109fe765f1b12f7b604199d995cda0077bff07a3692999af51bfab6a27c","abstract_canon_sha256":"85ddaec363340c22e48b9d22ee2f87db3ae796e7047d76bf6b18df7f3d6dc3e7"},"schema_version":"1.0"},"canonical_sha256":"1738ee018936d6aa1349a44cbea311324fdb8de80e153d4bf0befae1bc8456de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:28.957729Z","signature_b64":"L/QssCv+S1mkFV9JtdTkq6npS9rBG6h/WrfdfCtnEUNJb7y5h8AZXWPHWEEuyHvG+7Ms0zp25SGIVQ3y8OHyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1738ee018936d6aa1349a44cbea311324fdb8de80e153d4bf0befae1bc8456de","last_reissued_at":"2026-05-18T03:16:28.957129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:28.957129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2747","source_version":4,"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-18T03:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P49FXAXNxm4WGq1pyRZZm3uUI//KVzxQjxqqgIoL2eL/1wwlYyjTNzg86RUc3+V09IOlf0v1M42vp4ODOQ/KDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:20:24.857979Z"},"content_sha256":"5936196ca6fb8ea78b3790909e2355c2e831a8ec1688f6a727905d814b6a5d83","schema_version":"1.0","event_id":"sha256:5936196ca6fb8ea78b3790909e2355c2e831a8ec1688f6a727905d814b6a5d83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:C44O4AMJG3LKUE2JURGL5IYRGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Krebs, Christoph Berkholz, Oleg Verbitsky","submitted_at":"2012-12-12T09:43:17Z","abstract_excerpt":"Given two structures $G$ and $H$ distinguishable in $\\fo k$ (first-order logic with $k$ variables), let $A^k(G,H)$ denote the minimum alternation depth of a $\\fo k$ formula distinguishing $G$ from $H$. Let $A^k(n)$ be the maximum value of $A^k(G,H)$ over $n$-element structures. We prove the strictness of the quantifier alternation hierarchy of $\\fo 2$ in a strong quantitative form, namely $A^2(n)\\ge n/8-2$, which is tight up to a constant factor. For each $k\\ge2$, it holds that $A^k(n)>\\log_{k+1}n-2$ even over colored trees, which is also tight up to a constant factor if $k\\ge3$. For $k\\ge 3$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2747","kind":"arxiv","version":4},"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-18T03:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vK9UgGxfWIl2yJiA3U8tlh4iSFyBNmg+5VYrJMDP+1et9XEvs06dS5XVSH0m0YTwxZZmIWi6w0qKSNl3XcCiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:20:24.858645Z"},"content_sha256":"24422fc144d781f872ab817bad00c010bea61ac75a9a15b5e67a1cf68088fdfd","schema_version":"1.0","event_id":"sha256:24422fc144d781f872ab817bad00c010bea61ac75a9a15b5e67a1cf68088fdfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C44O4AMJG3LKUE2JURGL5IYRGJ/bundle.json","state_url":"https://pith.science/pith/C44O4AMJG3LKUE2JURGL5IYRGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C44O4AMJG3LKUE2JURGL5IYRGJ/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-05-25T20:20:24Z","links":{"resolver":"https://pith.science/pith/C44O4AMJG3LKUE2JURGL5IYRGJ","bundle":"https://pith.science/pith/C44O4AMJG3LKUE2JURGL5IYRGJ/bundle.json","state":"https://pith.science/pith/C44O4AMJG3LKUE2JURGL5IYRGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C44O4AMJG3LKUE2JURGL5IYRGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:C44O4AMJG3LKUE2JURGL5IYRGJ","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":"85ddaec363340c22e48b9d22ee2f87db3ae796e7047d76bf6b18df7f3d6dc3e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-12T09:43:17Z","title_canon_sha256":"13d4e109fe765f1b12f7b604199d995cda0077bff07a3692999af51bfab6a27c"},"schema_version":"1.0","source":{"id":"1212.2747","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2747","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2747v4","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2747","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"C44O4AMJG3LK","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C44O4AMJG3LKUE2J","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C44O4AMJ","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:24422fc144d781f872ab817bad00c010bea61ac75a9a15b5e67a1cf68088fdfd","target":"graph","created_at":"2026-05-18T03:16: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":"Given two structures $G$ and $H$ distinguishable in $\\fo k$ (first-order logic with $k$ variables), let $A^k(G,H)$ denote the minimum alternation depth of a $\\fo k$ formula distinguishing $G$ from $H$. Let $A^k(n)$ be the maximum value of $A^k(G,H)$ over $n$-element structures. We prove the strictness of the quantifier alternation hierarchy of $\\fo 2$ in a strong quantitative form, namely $A^2(n)\\ge n/8-2$, which is tight up to a constant factor. For each $k\\ge2$, it holds that $A^k(n)>\\log_{k+1}n-2$ even over colored trees, which is also tight up to a constant factor if $k\\ge3$. For $k\\ge 3$ ","authors_text":"Andreas Krebs, Christoph Berkholz, Oleg Verbitsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-12T09:43:17Z","title":"Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2747","kind":"arxiv","version":4},"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:5936196ca6fb8ea78b3790909e2355c2e831a8ec1688f6a727905d814b6a5d83","target":"record","created_at":"2026-05-18T03:16: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":"85ddaec363340c22e48b9d22ee2f87db3ae796e7047d76bf6b18df7f3d6dc3e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-12T09:43:17Z","title_canon_sha256":"13d4e109fe765f1b12f7b604199d995cda0077bff07a3692999af51bfab6a27c"},"schema_version":"1.0","source":{"id":"1212.2747","kind":"arxiv","version":4}},"canonical_sha256":"1738ee018936d6aa1349a44cbea311324fdb8de80e153d4bf0befae1bc8456de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1738ee018936d6aa1349a44cbea311324fdb8de80e153d4bf0befae1bc8456de","first_computed_at":"2026-05-18T03:16:28.957129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:28.957129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L/QssCv+S1mkFV9JtdTkq6npS9rBG6h/WrfdfCtnEUNJb7y5h8AZXWPHWEEuyHvG+7Ms0zp25SGIVQ3y8OHyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:28.957729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2747","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5936196ca6fb8ea78b3790909e2355c2e831a8ec1688f6a727905d814b6a5d83","sha256:24422fc144d781f872ab817bad00c010bea61ac75a9a15b5e67a1cf68088fdfd"],"state_sha256":"b61cf95813083e68a9352217e201af681ca4eece25bbb0be106144474b686733"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJJN9Y0Zz2Rk9ovoCfAE4qDhHsEGoeGy7rSLMTv04dMA0a0WUdv6M6oWRh7AvihiERlfWMevWmiyeR0DVzpqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:20:24.862856Z","bundle_sha256":"eb8c2c68cd8ea3f900bd8eed6e74702b3d8320e05c491665e5027dc1276787ec"}}