{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3JDDKX7OC52T2F2F6GCJIQK6VH","short_pith_number":"pith:3JDDKX7O","schema_version":"1.0","canonical_sha256":"da46355fee17753d1745f18494415ea9d859113ad61f11a52aca76c4bbae7b12","source":{"kind":"arxiv","id":"1211.0303","version":1},"attestation_state":"computed","paper":{"title":"Non-redundant random generation algorithms for weighted context-free languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.FL","authors_text":"Andy Lorenz, INRIA Saclay - Ile de France), Yann Ponty (LIX","submitted_at":"2012-11-01T20:33:15Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1211.0303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-11-01T20:33:15Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"e584a79e5a9bf42a17524790e698541ea846eccb82c1fa09646fcc1940b74511","abstract_canon_sha256":"b68453328b806be469cb417b3fa0174016526db9d6909e5585fb343f297a9b01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:41.614457Z","signature_b64":"YmobTCKiyb2T4cjeg4aGwSnj/fgTuWkkG2TK3eJqGF3YTRUImnNpqXSuW9lF9brPuNwGGnk3hEnips1+67xKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da46355fee17753d1745f18494415ea9d859113ad61f11a52aca76c4bbae7b12","last_reissued_at":"2026-05-18T03:41:41.613516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:41.613516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-redundant random generation algorithms for weighted context-free languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.FL","authors_text":"Andy Lorenz, INRIA Saclay - Ile de France), Yann Ponty (LIX","submitted_at":"2012-11-01T20:33:15Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0303","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.0303","created_at":"2026-05-18T03:41:41.613672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0303v1","created_at":"2026-05-18T03:41:41.613672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0303","created_at":"2026-05-18T03:41:41.613672+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JDDKX7OC52T","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JDDKX7OC52T2F2F","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JDDKX7O","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3JDDKX7OC52T2F2F6GCJIQK6VH","json":"https://pith.science/pith/3JDDKX7OC52T2F2F6GCJIQK6VH.json","graph_json":"https://pith.science/api/pith-number/3JDDKX7OC52T2F2F6GCJIQK6VH/graph.json","events_json":"https://pith.science/api/pith-number/3JDDKX7OC52T2F2F6GCJIQK6VH/events.json","paper":"https://pith.science/paper/3JDDKX7O"},"agent_actions":{"view_html":"https://pith.science/pith/3JDDKX7OC52T2F2F6GCJIQK6VH","download_json":"https://pith.science/pith/3JDDKX7OC52T2F2F6GCJIQK6VH.json","view_paper":"https://pith.science/paper/3JDDKX7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0303&json=true","fetch_graph":"https://pith.science/api/pith-number/3JDDKX7OC52T2F2F6GCJIQK6VH/graph.json","fetch_events":"https://pith.science/api/pith-number/3JDDKX7OC52T2F2F6GCJIQK6VH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JDDKX7OC52T2F2F6GCJIQK6VH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JDDKX7OC52T2F2F6GCJIQK6VH/action/storage_attestation","attest_author":"https://pith.science/pith/3JDDKX7OC52T2F2F6GCJIQK6VH/action/author_attestation","sign_citation":"https://pith.science/pith/3JDDKX7OC52T2F2F6GCJIQK6VH/action/citation_signature","submit_replication":"https://pith.science/pith/3JDDKX7OC52T2F2F6GCJIQK6VH/action/replication_record"}},"created_at":"2026-05-18T03:41:41.613672+00:00","updated_at":"2026-05-18T03:41:41.613672+00:00"}