{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:THR74PTSVZ7N3TYNZLASMB7MDB","short_pith_number":"pith:THR74PTS","canonical_record":{"source":{"id":"2406.15090","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2024-06-21T12:09:38Z","cross_cats_sorted":[],"title_canon_sha256":"c2dd66e0e343d6873e21ee25152dcdaa403f28894a2c377705756ac6a0345534","abstract_canon_sha256":"66ff85ac21fefcd645dd10f851d68d9e454e7cf2250c45205b93e848cd448913"},"schema_version":"1.0"},"canonical_sha256":"99e3fe3e72ae7eddcf0dcac12607ec1876b323d7221bc50a68298d8feff9b77f","source":{"kind":"arxiv","id":"2406.15090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.15090","created_at":"2026-07-05T08:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"2406.15090v1","created_at":"2026-07-05T08:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.15090","created_at":"2026-07-05T08:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"THR74PTSVZ7N","created_at":"2026-07-05T08:35:13Z"},{"alias_kind":"pith_short_16","alias_value":"THR74PTSVZ7N3TYN","created_at":"2026-07-05T08:35:13Z"},{"alias_kind":"pith_short_8","alias_value":"THR74PTS","created_at":"2026-07-05T08:35:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:THR74PTSVZ7N3TYNZLASMB7MDB","target":"record","payload":{"canonical_record":{"source":{"id":"2406.15090","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2024-06-21T12:09:38Z","cross_cats_sorted":[],"title_canon_sha256":"c2dd66e0e343d6873e21ee25152dcdaa403f28894a2c377705756ac6a0345534","abstract_canon_sha256":"66ff85ac21fefcd645dd10f851d68d9e454e7cf2250c45205b93e848cd448913"},"schema_version":"1.0"},"canonical_sha256":"99e3fe3e72ae7eddcf0dcac12607ec1876b323d7221bc50a68298d8feff9b77f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:13.868453Z","signature_b64":"AvboCGpOcteONuBZ1WJ4E6xyd4p+5wM6IZfAkA945n066ZeyJNhNtBMuA5tjsFot4RHCfwgcQjJibg1io6IjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e3fe3e72ae7eddcf0dcac12607ec1876b323d7221bc50a68298d8feff9b77f","last_reissued_at":"2026-07-05T08:35:13.868014Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:13.868014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.15090","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-07-05T08:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xr9SauxhDylcmv6z6yvnmxyAAGfrx4FlHrc7Q1168cnm12S7zOTpzgHwPJrq18hWOv/GeiLU1B//4iCoaS3OAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:54:51.599578Z"},"content_sha256":"89363fa4dac465645ec09cdeec359701fae760a5c59039bbf3f220d1324fff32","schema_version":"1.0","event_id":"sha256:89363fa4dac465645ec09cdeec359701fae760a5c59039bbf3f220d1324fff32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:THR74PTSVZ7N3TYNZLASMB7MDB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global One-Counter Tree Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Luisa Herrmann, Richard M\\\"orbitz","submitted_at":"2024-06-21T12:09:38Z","abstract_excerpt":"We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed through the tree in lexicographical order, rather than duplicating the counter at every branching position. We compare the capabilities of GOCTA to those of counter tree automata and obtain that their classes of recognizable tree languages are incomparable. Moreover, we show that the emptiness problem of GOCTA is undecidable while, in stark contrast, their membership problem is in P."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.15090","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.15090/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"56yAWnfLHSQ6YHQVQcz6CwyeYu7WHvOOsF0a7HXJOCwKgI1cda01RDYC6AJX9R8obNK/jv08U82i/9u68zAlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:54:51.600571Z"},"content_sha256":"ca221e02344ffe0254b5cfd506f4a0cb43914b1c5f3db2e963c8901b9545616a","schema_version":"1.0","event_id":"sha256:ca221e02344ffe0254b5cfd506f4a0cb43914b1c5f3db2e963c8901b9545616a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THR74PTSVZ7N3TYNZLASMB7MDB/bundle.json","state_url":"https://pith.science/pith/THR74PTSVZ7N3TYNZLASMB7MDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THR74PTSVZ7N3TYNZLASMB7MDB/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-08-13T17:54:51Z","links":{"resolver":"https://pith.science/pith/THR74PTSVZ7N3TYNZLASMB7MDB","bundle":"https://pith.science/pith/THR74PTSVZ7N3TYNZLASMB7MDB/bundle.json","state":"https://pith.science/pith/THR74PTSVZ7N3TYNZLASMB7MDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THR74PTSVZ7N3TYNZLASMB7MDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:THR74PTSVZ7N3TYNZLASMB7MDB","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":"66ff85ac21fefcd645dd10f851d68d9e454e7cf2250c45205b93e848cd448913","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2024-06-21T12:09:38Z","title_canon_sha256":"c2dd66e0e343d6873e21ee25152dcdaa403f28894a2c377705756ac6a0345534"},"schema_version":"1.0","source":{"id":"2406.15090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.15090","created_at":"2026-07-05T08:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"2406.15090v1","created_at":"2026-07-05T08:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.15090","created_at":"2026-07-05T08:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"THR74PTSVZ7N","created_at":"2026-07-05T08:35:13Z"},{"alias_kind":"pith_short_16","alias_value":"THR74PTSVZ7N3TYN","created_at":"2026-07-05T08:35:13Z"},{"alias_kind":"pith_short_8","alias_value":"THR74PTS","created_at":"2026-07-05T08:35:13Z"}],"graph_snapshots":[{"event_id":"sha256:ca221e02344ffe0254b5cfd506f4a0cb43914b1c5f3db2e963c8901b9545616a","target":"graph","created_at":"2026-07-05T08:35:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.15090/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed through the tree in lexicographical order, rather than duplicating the counter at every branching position. We compare the capabilities of GOCTA to those of counter tree automata and obtain that their classes of recognizable tree languages are incomparable. Moreover, we show that the emptiness problem of GOCTA is undecidable while, in stark contrast, their membership problem is in P.","authors_text":"Luisa Herrmann, Richard M\\\"orbitz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2024-06-21T12:09:38Z","title":"Global One-Counter Tree Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.15090","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:89363fa4dac465645ec09cdeec359701fae760a5c59039bbf3f220d1324fff32","target":"record","created_at":"2026-07-05T08:35:13Z","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":"66ff85ac21fefcd645dd10f851d68d9e454e7cf2250c45205b93e848cd448913","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2024-06-21T12:09:38Z","title_canon_sha256":"c2dd66e0e343d6873e21ee25152dcdaa403f28894a2c377705756ac6a0345534"},"schema_version":"1.0","source":{"id":"2406.15090","kind":"arxiv","version":1}},"canonical_sha256":"99e3fe3e72ae7eddcf0dcac12607ec1876b323d7221bc50a68298d8feff9b77f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99e3fe3e72ae7eddcf0dcac12607ec1876b323d7221bc50a68298d8feff9b77f","first_computed_at":"2026-07-05T08:35:13.868014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:35:13.868014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AvboCGpOcteONuBZ1WJ4E6xyd4p+5wM6IZfAkA945n066ZeyJNhNtBMuA5tjsFot4RHCfwgcQjJibg1io6IjBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:35:13.868453Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.15090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89363fa4dac465645ec09cdeec359701fae760a5c59039bbf3f220d1324fff32","sha256:ca221e02344ffe0254b5cfd506f4a0cb43914b1c5f3db2e963c8901b9545616a"],"state_sha256":"0b72679a35cee9be94f4905739ccd1ee89f09bd7e1f6c2fc21a52fbef56908ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRsvtnQI8eeKxSfaZ7VKpGZJiDLD+WCHa5jAv8AWOXwtzPObhVYei3CNsrHgYCHiUqGyoMw9Cy9El/FAUI+EBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T17:54:51.619383Z","bundle_sha256":"04878ba897c1953c99bf6ec8dbfbbe3f6aeb1c702b85cf81d3910738f8aeda36"}}