{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2B726SR75CX7Q377LOLOWSY5RV","short_pith_number":"pith:2B726SR7","canonical_record":{"source":{"id":"1601.07724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-28T11:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"3a5fc3304748610f556d2b98a09b687b9f898ce9eb3d440ed9fcf720dab60e62","abstract_canon_sha256":"862264da68bc9f806e1da5301eeaa94a06466ec6a666497625d3616f2af9a989"},"schema_version":"1.0"},"canonical_sha256":"d07faf4a3fe8aff86fff5b96eb4b1d8d42bd4c7c9b7858c9b1e110b5ef2e3a01","source":{"kind":"arxiv","id":"1601.07724","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07724","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07724v2","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07724","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"2B726SR75CX7","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2B726SR75CX7Q377","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2B726SR7","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2B726SR75CX7Q377LOLOWSY5RV","target":"record","payload":{"canonical_record":{"source":{"id":"1601.07724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-28T11:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"3a5fc3304748610f556d2b98a09b687b9f898ce9eb3d440ed9fcf720dab60e62","abstract_canon_sha256":"862264da68bc9f806e1da5301eeaa94a06466ec6a666497625d3616f2af9a989"},"schema_version":"1.0"},"canonical_sha256":"d07faf4a3fe8aff86fff5b96eb4b1d8d42bd4c7c9b7858c9b1e110b5ef2e3a01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:23.817892Z","signature_b64":"s/d294VNS2IRShn1RhlwVw0fGkk1kpSluxnQeHy5MHH0abDx9hlFajrYDWfZFKd0fMkMbTgt87l8ZGVXhsrqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d07faf4a3fe8aff86fff5b96eb4b1d8d42bd4c7c9b7858c9b1e110b5ef2e3a01","last_reissued_at":"2026-05-17T23:51:23.817305Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:23.817305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.07724","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:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IpTCYjZB/m1viQGoXZ8f19ibJwC06wOlgXNvsOvXyxEazfGKAGqeEcGLx8GDJjzlKpi5VvSdy+WjWMT2K7NtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:03:46.760060Z"},"content_sha256":"c782afa8c1f55125ff7c3860d8591ce8d4c1bd65e1a87e0c214b9139f6b8b14d","schema_version":"1.0","event_id":"sha256:c782afa8c1f55125ff7c3860d8591ce8d4c1bd65e1a87e0c214b9139f6b8b14d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2B726SR75CX7Q377LOLOWSY5RV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jean-Philippe Bernardy, Patrik Jansson","submitted_at":"2016-01-28T11:07:18Z","abstract_excerpt":"Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose. In this paper, we present an algebraic specification, implementation, and proof of correctness of a generalisation of Valiant's algorithm. The generalisation can be used for recognition, parsing or generic calculation of the transitive closure of upper triangular matrices. The proof is certified by the Agda proof assistant. The certification is representative of state-of-the-art methods for specification and proofs in p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07724","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:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TNwSF6Nhy5ItJ4idztq3A56Vzl8EJWyNlqJlWMz47+aKed15ELw2nbHgFQwbHApPwUAD4xRJfcLsVcYVr2S2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:03:46.760449Z"},"content_sha256":"9b06ecfc6ccdca13d071a6197f293906898ddd96f90359cf12ed932643c6c7ac","schema_version":"1.0","event_id":"sha256:9b06ecfc6ccdca13d071a6197f293906898ddd96f90359cf12ed932643c6c7ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2B726SR75CX7Q377LOLOWSY5RV/bundle.json","state_url":"https://pith.science/pith/2B726SR75CX7Q377LOLOWSY5RV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2B726SR75CX7Q377LOLOWSY5RV/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-24T22:03:46Z","links":{"resolver":"https://pith.science/pith/2B726SR75CX7Q377LOLOWSY5RV","bundle":"https://pith.science/pith/2B726SR75CX7Q377LOLOWSY5RV/bundle.json","state":"https://pith.science/pith/2B726SR75CX7Q377LOLOWSY5RV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2B726SR75CX7Q377LOLOWSY5RV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2B726SR75CX7Q377LOLOWSY5RV","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":"862264da68bc9f806e1da5301eeaa94a06466ec6a666497625d3616f2af9a989","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-28T11:07:18Z","title_canon_sha256":"3a5fc3304748610f556d2b98a09b687b9f898ce9eb3d440ed9fcf720dab60e62"},"schema_version":"1.0","source":{"id":"1601.07724","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07724","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07724v2","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07724","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"2B726SR75CX7","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2B726SR75CX7Q377","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2B726SR7","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:9b06ecfc6ccdca13d071a6197f293906898ddd96f90359cf12ed932643c6c7ac","target":"graph","created_at":"2026-05-17T23:51:23Z","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":"Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose. In this paper, we present an algebraic specification, implementation, and proof of correctness of a generalisation of Valiant's algorithm. The generalisation can be used for recognition, parsing or generic calculation of the transitive closure of upper triangular matrices. The proof is certified by the Agda proof assistant. The certification is representative of state-of-the-art methods for specification and proofs in p","authors_text":"Jean-Philippe Bernardy, Patrik Jansson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-28T11:07:18Z","title":"Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07724","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:c782afa8c1f55125ff7c3860d8591ce8d4c1bd65e1a87e0c214b9139f6b8b14d","target":"record","created_at":"2026-05-17T23:51:23Z","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":"862264da68bc9f806e1da5301eeaa94a06466ec6a666497625d3616f2af9a989","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-28T11:07:18Z","title_canon_sha256":"3a5fc3304748610f556d2b98a09b687b9f898ce9eb3d440ed9fcf720dab60e62"},"schema_version":"1.0","source":{"id":"1601.07724","kind":"arxiv","version":2}},"canonical_sha256":"d07faf4a3fe8aff86fff5b96eb4b1d8d42bd4c7c9b7858c9b1e110b5ef2e3a01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d07faf4a3fe8aff86fff5b96eb4b1d8d42bd4c7c9b7858c9b1e110b5ef2e3a01","first_computed_at":"2026-05-17T23:51:23.817305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:23.817305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s/d294VNS2IRShn1RhlwVw0fGkk1kpSluxnQeHy5MHH0abDx9hlFajrYDWfZFKd0fMkMbTgt87l8ZGVXhsrqCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:23.817892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07724","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c782afa8c1f55125ff7c3860d8591ce8d4c1bd65e1a87e0c214b9139f6b8b14d","sha256:9b06ecfc6ccdca13d071a6197f293906898ddd96f90359cf12ed932643c6c7ac"],"state_sha256":"214641702f34b6ca893a8a133fc2bda726d8c9af92931987ad1285c6fedac1e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a4lk4YJlY6TS/O9QkfVjA/Y5nIHi42Huqt1w7KSPBhcVSXqLQVY7kP+vph2/S7MATn6uoqkUNNUMLcBtvfb4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:03:46.762349Z","bundle_sha256":"87b864d4be363dd5797758f5d2c508e1fa83d9c1fc4aecedccafc27c1a8aff54"}}