{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KPEFXTFHAG2OVIV5RXMUPB5TLS","short_pith_number":"pith:KPEFXTFH","schema_version":"1.0","canonical_sha256":"53c85bcca701b4eaa2bd8dd94787b35c83b3075ddb5576f57c036a1953085ed6","source":{"kind":"arxiv","id":"1012.4560","version":1},"attestation_state":"computed","paper":{"title":"Non-redundant random generation from weighted context-free languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"LIX), Yann Ponty (INRIA Saclay - Ile de France","submitted_at":"2010-12-21T07:43:34Z","abstract_excerpt":"We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of a rejection-based approach, whose time complexity is shown to grow exponentially in k in some cases. We propose an alternative recursive algorithm, whose careful implementation allows for a non-redundant generation of k words of size n in O(kn log n) arithmetic operations after the precomputation of O(n) numbers. The overall complexity is therefore dominated by the generation of k words, and the non-redundancy comes"},"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":"1012.4560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-21T07:43:34Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"7fe62db1c5c25bfa9bb9e3d6e64b3295b6bdb5171da87669fc41370972f97854","abstract_canon_sha256":"22651818bd9c8f5632001be9dca7a88f4bcf039762073f49eee50365579effdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:54.097862Z","signature_b64":"USSEx86vvI13Cmij6jeRbiEePKpLNshaQ14dxJh/Da2Cri2WjqiVjR4hMt6oRjJDiFoUXCV21lZKu9uUIrSgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53c85bcca701b4eaa2bd8dd94787b35c83b3075ddb5576f57c036a1953085ed6","last_reissued_at":"2026-05-18T04:32:54.097454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:54.097454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-redundant random generation from weighted context-free languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"LIX), Yann Ponty (INRIA Saclay - Ile de France","submitted_at":"2010-12-21T07:43:34Z","abstract_excerpt":"We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of a rejection-based approach, whose time complexity is shown to grow exponentially in k in some cases. We propose an alternative recursive algorithm, whose careful implementation allows for a non-redundant generation of k words of size n in O(kn log n) arithmetic operations after the precomputation of O(n) numbers. The overall complexity is therefore dominated by the generation of k words, and the non-redundancy comes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4560","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":"1012.4560","created_at":"2026-05-18T04:32:54.097515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.4560v1","created_at":"2026-05-18T04:32:54.097515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4560","created_at":"2026-05-18T04:32:54.097515+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPEFXTFHAG2O","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPEFXTFHAG2OVIV5","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPEFXTFH","created_at":"2026-05-18T12:26:09.077623+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/KPEFXTFHAG2OVIV5RXMUPB5TLS","json":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS.json","graph_json":"https://pith.science/api/pith-number/KPEFXTFHAG2OVIV5RXMUPB5TLS/graph.json","events_json":"https://pith.science/api/pith-number/KPEFXTFHAG2OVIV5RXMUPB5TLS/events.json","paper":"https://pith.science/paper/KPEFXTFH"},"agent_actions":{"view_html":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS","download_json":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS.json","view_paper":"https://pith.science/paper/KPEFXTFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.4560&json=true","fetch_graph":"https://pith.science/api/pith-number/KPEFXTFHAG2OVIV5RXMUPB5TLS/graph.json","fetch_events":"https://pith.science/api/pith-number/KPEFXTFHAG2OVIV5RXMUPB5TLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/action/storage_attestation","attest_author":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/action/author_attestation","sign_citation":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/action/citation_signature","submit_replication":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/action/replication_record"}},"created_at":"2026-05-18T04:32:54.097515+00:00","updated_at":"2026-05-18T04:32:54.097515+00:00"}