{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PAEYU6EVAC6RK7SDK6DLGQGKTK","short_pith_number":"pith:PAEYU6EV","canonical_record":{"source":{"id":"1811.03595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-11-08T18:30:44Z","cross_cats_sorted":[],"title_canon_sha256":"e619d25155fba3a3c87d5e8113ee5b16f7a38c5acdbc98f9d59d02af8d42254e","abstract_canon_sha256":"2bacd835678e92ada7c9f7695ef8f6dd713f6a99f4b1ea49b6de15aa4a9c31c9"},"schema_version":"1.0"},"canonical_sha256":"78098a789500bd157e435786b340ca9a877e5bbc8cc62cf4bc60bac45c9cca53","source":{"kind":"arxiv","id":"1811.03595","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03595","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03595v2","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03595","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"pith_short_12","alias_value":"PAEYU6EVAC6R","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PAEYU6EVAC6RK7SD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PAEYU6EV","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PAEYU6EVAC6RK7SDK6DLGQGKTK","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-11-08T18:30:44Z","cross_cats_sorted":[],"title_canon_sha256":"e619d25155fba3a3c87d5e8113ee5b16f7a38c5acdbc98f9d59d02af8d42254e","abstract_canon_sha256":"2bacd835678e92ada7c9f7695ef8f6dd713f6a99f4b1ea49b6de15aa4a9c31c9"},"schema_version":"1.0"},"canonical_sha256":"78098a789500bd157e435786b340ca9a877e5bbc8cc62cf4bc60bac45c9cca53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:50.828646Z","signature_b64":"eq0/YPv28Syaemc3qyxMqgZyP08A2QBHlxdQO18wMGViZodjfc8Li3LxYqNF+QV8IVeMh2R33LZGJm4pbYr7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78098a789500bd157e435786b340ca9a877e5bbc8cc62cf4bc60bac45c9cca53","last_reissued_at":"2026-05-17T23:47:50.828075Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:50.828075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03595","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:47:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLKy9UBKdfgtkC1S7GwLc4IzTLP/OCSUc0zPpj+x7750d+lEgFcIRGTdWu8fG557dLss51fbH2EvD1kALl8QCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:41:53.194015Z"},"content_sha256":"f294ce8f93d7e910aeb4785fde6a7d5e3a793218517ffbd7891b61b706664e8f","schema_version":"1.0","event_id":"sha256:f294ce8f93d7e910aeb4785fde6a7d5e3a793218517ffbd7891b61b706664e8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PAEYU6EVAC6RK7SDK6DLGQGKTK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The ordinal generated by an ordinal grammar is computable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Kitti Gelle, Szabolcs Ivan","submitted_at":"2018-11-08T18:30:44Z","abstract_excerpt":"A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that from a finite system of parametric fixed point equations one can construct an ordinal grammar $G$ such that the lexicographic order of $G$ is isomorphic with the least solution of the system, if this solution is well-ordered. In this paper we show that given an ordinal grammar, one can compute (the Cantor normal form of) the order type of the lexicographic orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03595","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:47:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9ws2tyAbeeuubHoyM4tyuz69At8a8n7ZxcCg3nJ1mnx3tc9KxYovdmkIXMzWMfPIGoXkmax4CNMxhEws0KbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:41:53.194383Z"},"content_sha256":"4ea68caf47bc3bae8e4b43956cfb74e1932a5f66cecd1c16682be016977f0a03","schema_version":"1.0","event_id":"sha256:4ea68caf47bc3bae8e4b43956cfb74e1932a5f66cecd1c16682be016977f0a03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/bundle.json","state_url":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/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-24T05:41:53Z","links":{"resolver":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK","bundle":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/bundle.json","state":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PAEYU6EVAC6RK7SDK6DLGQGKTK","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":"2bacd835678e92ada7c9f7695ef8f6dd713f6a99f4b1ea49b6de15aa4a9c31c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-11-08T18:30:44Z","title_canon_sha256":"e619d25155fba3a3c87d5e8113ee5b16f7a38c5acdbc98f9d59d02af8d42254e"},"schema_version":"1.0","source":{"id":"1811.03595","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03595","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03595v2","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03595","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"pith_short_12","alias_value":"PAEYU6EVAC6R","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PAEYU6EVAC6RK7SD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PAEYU6EV","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:4ea68caf47bc3bae8e4b43956cfb74e1932a5f66cecd1c16682be016977f0a03","target":"graph","created_at":"2026-05-17T23:47:50Z","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":"A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that from a finite system of parametric fixed point equations one can construct an ordinal grammar $G$ such that the lexicographic order of $G$ is isomorphic with the least solution of the system, if this solution is well-ordered. In this paper we show that given an ordinal grammar, one can compute (the Cantor normal form of) the order type of the lexicographic orde","authors_text":"Kitti Gelle, Szabolcs Ivan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-11-08T18:30:44Z","title":"The ordinal generated by an ordinal grammar is computable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03595","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:f294ce8f93d7e910aeb4785fde6a7d5e3a793218517ffbd7891b61b706664e8f","target":"record","created_at":"2026-05-17T23:47:50Z","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":"2bacd835678e92ada7c9f7695ef8f6dd713f6a99f4b1ea49b6de15aa4a9c31c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-11-08T18:30:44Z","title_canon_sha256":"e619d25155fba3a3c87d5e8113ee5b16f7a38c5acdbc98f9d59d02af8d42254e"},"schema_version":"1.0","source":{"id":"1811.03595","kind":"arxiv","version":2}},"canonical_sha256":"78098a789500bd157e435786b340ca9a877e5bbc8cc62cf4bc60bac45c9cca53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78098a789500bd157e435786b340ca9a877e5bbc8cc62cf4bc60bac45c9cca53","first_computed_at":"2026-05-17T23:47:50.828075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:50.828075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eq0/YPv28Syaemc3qyxMqgZyP08A2QBHlxdQO18wMGViZodjfc8Li3LxYqNF+QV8IVeMh2R33LZGJm4pbYr7BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:50.828646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03595","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f294ce8f93d7e910aeb4785fde6a7d5e3a793218517ffbd7891b61b706664e8f","sha256:4ea68caf47bc3bae8e4b43956cfb74e1932a5f66cecd1c16682be016977f0a03"],"state_sha256":"bc5f3e3b3443dcfe3738d44a80140f7f48a04167047a6a6d26585478e380d2fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVdo88DEh+JAFVcpJDJUK2vqyxrbE1fPF9wSLCEjcGBKOrv9HsGHLzp+75RRwdteDykeAwCJO0J2xapQZs0cDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:41:53.196339Z","bundle_sha256":"2d00b16bb9ce68c3e0125e9f3b4d4b61cbb1c9668e69e142daa6225ddcd5fd9c"}}