{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KDKV5BU26ICLJJBOVMWTWSHKGY","short_pith_number":"pith:KDKV5BU2","canonical_record":{"source":{"id":"1503.02840","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-10T10:02:21Z","cross_cats_sorted":["math.GN","math.LO"],"title_canon_sha256":"ad57212fcb105c1079a28f6cc66a51c226553a3ba61834f33ced218aefe7baf4","abstract_canon_sha256":"4f21c12be6b2a72f20ff32c55afae982e59ef9d18d9a2f2e2ec8600a4d136239"},"schema_version":"1.0"},"canonical_sha256":"50d55e869af204b4a42eab2d3b48ea361ed27c1cf05c8bb1f8d66e07b44f518a","source":{"kind":"arxiv","id":"1503.02840","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02840","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02840v2","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02840","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"KDKV5BU26ICL","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDKV5BU26ICLJJBO","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDKV5BU2","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KDKV5BU26ICLJJBOVMWTWSHKGY","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02840","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-10T10:02:21Z","cross_cats_sorted":["math.GN","math.LO"],"title_canon_sha256":"ad57212fcb105c1079a28f6cc66a51c226553a3ba61834f33ced218aefe7baf4","abstract_canon_sha256":"4f21c12be6b2a72f20ff32c55afae982e59ef9d18d9a2f2e2ec8600a4d136239"},"schema_version":"1.0"},"canonical_sha256":"50d55e869af204b4a42eab2d3b48ea361ed27c1cf05c8bb1f8d66e07b44f518a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:04.326998Z","signature_b64":"vb/4gFZr0g05y/bws4yMAnNUr15PSkGnCEYCL0p+2KzUFmP5W9RRrSL7HAOpcTu0rp/6H+Dz/yn0mQViJVzxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50d55e869af204b4a42eab2d3b48ea361ed27c1cf05c8bb1f8d66e07b44f518a","last_reissued_at":"2026-05-18T02:25:04.326638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:04.326638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02840","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-18T02:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFcdVMjJ3AKNEdGW//B8MiK7Jz/afEq/Z1U5rdGaSVybg2oVPnkYXuKjWJ5bcdHi5oEYzySnTncsHFcIDOa/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:07:43.167012Z"},"content_sha256":"a0c47ab86318fcfcffc0790353e67c6d501a5d3fffb6c198bb1c945cd2e97c31","schema_version":"1.0","event_id":"sha256:a0c47ab86318fcfcffc0790353e67c6d501a5d3fffb6c198bb1c945cd2e97c31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KDKV5BU26ICLJJBOVMWTWSHKGY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Upper Bound on the Complexity of Recognizable Tree Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN","math.LO"],"primary_cat":"cs.FL","authors_text":"Dominique Lecomte (IMJ), IMJ), Olivier Finkel (ELM, Pierre Simonnet (SPE)","submitted_at":"2015-03-10T10:02:21Z","abstract_excerpt":"The third author noticed in his 1992 PhD Thesis [Sim92] that every regular tree language of infinite trees is in a class $\\Game (D\\_n({\\bf\\Sigma}^0\\_2))$ for some natural number $n\\geq 1$, where $\\Game$ is the game quantifier. We first give a detailed exposition of this result. Next, using an embedding of the Wadge hierarchy of non self-dual Borel subsets of the Cantor space $2^\\omega$ into the class ${\\bf\\Delta}^1\\_2$, and the notions of Wadge degree and Veblen function, we argue that this upper bound on the topological complexity of regular tree languages is much better than the usual ${\\bf\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02840","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-18T02:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3dCETqyD9h7sqyerC1IbYF7L8+4oUy83jAfXVtAggjoxshijuVxMHXkYM9Cy3FoBvvcfQLEQxI44atmtS/NAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:07:43.167698Z"},"content_sha256":"47175f6e4f9147a85c33c38e0bbe335afddd3a822594d057785282ba734a2349","schema_version":"1.0","event_id":"sha256:47175f6e4f9147a85c33c38e0bbe335afddd3a822594d057785282ba734a2349"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDKV5BU26ICLJJBOVMWTWSHKGY/bundle.json","state_url":"https://pith.science/pith/KDKV5BU26ICLJJBOVMWTWSHKGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDKV5BU26ICLJJBOVMWTWSHKGY/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-08T03:07:43Z","links":{"resolver":"https://pith.science/pith/KDKV5BU26ICLJJBOVMWTWSHKGY","bundle":"https://pith.science/pith/KDKV5BU26ICLJJBOVMWTWSHKGY/bundle.json","state":"https://pith.science/pith/KDKV5BU26ICLJJBOVMWTWSHKGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDKV5BU26ICLJJBOVMWTWSHKGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KDKV5BU26ICLJJBOVMWTWSHKGY","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":"4f21c12be6b2a72f20ff32c55afae982e59ef9d18d9a2f2e2ec8600a4d136239","cross_cats_sorted":["math.GN","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-10T10:02:21Z","title_canon_sha256":"ad57212fcb105c1079a28f6cc66a51c226553a3ba61834f33ced218aefe7baf4"},"schema_version":"1.0","source":{"id":"1503.02840","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02840","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02840v2","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02840","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"KDKV5BU26ICL","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDKV5BU26ICLJJBO","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDKV5BU2","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:47175f6e4f9147a85c33c38e0bbe335afddd3a822594d057785282ba734a2349","target":"graph","created_at":"2026-05-18T02:25:04Z","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":"The third author noticed in his 1992 PhD Thesis [Sim92] that every regular tree language of infinite trees is in a class $\\Game (D\\_n({\\bf\\Sigma}^0\\_2))$ for some natural number $n\\geq 1$, where $\\Game$ is the game quantifier. We first give a detailed exposition of this result. Next, using an embedding of the Wadge hierarchy of non self-dual Borel subsets of the Cantor space $2^\\omega$ into the class ${\\bf\\Delta}^1\\_2$, and the notions of Wadge degree and Veblen function, we argue that this upper bound on the topological complexity of regular tree languages is much better than the usual ${\\bf\\","authors_text":"Dominique Lecomte (IMJ), IMJ), Olivier Finkel (ELM, Pierre Simonnet (SPE)","cross_cats":["math.GN","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-10T10:02:21Z","title":"An Upper Bound on the Complexity of Recognizable Tree Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02840","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:a0c47ab86318fcfcffc0790353e67c6d501a5d3fffb6c198bb1c945cd2e97c31","target":"record","created_at":"2026-05-18T02:25:04Z","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":"4f21c12be6b2a72f20ff32c55afae982e59ef9d18d9a2f2e2ec8600a4d136239","cross_cats_sorted":["math.GN","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-10T10:02:21Z","title_canon_sha256":"ad57212fcb105c1079a28f6cc66a51c226553a3ba61834f33ced218aefe7baf4"},"schema_version":"1.0","source":{"id":"1503.02840","kind":"arxiv","version":2}},"canonical_sha256":"50d55e869af204b4a42eab2d3b48ea361ed27c1cf05c8bb1f8d66e07b44f518a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50d55e869af204b4a42eab2d3b48ea361ed27c1cf05c8bb1f8d66e07b44f518a","first_computed_at":"2026-05-18T02:25:04.326638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:04.326638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vb/4gFZr0g05y/bws4yMAnNUr15PSkGnCEYCL0p+2KzUFmP5W9RRrSL7HAOpcTu0rp/6H+Dz/yn0mQViJVzxAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:04.326998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02840","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0c47ab86318fcfcffc0790353e67c6d501a5d3fffb6c198bb1c945cd2e97c31","sha256:47175f6e4f9147a85c33c38e0bbe335afddd3a822594d057785282ba734a2349"],"state_sha256":"b6261f9046d8bf606f4eabe12b57bf6f2963232f0da94dd5540d42b68c66d382"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nidXB8nxcYKvstaPB2H9un7/HVlbiVvcT47hHGOlMiI05VmObVPD+1qLyj7zgvhnn6SOqaBry+Wiife9LjtFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:07:43.171271Z","bundle_sha256":"e393abd66a8829b1c18f072473cbcf2f3529fd7c0a6df9fad978ee059041f838"}}