{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3JDDKX7OC52T2F2F6GCJIQK6VH","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":"b68453328b806be469cb417b3fa0174016526db9d6909e5585fb343f297a9b01","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-11-01T20:33:15Z","title_canon_sha256":"e584a79e5a9bf42a17524790e698541ea846eccb82c1fa09646fcc1940b74511"},"schema_version":"1.0","source":{"id":"1211.0303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0303","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0303v1","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0303","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"3JDDKX7OC52T","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3JDDKX7OC52T2F2F","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3JDDKX7O","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:13010ac117eb6eb62aeb89aa29944aad76a6033865eaa877adbcddf381295c4e","target":"graph","created_at":"2026-05-18T03:41:41Z","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":"We address the non-redundant random generation of $k$ words of length $n$ in a context-free language. Additionally, we want to avoid a predefined set of words. We study a rejection-based approach, whose worst-case time complexity is shown to grow exponentially with $k$ for some specifications and in the limit case of a coupon collector. We propose two algorithms respectively based on the recursive method and on an unranking approach. We show how careful implementations of these algorithms allow for a non-redundant generation of $k$ words of length $n$ in $\\mathcal{O}(k\\cdot n\\cdot \\log{n})$ ar","authors_text":"Andy Lorenz, INRIA Saclay - Ile de France), Yann Ponty (LIX","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-11-01T20:33:15Z","title":"Non-redundant random generation algorithms for weighted context-free languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0303","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:40ff7d1069036e7b9351841d5cad881ce8e5b3a17f4458a6f2107749d7f32dbb","target":"record","created_at":"2026-05-18T03:41:41Z","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":"b68453328b806be469cb417b3fa0174016526db9d6909e5585fb343f297a9b01","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-11-01T20:33:15Z","title_canon_sha256":"e584a79e5a9bf42a17524790e698541ea846eccb82c1fa09646fcc1940b74511"},"schema_version":"1.0","source":{"id":"1211.0303","kind":"arxiv","version":1}},"canonical_sha256":"da46355fee17753d1745f18494415ea9d859113ad61f11a52aca76c4bbae7b12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da46355fee17753d1745f18494415ea9d859113ad61f11a52aca76c4bbae7b12","first_computed_at":"2026-05-18T03:41:41.613516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:41.613516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YmobTCKiyb2T4cjeg4aGwSnj/fgTuWkkG2TK3eJqGF3YTRUImnNpqXSuW9lF9brPuNwGGnk3hEnips1+67xKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:41.614457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40ff7d1069036e7b9351841d5cad881ce8e5b3a17f4458a6f2107749d7f32dbb","sha256:13010ac117eb6eb62aeb89aa29944aad76a6033865eaa877adbcddf381295c4e"],"state_sha256":"a152134e1e29063b79e1e20b61cd239dc96c9000a86511c0205650f5dce537ea"}