{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NO2W44CJ4U3ZCRYI4F2DGKFJUC","short_pith_number":"pith:NO2W44CJ","canonical_record":{"source":{"id":"1509.02439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-08T16:43:53Z","cross_cats_sorted":[],"title_canon_sha256":"e6f571222b40d3f5aa0f54de2df02215ad9fc96c55e464cc830653519f2dfab0","abstract_canon_sha256":"56cfd306f89177265e5938e997f102e71fce0a368b5407c8d327676d1c956dfb"},"schema_version":"1.0"},"canonical_sha256":"6bb56e7049e537914708e1743328a9a0942c0b7177f8bf315f3b848feb848ecb","source":{"kind":"arxiv","id":"1509.02439","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02439","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02439v2","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02439","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"NO2W44CJ4U3Z","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NO2W44CJ4U3ZCRYI","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NO2W44CJ","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NO2W44CJ4U3ZCRYI4F2DGKFJUC","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-08T16:43:53Z","cross_cats_sorted":[],"title_canon_sha256":"e6f571222b40d3f5aa0f54de2df02215ad9fc96c55e464cc830653519f2dfab0","abstract_canon_sha256":"56cfd306f89177265e5938e997f102e71fce0a368b5407c8d327676d1c956dfb"},"schema_version":"1.0"},"canonical_sha256":"6bb56e7049e537914708e1743328a9a0942c0b7177f8bf315f3b848feb848ecb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:30.099736Z","signature_b64":"DsZxmuTJXG7XUx5axL6WIfAMxKqd8rd3ZAkXTvkjWbwK2JKr0SYkFxomBhTV4xjJsr2UwhKcrS1sKGFNahe7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bb56e7049e537914708e1743328a9a0942c0b7177f8bf315f3b848feb848ecb","last_reissued_at":"2026-05-18T01:04:30.099162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:30.099162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02439","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-18T01:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80prv6p0NX7hk0E0C13iR98KVS2PjLq6R4P5HDl9zEtemSR94mbSBOF5xClyfXU3ya7VcWnKNZG9/SpQIOjiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:29:23.641853Z"},"content_sha256":"225dab67c7118fbaef710742c1b77cd7d899290cdbbae4d4aec7a3d69da0fbf9","schema_version":"1.0","event_id":"sha256:225dab67c7118fbaef710742c1b77cd7d899290cdbbae4d4aec7a3d69da0fbf9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NO2W44CJ4U3ZCRYI4F2DGKFJUC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parsing Expression Grammars Made Practical","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Kim Mens, Nicolas Laurent","submitted_at":"2015-09-08T16:43:53Z","abstract_excerpt":"Parsing Expression Grammars (PEGs) define languages by specifying recursive-descent parser that recognises them. The PEG formalism exhibits desirable properties, such as closure under composition, built-in disambiguation, unification of syntactic and lexical concerns, and closely matching programmer intuition. Unfortunately, state of the art PEG parsers struggle with left-recursive grammar rules, which are not supported by the original definition of the formalism and can lead to infinite recursion under naive implementations. Likewise, support for associativity and explicit precedence is spott"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02439","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-18T01:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71aHpagsFi0jKSjOLuAk2CCBpFQVuGFdI3DROSfQiU58YMIHPDwOBra8ngTqBF2XEKIRnmZxDV7wCrG0cxEfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:29:23.642198Z"},"content_sha256":"0ca6a4f97e0763bf844bee0bb60682f19e7877b2927a0a1af36a1f5428059d90","schema_version":"1.0","event_id":"sha256:0ca6a4f97e0763bf844bee0bb60682f19e7877b2927a0a1af36a1f5428059d90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NO2W44CJ4U3ZCRYI4F2DGKFJUC/bundle.json","state_url":"https://pith.science/pith/NO2W44CJ4U3ZCRYI4F2DGKFJUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NO2W44CJ4U3ZCRYI4F2DGKFJUC/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-12T10:29:23Z","links":{"resolver":"https://pith.science/pith/NO2W44CJ4U3ZCRYI4F2DGKFJUC","bundle":"https://pith.science/pith/NO2W44CJ4U3ZCRYI4F2DGKFJUC/bundle.json","state":"https://pith.science/pith/NO2W44CJ4U3ZCRYI4F2DGKFJUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NO2W44CJ4U3ZCRYI4F2DGKFJUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NO2W44CJ4U3ZCRYI4F2DGKFJUC","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":"56cfd306f89177265e5938e997f102e71fce0a368b5407c8d327676d1c956dfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-08T16:43:53Z","title_canon_sha256":"e6f571222b40d3f5aa0f54de2df02215ad9fc96c55e464cc830653519f2dfab0"},"schema_version":"1.0","source":{"id":"1509.02439","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02439","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02439v2","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02439","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"NO2W44CJ4U3Z","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NO2W44CJ4U3ZCRYI","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NO2W44CJ","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:0ca6a4f97e0763bf844bee0bb60682f19e7877b2927a0a1af36a1f5428059d90","target":"graph","created_at":"2026-05-18T01:04:30Z","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":"Parsing Expression Grammars (PEGs) define languages by specifying recursive-descent parser that recognises them. The PEG formalism exhibits desirable properties, such as closure under composition, built-in disambiguation, unification of syntactic and lexical concerns, and closely matching programmer intuition. Unfortunately, state of the art PEG parsers struggle with left-recursive grammar rules, which are not supported by the original definition of the formalism and can lead to infinite recursion under naive implementations. Likewise, support for associativity and explicit precedence is spott","authors_text":"Kim Mens, Nicolas Laurent","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-08T16:43:53Z","title":"Parsing Expression Grammars Made Practical"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02439","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:225dab67c7118fbaef710742c1b77cd7d899290cdbbae4d4aec7a3d69da0fbf9","target":"record","created_at":"2026-05-18T01:04:30Z","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":"56cfd306f89177265e5938e997f102e71fce0a368b5407c8d327676d1c956dfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-08T16:43:53Z","title_canon_sha256":"e6f571222b40d3f5aa0f54de2df02215ad9fc96c55e464cc830653519f2dfab0"},"schema_version":"1.0","source":{"id":"1509.02439","kind":"arxiv","version":2}},"canonical_sha256":"6bb56e7049e537914708e1743328a9a0942c0b7177f8bf315f3b848feb848ecb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bb56e7049e537914708e1743328a9a0942c0b7177f8bf315f3b848feb848ecb","first_computed_at":"2026-05-18T01:04:30.099162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:30.099162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DsZxmuTJXG7XUx5axL6WIfAMxKqd8rd3ZAkXTvkjWbwK2JKr0SYkFxomBhTV4xjJsr2UwhKcrS1sKGFNahe7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:30.099736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02439","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:225dab67c7118fbaef710742c1b77cd7d899290cdbbae4d4aec7a3d69da0fbf9","sha256:0ca6a4f97e0763bf844bee0bb60682f19e7877b2927a0a1af36a1f5428059d90"],"state_sha256":"e8c50c16cef57268d100b80de06d1c479ffce31ecef260985f9e4db891f3fd6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nokEAikpNvF8232AOOy0aNTl3UHmGIZHhmkJzXzo+Hq8ed/rp8hcF2bGVIzyAKBZAFBe9F+qN2REP+fH3R4/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:29:23.644062Z","bundle_sha256":"89d1f13efc549ca45811e10267618213e2a905ef922430bec979d35395f21c5b"}}