{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AFS6NTTSU3QADMRXFDVKLLCL4I","short_pith_number":"pith:AFS6NTTS","canonical_record":{"source":{"id":"1810.13153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-10-31T08:34:37Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"0b6f3129cc0f51efb0ebcccf08cfd5df08088491c11b6ec7a7ecc5fc2f815fbe","abstract_canon_sha256":"0e1a335c687b9748b29c5ca9bca39eadc3378fa13fb7ffd1b15d4d1506f8d5b9"},"schema_version":"1.0"},"canonical_sha256":"0165e6ce72a6e001b23728eaa5ac4be21299de359deacd5304549cc5edb8a466","source":{"kind":"arxiv","id":"1810.13153","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13153","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13153v2","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13153","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"AFS6NTTSU3QA","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AFS6NTTSU3QADMRX","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AFS6NTTS","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AFS6NTTSU3QADMRXFDVKLLCL4I","target":"record","payload":{"canonical_record":{"source":{"id":"1810.13153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-10-31T08:34:37Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"0b6f3129cc0f51efb0ebcccf08cfd5df08088491c11b6ec7a7ecc5fc2f815fbe","abstract_canon_sha256":"0e1a335c687b9748b29c5ca9bca39eadc3378fa13fb7ffd1b15d4d1506f8d5b9"},"schema_version":"1.0"},"canonical_sha256":"0165e6ce72a6e001b23728eaa5ac4be21299de359deacd5304549cc5edb8a466","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:48.783679Z","signature_b64":"ytHjoIzlMDsVOCj7nFnLQcXou1tm9C6dFABZ4uUWYNb/fzszAW/9RgKbmA9DYX13X3nQva26UyRN8CKcapmzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0165e6ce72a6e001b23728eaa5ac4be21299de359deacd5304549cc5edb8a466","last_reissued_at":"2026-05-17T23:50:48.782852Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:48.782852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.13153","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:50:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/Pyhaua+aLaGRfEVwwfAvvCvdHjKzX4Q9ep38Gw533ffd6WkH7vzJPcbakmO950v62359oAVCRYmYMx15V2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:32:28.965330Z"},"content_sha256":"54ecb153933b13b5d777a2892023793137b96b1a940380aa57e923d594e2f92e","schema_version":"1.0","event_id":"sha256:54ecb153933b13b5d777a2892023793137b96b1a940380aa57e923d594e2f92e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AFS6NTTSU3QADMRXFDVKLLCL4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The isomorphism problem for tree-automatic ordinals with addition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.FL","authors_text":"Bakhadyr Khoussainov, Frank Stephan, Philipp Schlicht, Sanjay Jain","submitted_at":"2018-10-31T08:34:37Z","abstract_excerpt":"This paper studies tree-automatic ordinals (or equivalently, well-founded linearly ordered sets) together with the ordinal addition operation +. Informally, these are ordinals such that their elements are coded by finite trees for which the linear order relation of the ordinal and the ordinal addition operation can be determined by tree automata. We describe an algorithm that, given two tree-automatic ordinals with the ordinal addition operation, decides if the ordinals are isomorphic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13153","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:50:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5PMu6SHeok2kuZDqjj8r77vjJ9blozjzuv0z0jrVBmPlpJmOh3oZetQVAtfuXdHsf8OzOYSR6BrZG9DTRP7PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:32:28.965692Z"},"content_sha256":"51a42ef45189e1ed6660b01e466b4e2f2ebb4ab194bf2aaa3942f9dd89cb99c0","schema_version":"1.0","event_id":"sha256:51a42ef45189e1ed6660b01e466b4e2f2ebb4ab194bf2aaa3942f9dd89cb99c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFS6NTTSU3QADMRXFDVKLLCL4I/bundle.json","state_url":"https://pith.science/pith/AFS6NTTSU3QADMRXFDVKLLCL4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFS6NTTSU3QADMRXFDVKLLCL4I/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-01T11:32:28Z","links":{"resolver":"https://pith.science/pith/AFS6NTTSU3QADMRXFDVKLLCL4I","bundle":"https://pith.science/pith/AFS6NTTSU3QADMRXFDVKLLCL4I/bundle.json","state":"https://pith.science/pith/AFS6NTTSU3QADMRXFDVKLLCL4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFS6NTTSU3QADMRXFDVKLLCL4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AFS6NTTSU3QADMRXFDVKLLCL4I","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":"0e1a335c687b9748b29c5ca9bca39eadc3378fa13fb7ffd1b15d4d1506f8d5b9","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-10-31T08:34:37Z","title_canon_sha256":"0b6f3129cc0f51efb0ebcccf08cfd5df08088491c11b6ec7a7ecc5fc2f815fbe"},"schema_version":"1.0","source":{"id":"1810.13153","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13153","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13153v2","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13153","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"AFS6NTTSU3QA","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AFS6NTTSU3QADMRX","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AFS6NTTS","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:51a42ef45189e1ed6660b01e466b4e2f2ebb4ab194bf2aaa3942f9dd89cb99c0","target":"graph","created_at":"2026-05-17T23:50:48Z","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":"This paper studies tree-automatic ordinals (or equivalently, well-founded linearly ordered sets) together with the ordinal addition operation +. Informally, these are ordinals such that their elements are coded by finite trees for which the linear order relation of the ordinal and the ordinal addition operation can be determined by tree automata. We describe an algorithm that, given two tree-automatic ordinals with the ordinal addition operation, decides if the ordinals are isomorphic.","authors_text":"Bakhadyr Khoussainov, Frank Stephan, Philipp Schlicht, Sanjay Jain","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-10-31T08:34:37Z","title":"The isomorphism problem for tree-automatic ordinals with addition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13153","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:54ecb153933b13b5d777a2892023793137b96b1a940380aa57e923d594e2f92e","target":"record","created_at":"2026-05-17T23:50:48Z","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":"0e1a335c687b9748b29c5ca9bca39eadc3378fa13fb7ffd1b15d4d1506f8d5b9","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-10-31T08:34:37Z","title_canon_sha256":"0b6f3129cc0f51efb0ebcccf08cfd5df08088491c11b6ec7a7ecc5fc2f815fbe"},"schema_version":"1.0","source":{"id":"1810.13153","kind":"arxiv","version":2}},"canonical_sha256":"0165e6ce72a6e001b23728eaa5ac4be21299de359deacd5304549cc5edb8a466","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0165e6ce72a6e001b23728eaa5ac4be21299de359deacd5304549cc5edb8a466","first_computed_at":"2026-05-17T23:50:48.782852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:48.782852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ytHjoIzlMDsVOCj7nFnLQcXou1tm9C6dFABZ4uUWYNb/fzszAW/9RgKbmA9DYX13X3nQva26UyRN8CKcapmzBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:48.783679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13153","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54ecb153933b13b5d777a2892023793137b96b1a940380aa57e923d594e2f92e","sha256:51a42ef45189e1ed6660b01e466b4e2f2ebb4ab194bf2aaa3942f9dd89cb99c0"],"state_sha256":"176a6fa2f53cfae376217ac627a1a1592fd929b0750147bd13195e2d2f75a94c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDug5BYm8yjui+HeoF+HqeTXw8AXXwkUjE42uYvWSgesjvBlwslahiJ1jJgo4++C2Q3SHJkHFmpivC5UnnMRDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:32:28.967605Z","bundle_sha256":"a792b3908951b9607de66e841ed4bf7d9a63e08adf97eba6c63ee6626d867945"}}