{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WWV3IN57SOVCLKKPUI37AGUKN7","short_pith_number":"pith:WWV3IN57","canonical_record":{"source":{"id":"1707.05696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-15T23:06:25Z","cross_cats_sorted":[],"title_canon_sha256":"8459ff3de6ec1de44afbb94d2ffed95cf674a704e4dfb8152b98bebe8dad03bd","abstract_canon_sha256":"a07bbc7049a61a0bfeb0f461af9b82a86e2acfb76eb0a0e27ac9cca0eb1c04f0"},"schema_version":"1.0"},"canonical_sha256":"b5abb437bf93aa25a94fa237f01a8a6fe6dfea1107300464b2d0ca99db577240","source":{"kind":"arxiv","id":"1707.05696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05696","created_at":"2026-05-18T00:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05696v1","created_at":"2026-05-18T00:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05696","created_at":"2026-05-18T00:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"WWV3IN57SOVC","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WWV3IN57SOVCLKKP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WWV3IN57","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WWV3IN57SOVCLKKPUI37AGUKN7","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-15T23:06:25Z","cross_cats_sorted":[],"title_canon_sha256":"8459ff3de6ec1de44afbb94d2ffed95cf674a704e4dfb8152b98bebe8dad03bd","abstract_canon_sha256":"a07bbc7049a61a0bfeb0f461af9b82a86e2acfb76eb0a0e27ac9cca0eb1c04f0"},"schema_version":"1.0"},"canonical_sha256":"b5abb437bf93aa25a94fa237f01a8a6fe6dfea1107300464b2d0ca99db577240","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:01.705360Z","signature_b64":"Sogu+UmNTdWq9qKqpYcPeHWJULFnApv5x3ksvdxUXLH0ri+a7In92pKbGx7iHaw0vqZaeYAW+ONKGL98lDZ6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5abb437bf93aa25a94fa237f01a8a6fe6dfea1107300464b2d0ca99db577240","last_reissued_at":"2026-05-18T00:40:01.704788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:01.704788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05696","source_version":1,"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-18T00:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOpCzYXAsdxlXVCu/ot1N4c+ECRu4cle4sVLcow7zSuS0CD2lydFQlZpIyOE2JH5rZdtNY11KBOoB6ba/bbHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:45:05.876093Z"},"content_sha256":"6ba2faa344e6047850a65bd373094fed3df035f86c3027ffed208a9b8583aa86","schema_version":"1.0","event_id":"sha256:6ba2faa344e6047850a65bd373094fed3df035f86c3027ffed208a9b8583aa86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WWV3IN57SOVCLKKPUI37AGUKN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Going Higher in First-Order Quantifier Alternation Hierarchies on Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Marc Zeitoun, Thomas Place","submitted_at":"2017-07-15T23:06:25Z","abstract_excerpt":"We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a regular language in the levels $\\mathcal{B}{\\Sigma}_2$ (finite boolean combinations of formulas having only one alternation) and ${\\Sigma}_3$ (formulas having only two alternations and beginning with an existential block). Our proofs work by considering a deeper problem, called separation, which, once solved for lower levels, allows us to solve membership for hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05696","kind":"arxiv","version":1},"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-18T00:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nan9gswhZp1AVjBTjiaho3uuIUDzuHIfjaoNy8O5tqdkg2cM6BOnl5tH7asWwsEOw6ofrLqBhHWGs8m4fgn+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:45:05.876746Z"},"content_sha256":"fc882cbc95322ca0671a7180695638ee8c8f7c9194bd1773ab1b3a539387cdca","schema_version":"1.0","event_id":"sha256:fc882cbc95322ca0671a7180695638ee8c8f7c9194bd1773ab1b3a539387cdca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWV3IN57SOVCLKKPUI37AGUKN7/bundle.json","state_url":"https://pith.science/pith/WWV3IN57SOVCLKKPUI37AGUKN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWV3IN57SOVCLKKPUI37AGUKN7/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-31T04:45:05Z","links":{"resolver":"https://pith.science/pith/WWV3IN57SOVCLKKPUI37AGUKN7","bundle":"https://pith.science/pith/WWV3IN57SOVCLKKPUI37AGUKN7/bundle.json","state":"https://pith.science/pith/WWV3IN57SOVCLKKPUI37AGUKN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWV3IN57SOVCLKKPUI37AGUKN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WWV3IN57SOVCLKKPUI37AGUKN7","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":"a07bbc7049a61a0bfeb0f461af9b82a86e2acfb76eb0a0e27ac9cca0eb1c04f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-15T23:06:25Z","title_canon_sha256":"8459ff3de6ec1de44afbb94d2ffed95cf674a704e4dfb8152b98bebe8dad03bd"},"schema_version":"1.0","source":{"id":"1707.05696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05696","created_at":"2026-05-18T00:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05696v1","created_at":"2026-05-18T00:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05696","created_at":"2026-05-18T00:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"WWV3IN57SOVC","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WWV3IN57SOVCLKKP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WWV3IN57","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:fc882cbc95322ca0671a7180695638ee8c8f7c9194bd1773ab1b3a539387cdca","target":"graph","created_at":"2026-05-18T00:40:01Z","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 investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a regular language in the levels $\\mathcal{B}{\\Sigma}_2$ (finite boolean combinations of formulas having only one alternation) and ${\\Sigma}_3$ (formulas having only two alternations and beginning with an existential block). Our proofs work by considering a deeper problem, called separation, which, once solved for lower levels, allows us to solve membership for hi","authors_text":"Marc Zeitoun, Thomas Place","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-15T23:06:25Z","title":"Going Higher in First-Order Quantifier Alternation Hierarchies on Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05696","kind":"arxiv","version":1},"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:6ba2faa344e6047850a65bd373094fed3df035f86c3027ffed208a9b8583aa86","target":"record","created_at":"2026-05-18T00:40:01Z","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":"a07bbc7049a61a0bfeb0f461af9b82a86e2acfb76eb0a0e27ac9cca0eb1c04f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-15T23:06:25Z","title_canon_sha256":"8459ff3de6ec1de44afbb94d2ffed95cf674a704e4dfb8152b98bebe8dad03bd"},"schema_version":"1.0","source":{"id":"1707.05696","kind":"arxiv","version":1}},"canonical_sha256":"b5abb437bf93aa25a94fa237f01a8a6fe6dfea1107300464b2d0ca99db577240","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5abb437bf93aa25a94fa237f01a8a6fe6dfea1107300464b2d0ca99db577240","first_computed_at":"2026-05-18T00:40:01.704788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:01.704788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sogu+UmNTdWq9qKqpYcPeHWJULFnApv5x3ksvdxUXLH0ri+a7In92pKbGx7iHaw0vqZaeYAW+ONKGL98lDZ6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:01.705360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ba2faa344e6047850a65bd373094fed3df035f86c3027ffed208a9b8583aa86","sha256:fc882cbc95322ca0671a7180695638ee8c8f7c9194bd1773ab1b3a539387cdca"],"state_sha256":"ead4bcd26da6cb27e20452e075ce820ed2188661ccdac2e1bdb9c4e42c575189"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+264rNT6o1xv31Uvxw9FzoZdaTN1tUoZvkQn5t+sE5oXm1TUCAijCVRb9n50/q5c1S/tb9yyB8ra0qQEYP53DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:45:05.879305Z","bundle_sha256":"b7a97ec8bef934e6d80bbb987fb87cc5b668c8e06e7a026024d4aeeb029a23cb"}}