{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OKAHBNRG75T5AUXYPO6RAZF6XL","short_pith_number":"pith:OKAHBNRG","canonical_record":{"source":{"id":"1805.04402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-11T13:50:26Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"6b37e8143aecd060017f843d83f408627ad8d3f33d4538402051cc214ea3a392","abstract_canon_sha256":"fedc39aaec52bef3a95efd17da3128a8646387cfb5b8319ed532af36edc0dcfa"},"schema_version":"1.0"},"canonical_sha256":"728070b626ff67d052f87bbd1064bebaef83af75dac2210e1c2fb845c6ed0222","source":{"kind":"arxiv","id":"1805.04402","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04402","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04402v2","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04402","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_12","alias_value":"OKAHBNRG75T5","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_16","alias_value":"OKAHBNRG75T5AUXY","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_8","alias_value":"OKAHBNRG","created_at":"2026-07-05T05:38:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OKAHBNRG75T5AUXYPO6RAZF6XL","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-11T13:50:26Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"6b37e8143aecd060017f843d83f408627ad8d3f33d4538402051cc214ea3a392","abstract_canon_sha256":"fedc39aaec52bef3a95efd17da3128a8646387cfb5b8319ed532af36edc0dcfa"},"schema_version":"1.0"},"canonical_sha256":"728070b626ff67d052f87bbd1064bebaef83af75dac2210e1c2fb845c6ed0222","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:06.056950Z","signature_b64":"L6lTJwJqIScJ5WQ9NvanK7jhNOaerTZ3VQUKahAW4ERzPVEPWY8eJlTaBYPf3tSOqYBvK52cSRT69f2n+b5bBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"728070b626ff67d052f87bbd1064bebaef83af75dac2210e1c2fb845c6ed0222","last_reissued_at":"2026-07-05T05:38:06.056485Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:06.056485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04402","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-07-05T05:38:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xDhcGYpEdHGM7JRFA0Z3t13h3APh3dc3nbbVoIuc9ktiKfgRL/3QUvgtCTMOWF17+LB+La8AAdkj90hmU2F2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T10:14:21.756422Z"},"content_sha256":"7c877e76882e75eba479f8d42ca66aba17b3b22af35fdfed13d0f77fa2fb426b","schema_version":"1.0","event_id":"sha256:7c877e76882e75eba479f8d42ca66aba17b3b22af35fdfed13d0f77fa2fb426b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OKAHBNRG75T5AUXYPO6RAZF6XL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decision problems for Clark-congruential languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CL","authors_text":"Makoto Kanazawa, Tobias Kapp\\'e","submitted_at":"2018-05-11T13:50:26Z","abstract_excerpt":"A common question when studying a class of context-free grammars is whether equivalence is decidable within this class. We answer this question positively for the class of Clark-congruential grammars, which are of interest to grammatical inference. We also consider the problem of checking whether a given CFG is Clark-congruential, and show that it is decidable given that the CFG is a DCFG."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04402","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.04402/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-05T05:38:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHNhM2XUp+nYA57cQvdKZ6BvzpBA9s9pZLAreF0zG3gv/wR4uO+x4vYpN5iq6ehPpXemy+AHDmiqFIeOK2H/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T10:14:21.756925Z"},"content_sha256":"de6c50ff5c3f767f676722fb4a67a394fc80ad51c13ef7f5c57ad2410e7e6550","schema_version":"1.0","event_id":"sha256:de6c50ff5c3f767f676722fb4a67a394fc80ad51c13ef7f5c57ad2410e7e6550"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKAHBNRG75T5AUXYPO6RAZF6XL/bundle.json","state_url":"https://pith.science/pith/OKAHBNRG75T5AUXYPO6RAZF6XL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKAHBNRG75T5AUXYPO6RAZF6XL/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-22T10:14:21Z","links":{"resolver":"https://pith.science/pith/OKAHBNRG75T5AUXYPO6RAZF6XL","bundle":"https://pith.science/pith/OKAHBNRG75T5AUXYPO6RAZF6XL/bundle.json","state":"https://pith.science/pith/OKAHBNRG75T5AUXYPO6RAZF6XL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKAHBNRG75T5AUXYPO6RAZF6XL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OKAHBNRG75T5AUXYPO6RAZF6XL","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":"fedc39aaec52bef3a95efd17da3128a8646387cfb5b8319ed532af36edc0dcfa","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-11T13:50:26Z","title_canon_sha256":"6b37e8143aecd060017f843d83f408627ad8d3f33d4538402051cc214ea3a392"},"schema_version":"1.0","source":{"id":"1805.04402","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04402","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04402v2","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04402","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_12","alias_value":"OKAHBNRG75T5","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_16","alias_value":"OKAHBNRG75T5AUXY","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_8","alias_value":"OKAHBNRG","created_at":"2026-07-05T05:38:06Z"}],"graph_snapshots":[{"event_id":"sha256:de6c50ff5c3f767f676722fb4a67a394fc80ad51c13ef7f5c57ad2410e7e6550","target":"graph","created_at":"2026-07-05T05:38:06Z","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/1805.04402/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A common question when studying a class of context-free grammars is whether equivalence is decidable within this class. We answer this question positively for the class of Clark-congruential grammars, which are of interest to grammatical inference. We also consider the problem of checking whether a given CFG is Clark-congruential, and show that it is decidable given that the CFG is a DCFG.","authors_text":"Makoto Kanazawa, Tobias Kapp\\'e","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-11T13:50:26Z","title":"Decision problems for Clark-congruential languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04402","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:7c877e76882e75eba479f8d42ca66aba17b3b22af35fdfed13d0f77fa2fb426b","target":"record","created_at":"2026-07-05T05:38:06Z","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":"fedc39aaec52bef3a95efd17da3128a8646387cfb5b8319ed532af36edc0dcfa","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-11T13:50:26Z","title_canon_sha256":"6b37e8143aecd060017f843d83f408627ad8d3f33d4538402051cc214ea3a392"},"schema_version":"1.0","source":{"id":"1805.04402","kind":"arxiv","version":2}},"canonical_sha256":"728070b626ff67d052f87bbd1064bebaef83af75dac2210e1c2fb845c6ed0222","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"728070b626ff67d052f87bbd1064bebaef83af75dac2210e1c2fb845c6ed0222","first_computed_at":"2026-07-05T05:38:06.056485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:06.056485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L6lTJwJqIScJ5WQ9NvanK7jhNOaerTZ3VQUKahAW4ERzPVEPWY8eJlTaBYPf3tSOqYBvK52cSRT69f2n+b5bBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:06.056950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04402","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c877e76882e75eba479f8d42ca66aba17b3b22af35fdfed13d0f77fa2fb426b","sha256:de6c50ff5c3f767f676722fb4a67a394fc80ad51c13ef7f5c57ad2410e7e6550"],"state_sha256":"bac2a4766f5802b57e406cc0ad71d2b507dee64aaaf6e52d6c95012c90127a4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3aECIyO9jK9kxT7V+ZTMJatg3xgtzZrqxXcrOLPD+n6tevA/MWQJZ5xLs/fFganWgK4UHJBdQiG/rjwCx7w6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T10:14:21.761709Z","bundle_sha256":"c6e1f194efaf914945b5bb987058652bc7a1a4f197a81707eeca45f0796c0e46"}}