{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YYVTANNGBK3SA2MF7YBGUSXFDT","short_pith_number":"pith:YYVTANNG","schema_version":"1.0","canonical_sha256":"c62b3035a60ab7206985fe026a4ae51cc6e5504a4cbef91dfa6d5250145ebec8","source":{"kind":"arxiv","id":"1902.05533","version":1},"attestation_state":"computed","paper":{"title":"Quantifier alternation in a class of recursively defined tree properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Moumanti Podder","submitted_at":"2019-02-14T18:26:00Z","abstract_excerpt":"Alternating quantifier depth is a natural measure of difficulty required to express first order logical sentences. We define a sequence of first order properties on rooted, locally finite trees in a recursive manner, and provide rigorous arguments for finding the alternating quantifier depth of each property in the sequence, using Ehrenfeucht-Fra\\\"{i}ss\\'{e} games."},"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":"1902.05533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-02-14T18:26:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bddd589025f7374e2d9afc9bad9e34c4ffeff69a393afbdddbba11bfad5d6b4b","abstract_canon_sha256":"4a51e3c1edbbd7b041dd8dc17e3a2d8fff02ea4da7107a0f0859f644a338f0c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:58.450770Z","signature_b64":"MMsi/YicmQWVDDt8TZic0DreQiX+byxKfowkixHg3ZSkMWYrRriECXbh2oZx5wCQl7WUGaac34si+T1teAakDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c62b3035a60ab7206985fe026a4ae51cc6e5504a4cbef91dfa6d5250145ebec8","last_reissued_at":"2026-05-17T23:53:58.450085Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:58.450085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantifier alternation in a class of recursively defined tree properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Moumanti Podder","submitted_at":"2019-02-14T18:26:00Z","abstract_excerpt":"Alternating quantifier depth is a natural measure of difficulty required to express first order logical sentences. We define a sequence of first order properties on rooted, locally finite trees in a recursive manner, and provide rigorous arguments for finding the alternating quantifier depth of each property in the sequence, using Ehrenfeucht-Fra\\\"{i}ss\\'{e} games."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05533","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.05533","created_at":"2026-05-17T23:53:58.450188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05533v1","created_at":"2026-05-17T23:53:58.450188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05533","created_at":"2026-05-17T23:53:58.450188+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYVTANNGBK3S","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYVTANNGBK3SA2MF","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYVTANNG","created_at":"2026-05-18T12:33:33.725879+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/YYVTANNGBK3SA2MF7YBGUSXFDT","json":"https://pith.science/pith/YYVTANNGBK3SA2MF7YBGUSXFDT.json","graph_json":"https://pith.science/api/pith-number/YYVTANNGBK3SA2MF7YBGUSXFDT/graph.json","events_json":"https://pith.science/api/pith-number/YYVTANNGBK3SA2MF7YBGUSXFDT/events.json","paper":"https://pith.science/paper/YYVTANNG"},"agent_actions":{"view_html":"https://pith.science/pith/YYVTANNGBK3SA2MF7YBGUSXFDT","download_json":"https://pith.science/pith/YYVTANNGBK3SA2MF7YBGUSXFDT.json","view_paper":"https://pith.science/paper/YYVTANNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05533&json=true","fetch_graph":"https://pith.science/api/pith-number/YYVTANNGBK3SA2MF7YBGUSXFDT/graph.json","fetch_events":"https://pith.science/api/pith-number/YYVTANNGBK3SA2MF7YBGUSXFDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYVTANNGBK3SA2MF7YBGUSXFDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYVTANNGBK3SA2MF7YBGUSXFDT/action/storage_attestation","attest_author":"https://pith.science/pith/YYVTANNGBK3SA2MF7YBGUSXFDT/action/author_attestation","sign_citation":"https://pith.science/pith/YYVTANNGBK3SA2MF7YBGUSXFDT/action/citation_signature","submit_replication":"https://pith.science/pith/YYVTANNGBK3SA2MF7YBGUSXFDT/action/replication_record"}},"created_at":"2026-05-17T23:53:58.450188+00:00","updated_at":"2026-05-17T23:53:58.450188+00:00"}