{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R2UMOGL2LF5Z4Q7EWH46SLYB6H","short_pith_number":"pith:R2UMOGL2","canonical_record":{"source":{"id":"1812.01674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-12-04T20:45:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"84f9036a8bfb9e75293d9da54d5e48988f1fc9c8e2221c95ee880196f8b6e280","abstract_canon_sha256":"597523744ca8835fbc7a132d0f9f52aba90d91f3936122f781225e8452404115"},"schema_version":"1.0"},"canonical_sha256":"8ea8c7197a597b9e43e4b1f9e92f01f1cb18be784dbfe2e0e76185f876c88326","source":{"kind":"arxiv","id":"1812.01674","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01674","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01674v1","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01674","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"pith_short_12","alias_value":"R2UMOGL2LF5Z","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R2UMOGL2LF5Z4Q7E","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R2UMOGL2","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R2UMOGL2LF5Z4Q7EWH46SLYB6H","target":"record","payload":{"canonical_record":{"source":{"id":"1812.01674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-12-04T20:45:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"84f9036a8bfb9e75293d9da54d5e48988f1fc9c8e2221c95ee880196f8b6e280","abstract_canon_sha256":"597523744ca8835fbc7a132d0f9f52aba90d91f3936122f781225e8452404115"},"schema_version":"1.0"},"canonical_sha256":"8ea8c7197a597b9e43e4b1f9e92f01f1cb18be784dbfe2e0e76185f876c88326","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:00.932017Z","signature_b64":"LThRrtNs+Zx9VcXRbz8GbKkjbedd/9VJMfFJXp3er1iVBwL97nboWmCzSSARlA7AbUQsvGZJ6rn207JqFm6xCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ea8c7197a597b9e43e4b1f9e92f01f1cb18be784dbfe2e0e76185f876c88326","last_reissued_at":"2026-05-17T23:59:00.931584Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:00.931584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.01674","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-17T23:59:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xSTuG/KS4hDs90j+vC8dZ0tqV2ReM1BOlBsyA1AJddYmQ7XUay3vZGv2/BUvMrHMLFu53Hu0uwB42EOwMbAHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:14:07.489937Z"},"content_sha256":"c97b1e51f65c5e4c02303ecdedefbaff1dc3e6e2271a6a747517939154cd2359","schema_version":"1.0","event_id":"sha256:c97b1e51f65c5e4c02303ecdedefbaff1dc3e6e2271a6a747517939154cd2359"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R2UMOGL2LF5Z4Q7EWH46SLYB6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proving that a Tree Language is not First-Order Definable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Martin Beaudry","submitted_at":"2018-12-04T20:45:43Z","abstract_excerpt":"We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of forest algebras defined from finite counter monoids. Proofs of nondefinability are infinite sequences of sets of forests, one for each level of the hierarchy of quantification levels that defines the corresponding variety of languages. The forests at a given level are built recursively by inserting forests from previous level at the ports of a suitable set of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01674","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-17T23:59:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rj+0wfgsj8NQU/lGYfJiL8BhmWBmhwBCn/VcgWsoM47AHx4YfEQ2xJUkG53Qt1J0TuL0Xr4xKhEnRT4yZmbCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:14:07.490273Z"},"content_sha256":"95570252dd81cdd083e8568b89992bb6befec2276154cc83ddee388ad289093e","schema_version":"1.0","event_id":"sha256:95570252dd81cdd083e8568b89992bb6befec2276154cc83ddee388ad289093e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2UMOGL2LF5Z4Q7EWH46SLYB6H/bundle.json","state_url":"https://pith.science/pith/R2UMOGL2LF5Z4Q7EWH46SLYB6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2UMOGL2LF5Z4Q7EWH46SLYB6H/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-29T08:14:07Z","links":{"resolver":"https://pith.science/pith/R2UMOGL2LF5Z4Q7EWH46SLYB6H","bundle":"https://pith.science/pith/R2UMOGL2LF5Z4Q7EWH46SLYB6H/bundle.json","state":"https://pith.science/pith/R2UMOGL2LF5Z4Q7EWH46SLYB6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2UMOGL2LF5Z4Q7EWH46SLYB6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R2UMOGL2LF5Z4Q7EWH46SLYB6H","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":"597523744ca8835fbc7a132d0f9f52aba90d91f3936122f781225e8452404115","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-12-04T20:45:43Z","title_canon_sha256":"84f9036a8bfb9e75293d9da54d5e48988f1fc9c8e2221c95ee880196f8b6e280"},"schema_version":"1.0","source":{"id":"1812.01674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01674","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01674v1","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01674","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"pith_short_12","alias_value":"R2UMOGL2LF5Z","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R2UMOGL2LF5Z4Q7E","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R2UMOGL2","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:95570252dd81cdd083e8568b89992bb6befec2276154cc83ddee388ad289093e","target":"graph","created_at":"2026-05-17T23:59:00Z","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 explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of forest algebras defined from finite counter monoids. Proofs of nondefinability are infinite sequences of sets of forests, one for each level of the hierarchy of quantification levels that defines the corresponding variety of languages. The forests at a given level are built recursively by inserting forests from previous level at the ports of a suitable set of ","authors_text":"Martin Beaudry","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-12-04T20:45:43Z","title":"Proving that a Tree Language is not First-Order Definable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01674","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:c97b1e51f65c5e4c02303ecdedefbaff1dc3e6e2271a6a747517939154cd2359","target":"record","created_at":"2026-05-17T23:59:00Z","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":"597523744ca8835fbc7a132d0f9f52aba90d91f3936122f781225e8452404115","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-12-04T20:45:43Z","title_canon_sha256":"84f9036a8bfb9e75293d9da54d5e48988f1fc9c8e2221c95ee880196f8b6e280"},"schema_version":"1.0","source":{"id":"1812.01674","kind":"arxiv","version":1}},"canonical_sha256":"8ea8c7197a597b9e43e4b1f9e92f01f1cb18be784dbfe2e0e76185f876c88326","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ea8c7197a597b9e43e4b1f9e92f01f1cb18be784dbfe2e0e76185f876c88326","first_computed_at":"2026-05-17T23:59:00.931584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:00.931584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LThRrtNs+Zx9VcXRbz8GbKkjbedd/9VJMfFJXp3er1iVBwL97nboWmCzSSARlA7AbUQsvGZJ6rn207JqFm6xCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:00.932017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c97b1e51f65c5e4c02303ecdedefbaff1dc3e6e2271a6a747517939154cd2359","sha256:95570252dd81cdd083e8568b89992bb6befec2276154cc83ddee388ad289093e"],"state_sha256":"8eb3c0f3bc5939daede8dcd2425949ab48955adb897b6077830044287a8e3c23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEH3VQcWWM3lCbvKx9w1FmQgPQ36CEki/XIiL/pgmSi/za8QqEXrB8yPZQoKWATp4c/sjlOjGCR3+uq96Vc4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:14:07.492118Z","bundle_sha256":"f15a5e6b6112d28d93ad4485255bfa6303900c937cd8e6f0b28198a87f7e40d8"}}