{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PC62673ACNG5EIVQTNQXLC4HAS","short_pith_number":"pith:PC62673A","canonical_record":{"source":{"id":"1501.02795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-11T15:11:15Z","cross_cats_sorted":[],"title_canon_sha256":"af1e8e1ea724f3cd001a63d5eb2978f3d3586ee58d068e6c701a62d57d58e796","abstract_canon_sha256":"1433262bf94f77d7b664c6244d4fedf695c197ea382d9bdc32f28fdeeea95ef9"},"schema_version":"1.0"},"canonical_sha256":"78bdaf7f60134dd222b09b61758b87049b53f7650b9903579a942647b2882921","source":{"kind":"arxiv","id":"1501.02795","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02795","created_at":"2026-05-18T02:29:31Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02795v1","created_at":"2026-05-18T02:29:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02795","created_at":"2026-05-18T02:29:31Z"},{"alias_kind":"pith_short_12","alias_value":"PC62673ACNG5","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PC62673ACNG5EIVQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PC62673A","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PC62673ACNG5EIVQTNQXLC4HAS","target":"record","payload":{"canonical_record":{"source":{"id":"1501.02795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-11T15:11:15Z","cross_cats_sorted":[],"title_canon_sha256":"af1e8e1ea724f3cd001a63d5eb2978f3d3586ee58d068e6c701a62d57d58e796","abstract_canon_sha256":"1433262bf94f77d7b664c6244d4fedf695c197ea382d9bdc32f28fdeeea95ef9"},"schema_version":"1.0"},"canonical_sha256":"78bdaf7f60134dd222b09b61758b87049b53f7650b9903579a942647b2882921","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:31.177678Z","signature_b64":"lfvuua2eDS8Z+g+ne+JJnabgJLyfRGe/tdhluNmM72qSDBOryof+EWGYn1/QyVx7utQCwSVoqL1nghqFmHw6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78bdaf7f60134dd222b09b61758b87049b53f7650b9903579a942647b2882921","last_reissued_at":"2026-05-18T02:29:31.177179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:31.177179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.02795","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-18T02:29:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PzHhpi3+FKEnTa/142MeWvUFv4SZNPVrvBz7Nfgj6T085JT0gvDBmlWdLiqGnDLL/dW7BePBaxhuHfktYrPUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:37:47.237654Z"},"content_sha256":"0768f3cf8d3fc8b639e1dfe2b88243cf55fa3c1b9246e5232ea7b3edc54684c5","schema_version":"1.0","event_id":"sha256:0768f3cf8d3fc8b639e1dfe2b88243cf55fa3c1b9246e5232ea7b3edc54684c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PC62673ACNG5EIVQTNQXLC4HAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scanning and Parsing Languages with Ambiguities and Constraints: The Lamb and Fence Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Fernando Berzal, Francisco J. Cortijo, Luis Quesada","submitted_at":"2015-01-11T15:11:15Z","abstract_excerpt":"Traditional language processing tools constrain language designers to specific kinds of grammars. In contrast, model-based language processing tools decouple language design from language processing. These tools allow the occurrence of lexical and syntactic ambiguities in language specifications and the declarative specification of constraints for resolving them. As a result, these techniques require scanners and parsers able to parse context-free grammars, handle ambiguities, and enforce constraints for disambiguation. In this paper, we present Lamb and Fence. Lamb is a scanning algorithm tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02795","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-18T02:29:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Du6brDsFoJYgJpSYmxKsGGmw7AvzQWKfj7/SNdY0nosCaCSIwSGm7PVPJJ0isNxAD/UKKg3pMngJyhdK/9NFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:37:47.238012Z"},"content_sha256":"895726d0c86371f78ff1956680500db5dd742d44cdc2270435e7b10e919ec509","schema_version":"1.0","event_id":"sha256:895726d0c86371f78ff1956680500db5dd742d44cdc2270435e7b10e919ec509"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PC62673ACNG5EIVQTNQXLC4HAS/bundle.json","state_url":"https://pith.science/pith/PC62673ACNG5EIVQTNQXLC4HAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PC62673ACNG5EIVQTNQXLC4HAS/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-05-30T08:37:47Z","links":{"resolver":"https://pith.science/pith/PC62673ACNG5EIVQTNQXLC4HAS","bundle":"https://pith.science/pith/PC62673ACNG5EIVQTNQXLC4HAS/bundle.json","state":"https://pith.science/pith/PC62673ACNG5EIVQTNQXLC4HAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PC62673ACNG5EIVQTNQXLC4HAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PC62673ACNG5EIVQTNQXLC4HAS","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":"1433262bf94f77d7b664c6244d4fedf695c197ea382d9bdc32f28fdeeea95ef9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-11T15:11:15Z","title_canon_sha256":"af1e8e1ea724f3cd001a63d5eb2978f3d3586ee58d068e6c701a62d57d58e796"},"schema_version":"1.0","source":{"id":"1501.02795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02795","created_at":"2026-05-18T02:29:31Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02795v1","created_at":"2026-05-18T02:29:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02795","created_at":"2026-05-18T02:29:31Z"},{"alias_kind":"pith_short_12","alias_value":"PC62673ACNG5","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PC62673ACNG5EIVQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PC62673A","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:895726d0c86371f78ff1956680500db5dd742d44cdc2270435e7b10e919ec509","target":"graph","created_at":"2026-05-18T02:29:31Z","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":"Traditional language processing tools constrain language designers to specific kinds of grammars. In contrast, model-based language processing tools decouple language design from language processing. These tools allow the occurrence of lexical and syntactic ambiguities in language specifications and the declarative specification of constraints for resolving them. As a result, these techniques require scanners and parsers able to parse context-free grammars, handle ambiguities, and enforce constraints for disambiguation. In this paper, we present Lamb and Fence. Lamb is a scanning algorithm tha","authors_text":"Fernando Berzal, Francisco J. Cortijo, Luis Quesada","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-11T15:11:15Z","title":"Scanning and Parsing Languages with Ambiguities and Constraints: The Lamb and Fence Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02795","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:0768f3cf8d3fc8b639e1dfe2b88243cf55fa3c1b9246e5232ea7b3edc54684c5","target":"record","created_at":"2026-05-18T02:29:31Z","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":"1433262bf94f77d7b664c6244d4fedf695c197ea382d9bdc32f28fdeeea95ef9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-11T15:11:15Z","title_canon_sha256":"af1e8e1ea724f3cd001a63d5eb2978f3d3586ee58d068e6c701a62d57d58e796"},"schema_version":"1.0","source":{"id":"1501.02795","kind":"arxiv","version":1}},"canonical_sha256":"78bdaf7f60134dd222b09b61758b87049b53f7650b9903579a942647b2882921","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78bdaf7f60134dd222b09b61758b87049b53f7650b9903579a942647b2882921","first_computed_at":"2026-05-18T02:29:31.177179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:31.177179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lfvuua2eDS8Z+g+ne+JJnabgJLyfRGe/tdhluNmM72qSDBOryof+EWGYn1/QyVx7utQCwSVoqL1nghqFmHw6DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:31.177678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0768f3cf8d3fc8b639e1dfe2b88243cf55fa3c1b9246e5232ea7b3edc54684c5","sha256:895726d0c86371f78ff1956680500db5dd742d44cdc2270435e7b10e919ec509"],"state_sha256":"0dc77247a2b12caffa865140e213b14da1aea77231ad0639d8a21e1b0aa91856"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QtH5TfnX+aKLFjuoFU55uLStN3f7aXalp4R1PPBAhpm2Q5ahZ3PDXldNWCj0mC7GDKf3AEItWppBoaMpfka7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:37:47.240143Z","bundle_sha256":"85dede1cb7930da08806e8cb1416e2121c6cb2bbae375875f4152b6a4b4462a2"}}