{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2TQP4WAAT7CKP3A4FQWMKYGGQH","short_pith_number":"pith:2TQP4WAA","canonical_record":{"source":{"id":"2408.01849","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2024-08-03T19:04:09Z","cross_cats_sorted":[],"title_canon_sha256":"2fb90ba8baaf9e58270c8458caf4c0c2f87610d5f94f267c831903e33fb0866d","abstract_canon_sha256":"54e5281b9d3e048d49ff391f9cd3ada9f726214c6f46def0e5c8fb1aebc96766"},"schema_version":"1.0"},"canonical_sha256":"d4e0fe58009fc4a7ec1c2c2cc560c681cdf88fd9b6a5333ced970ef6ceff76c5","source":{"kind":"arxiv","id":"2408.01849","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.01849","created_at":"2026-07-05T08:54:36Z"},{"alias_kind":"arxiv_version","alias_value":"2408.01849v2","created_at":"2026-07-05T08:54:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.01849","created_at":"2026-07-05T08:54:36Z"},{"alias_kind":"pith_short_12","alias_value":"2TQP4WAAT7CK","created_at":"2026-07-05T08:54:36Z"},{"alias_kind":"pith_short_16","alias_value":"2TQP4WAAT7CKP3A4","created_at":"2026-07-05T08:54:36Z"},{"alias_kind":"pith_short_8","alias_value":"2TQP4WAA","created_at":"2026-07-05T08:54:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2TQP4WAAT7CKP3A4FQWMKYGGQH","target":"record","payload":{"canonical_record":{"source":{"id":"2408.01849","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2024-08-03T19:04:09Z","cross_cats_sorted":[],"title_canon_sha256":"2fb90ba8baaf9e58270c8458caf4c0c2f87610d5f94f267c831903e33fb0866d","abstract_canon_sha256":"54e5281b9d3e048d49ff391f9cd3ada9f726214c6f46def0e5c8fb1aebc96766"},"schema_version":"1.0"},"canonical_sha256":"d4e0fe58009fc4a7ec1c2c2cc560c681cdf88fd9b6a5333ced970ef6ceff76c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:54:36.891089Z","signature_b64":"Nva0oV16msI54I2dIxyaJe+L21KrepjItbauaUGB0ihRFT9UehzRtM7ECqlqye4NsZmmTPdnz1UNTkEtCcFgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4e0fe58009fc4a7ec1c2c2cc560c681cdf88fd9b6a5333ced970ef6ceff76c5","last_reissued_at":"2026-07-05T08:54:36.890671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:54:36.890671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.01849","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-05T08:54:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ai+LZnscD6pJrJ+s5JXFHB78jDntC4PdKaHdpliDhlOJugfC+/EUA3za+WFYliGJCYalUVu4GcX4w+dy8wNgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T07:58:19.235244Z"},"content_sha256":"b411c51321465306a8a1663e44cd2df333894f5596e0bee3c1000fbf11329add","schema_version":"1.0","event_id":"sha256:b411c51321465306a8a1663e44cd2df333894f5596e0bee3c1000fbf11329add"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2TQP4WAAT7CKP3A4FQWMKYGGQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tree Sampler for Bounded Context-Free Languages","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Breandan Considine","submitted_at":"2024-08-03T19:04:09Z","abstract_excerpt":"In the following paper, we present a simple method for sampling trees with or without replacement from BCFLs. A BCFL is a context-free language (CFL) corresponding to an incomplete string with holes, which can be completed by valid terminals. To solve this problem, we introduce an algebraic datatype that compactly represents candidate parse forests for porous strings. Once constructed, sampling trees is a straightforward matter of sampling integers uniformly without replacement, then lazily decoding them into trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.01849","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/2408.01849/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:54:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+0zLFD3xxziTa8MXRfqjoLFwgaP86bFFkclG7JwsS4DF7B2FOHGgaa8HqgREA1mDAeWICgsTfPV1WPp9gqfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T07:58:19.235625Z"},"content_sha256":"e2f74890628168517ebf0af0c6ebf2114b1714d7908519c8cdcc9b0e28f22d2d","schema_version":"1.0","event_id":"sha256:e2f74890628168517ebf0af0c6ebf2114b1714d7908519c8cdcc9b0e28f22d2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2TQP4WAAT7CKP3A4FQWMKYGGQH/bundle.json","state_url":"https://pith.science/pith/2TQP4WAAT7CKP3A4FQWMKYGGQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2TQP4WAAT7CKP3A4FQWMKYGGQH/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-07-21T07:58:19Z","links":{"resolver":"https://pith.science/pith/2TQP4WAAT7CKP3A4FQWMKYGGQH","bundle":"https://pith.science/pith/2TQP4WAAT7CKP3A4FQWMKYGGQH/bundle.json","state":"https://pith.science/pith/2TQP4WAAT7CKP3A4FQWMKYGGQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2TQP4WAAT7CKP3A4FQWMKYGGQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2TQP4WAAT7CKP3A4FQWMKYGGQH","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":"54e5281b9d3e048d49ff391f9cd3ada9f726214c6f46def0e5c8fb1aebc96766","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2024-08-03T19:04:09Z","title_canon_sha256":"2fb90ba8baaf9e58270c8458caf4c0c2f87610d5f94f267c831903e33fb0866d"},"schema_version":"1.0","source":{"id":"2408.01849","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.01849","created_at":"2026-07-05T08:54:36Z"},{"alias_kind":"arxiv_version","alias_value":"2408.01849v2","created_at":"2026-07-05T08:54:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.01849","created_at":"2026-07-05T08:54:36Z"},{"alias_kind":"pith_short_12","alias_value":"2TQP4WAAT7CK","created_at":"2026-07-05T08:54:36Z"},{"alias_kind":"pith_short_16","alias_value":"2TQP4WAAT7CKP3A4","created_at":"2026-07-05T08:54:36Z"},{"alias_kind":"pith_short_8","alias_value":"2TQP4WAA","created_at":"2026-07-05T08:54:36Z"}],"graph_snapshots":[{"event_id":"sha256:e2f74890628168517ebf0af0c6ebf2114b1714d7908519c8cdcc9b0e28f22d2d","target":"graph","created_at":"2026-07-05T08:54:36Z","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/2408.01849/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the following paper, we present a simple method for sampling trees with or without replacement from BCFLs. A BCFL is a context-free language (CFL) corresponding to an incomplete string with holes, which can be completed by valid terminals. To solve this problem, we introduce an algebraic datatype that compactly represents candidate parse forests for porous strings. Once constructed, sampling trees is a straightforward matter of sampling integers uniformly without replacement, then lazily decoding them into trees.","authors_text":"Breandan Considine","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2024-08-03T19:04:09Z","title":"A Tree Sampler for Bounded Context-Free Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.01849","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:b411c51321465306a8a1663e44cd2df333894f5596e0bee3c1000fbf11329add","target":"record","created_at":"2026-07-05T08:54:36Z","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":"54e5281b9d3e048d49ff391f9cd3ada9f726214c6f46def0e5c8fb1aebc96766","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2024-08-03T19:04:09Z","title_canon_sha256":"2fb90ba8baaf9e58270c8458caf4c0c2f87610d5f94f267c831903e33fb0866d"},"schema_version":"1.0","source":{"id":"2408.01849","kind":"arxiv","version":2}},"canonical_sha256":"d4e0fe58009fc4a7ec1c2c2cc560c681cdf88fd9b6a5333ced970ef6ceff76c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4e0fe58009fc4a7ec1c2c2cc560c681cdf88fd9b6a5333ced970ef6ceff76c5","first_computed_at":"2026-07-05T08:54:36.890671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:54:36.890671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nva0oV16msI54I2dIxyaJe+L21KrepjItbauaUGB0ihRFT9UehzRtM7ECqlqye4NsZmmTPdnz1UNTkEtCcFgDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:54:36.891089Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.01849","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b411c51321465306a8a1663e44cd2df333894f5596e0bee3c1000fbf11329add","sha256:e2f74890628168517ebf0af0c6ebf2114b1714d7908519c8cdcc9b0e28f22d2d"],"state_sha256":"da20e7b66c74d1ed0727f8a16379fd72e948e74ae93e7e0a0fdabfebb418f421"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"haEfICxKNueN6KfWJgdx3kG3ev6r6owEGZ7xRGAnhehF02f5PZB4cLpKEVQDBVYVGeqXwFHDZS4yZ4fML+oXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T07:58:19.238203Z","bundle_sha256":"4b11ce5cbd25d38dbfceca6f40e0f97a3a63fc8d876b7fcda00bc1f08e410630"}}