{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FRQYIIDYAFFVNCMXKGSD7KXY3U","short_pith_number":"pith:FRQYIIDY","canonical_record":{"source":{"id":"1009.2854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-09-15T07:15:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"45db24e8bdc68b50058b0c8ce37e68709d8d375abca83b3c8e9073ff9f2cc21d","abstract_canon_sha256":"f16e8f36f352b56f5cc23ed1c68226315e36ae89257d55507096861c772d5cc7"},"schema_version":"1.0"},"canonical_sha256":"2c61842078014b56899751a43faaf8dd0f517afd95d04f06ce481fa2195d2105","source":{"kind":"arxiv","id":"1009.2854","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2854","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2854v2","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2854","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"FRQYIIDYAFFV","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FRQYIIDYAFFVNCMX","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FRQYIIDY","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FRQYIIDYAFFVNCMXKGSD7KXY3U","target":"record","payload":{"canonical_record":{"source":{"id":"1009.2854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-09-15T07:15:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"45db24e8bdc68b50058b0c8ce37e68709d8d375abca83b3c8e9073ff9f2cc21d","abstract_canon_sha256":"f16e8f36f352b56f5cc23ed1c68226315e36ae89257d55507096861c772d5cc7"},"schema_version":"1.0"},"canonical_sha256":"2c61842078014b56899751a43faaf8dd0f517afd95d04f06ce481fa2195d2105","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.148470Z","signature_b64":"kGszYcrBu6Al1nA6h+aisgjG47AQf4Is1k9aPAQM0U094F0pukaToo0wamMFKPLYdqar37aYyIUEfcIRNnGWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c61842078014b56899751a43faaf8dd0f517afd95d04f06ce481fa2195d2105","last_reissued_at":"2026-05-17T23:51:24.147870Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.147870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.2854","source_version":2,"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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwaIkRBlaIGfrYa003+nLObnILf8vvjGR6gohObwpfES+aInP3+nns1RFiWVuzzl2hqep6G7SWeVP0kstQ4oDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:04:57.670561Z"},"content_sha256":"4819a185045aa7c37416f2bd46c3df84adb1f81c56c1b43c298691e031672cd9","schema_version":"1.0","event_id":"sha256:4819a185045aa7c37416f2bd46c3df84adb1f81c56c1b43c298691e031672cd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FRQYIIDYAFFVNCMXKGSD7KXY3U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree Languages Defined in First-Order Logic with One Quantifier Alternation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Luc Segoufin (INRIA), Mikolaj Bojanczyk (Warsaw University)","submitted_at":"2010-09-15T07:15:59Z","abstract_excerpt":"We study tree languages that can be defined in \\Delta_2 . These are tree languages definable by a first-order formula whose quantifier prefix is forall exists, and simultaneously by a first-order formula whose quantifier prefix is . For the quantifier free part we consider two signatures, either the descendant relation alone or together with the lexicographical order relation on nodes. We provide an effective characterization of tree and forest languages definable in \\Delta_2 . This characterization is in terms of algebraic equations. Over words, the class of word languages definable in \\Delta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2854","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"},"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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+6YItjrciMhICy0b/mTpRfY5mtomz1kqVFW68QewJQCZntSo//70KV81jxLaVbyDA9MOpj4EqnYWnBqZbhSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:04:57.670903Z"},"content_sha256":"ea91f4a786942320de58c69e4ae58b2c13473de9b40c15534d1258c4e88c4392","schema_version":"1.0","event_id":"sha256:ea91f4a786942320de58c69e4ae58b2c13473de9b40c15534d1258c4e88c4392"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRQYIIDYAFFVNCMXKGSD7KXY3U/bundle.json","state_url":"https://pith.science/pith/FRQYIIDYAFFVNCMXKGSD7KXY3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRQYIIDYAFFVNCMXKGSD7KXY3U/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-06-24T04:04:57Z","links":{"resolver":"https://pith.science/pith/FRQYIIDYAFFVNCMXKGSD7KXY3U","bundle":"https://pith.science/pith/FRQYIIDYAFFVNCMXKGSD7KXY3U/bundle.json","state":"https://pith.science/pith/FRQYIIDYAFFVNCMXKGSD7KXY3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRQYIIDYAFFVNCMXKGSD7KXY3U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FRQYIIDYAFFVNCMXKGSD7KXY3U","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":"f16e8f36f352b56f5cc23ed1c68226315e36ae89257d55507096861c772d5cc7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-09-15T07:15:59Z","title_canon_sha256":"45db24e8bdc68b50058b0c8ce37e68709d8d375abca83b3c8e9073ff9f2cc21d"},"schema_version":"1.0","source":{"id":"1009.2854","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2854","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2854v2","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2854","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"FRQYIIDYAFFV","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FRQYIIDYAFFVNCMX","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FRQYIIDY","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:ea91f4a786942320de58c69e4ae58b2c13473de9b40c15534d1258c4e88c4392","target":"graph","created_at":"2026-05-17T23:51:24Z","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 study tree languages that can be defined in \\Delta_2 . These are tree languages definable by a first-order formula whose quantifier prefix is forall exists, and simultaneously by a first-order formula whose quantifier prefix is . For the quantifier free part we consider two signatures, either the descendant relation alone or together with the lexicographical order relation on nodes. We provide an effective characterization of tree and forest languages definable in \\Delta_2 . This characterization is in terms of algebraic equations. Over words, the class of word languages definable in \\Delta","authors_text":"Luc Segoufin (INRIA), Mikolaj Bojanczyk (Warsaw University)","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-09-15T07:15:59Z","title":"Tree Languages Defined in First-Order Logic with One Quantifier Alternation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2854","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:4819a185045aa7c37416f2bd46c3df84adb1f81c56c1b43c298691e031672cd9","target":"record","created_at":"2026-05-17T23:51:24Z","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":"f16e8f36f352b56f5cc23ed1c68226315e36ae89257d55507096861c772d5cc7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-09-15T07:15:59Z","title_canon_sha256":"45db24e8bdc68b50058b0c8ce37e68709d8d375abca83b3c8e9073ff9f2cc21d"},"schema_version":"1.0","source":{"id":"1009.2854","kind":"arxiv","version":2}},"canonical_sha256":"2c61842078014b56899751a43faaf8dd0f517afd95d04f06ce481fa2195d2105","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c61842078014b56899751a43faaf8dd0f517afd95d04f06ce481fa2195d2105","first_computed_at":"2026-05-17T23:51:24.147870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:24.147870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kGszYcrBu6Al1nA6h+aisgjG47AQf4Is1k9aPAQM0U094F0pukaToo0wamMFKPLYdqar37aYyIUEfcIRNnGWBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:24.148470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2854","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4819a185045aa7c37416f2bd46c3df84adb1f81c56c1b43c298691e031672cd9","sha256:ea91f4a786942320de58c69e4ae58b2c13473de9b40c15534d1258c4e88c4392"],"state_sha256":"8f46f8b33ab8af27fcaf8164c12d500aeb3d4d6d8a89fd5da508dae0c50bdacd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWCdx+oqpPEX9usK/xOvndqx34BnLoFfsAuAfZZCfl4J5+3ngW78y14DFj3dl4o/iyzRLyMTlDKzHSFnjvDpDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:04:57.672832Z","bundle_sha256":"814618e9a505082ba401992085ab11a3ab7d4bdade10cbf2e6112142f070bfcc"}}