{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KPEFXTFHAG2OVIV5RXMUPB5TLS","short_pith_number":"pith:KPEFXTFH","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"},"canonical_sha256":"53c85bcca701b4eaa2bd8dd94787b35c83b3075ddb5576f57c036a1953085ed6","source":{"kind":"arxiv","id":"1012.4560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4560","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4560v1","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4560","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"KPEFXTFHAG2O","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KPEFXTFHAG2OVIV5","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KPEFXTFH","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KPEFXTFHAG2OVIV5RXMUPB5TLS","target":"record","payload":{"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"},"canonical_sha256":"53c85bcca701b4eaa2bd8dd94787b35c83b3075ddb5576f57c036a1953085ed6","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"},"source_kind":"arxiv","source_id":"1012.4560","source_version":1,"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-18T04:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMPeJYRdWL6jac0odTEenWR/m89X9nifYQggqJf55g1JEk+Yf8t5X0jw2gkgG29urwXmoskDE/6kyXjjpXt/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:33:04.987473Z"},"content_sha256":"4ef964ecbfa59958cecc7987d7bf3ba8c561cb082f3477448257702b883ad41a","schema_version":"1.0","event_id":"sha256:4ef964ecbfa59958cecc7987d7bf3ba8c561cb082f3477448257702b883ad41a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KPEFXTFHAG2OVIV5RXMUPB5TLS","target":"graph","payload":{"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"},"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-18T04:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SP+nupLBSKXHQ00o4s8911WVlpmgIxTe6p9UNN/qIPIpPEtSvp/mRNVUVk7SUNsE3hckynGTbqJikSqjIsNDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:33:04.987825Z"},"content_sha256":"ef43155a73022172670557721224102e7bd67caec6b356767d3778cb5ff21fd2","schema_version":"1.0","event_id":"sha256:ef43155a73022172670557721224102e7bd67caec6b356767d3778cb5ff21fd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/bundle.json","state_url":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/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-05-28T08:33:04Z","links":{"resolver":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS","bundle":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/bundle.json","state":"https://pith.science/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPEFXTFHAG2OVIV5RXMUPB5TLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KPEFXTFHAG2OVIV5RXMUPB5TLS","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":"22651818bd9c8f5632001be9dca7a88f4bcf039762073f49eee50365579effdd","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-21T07:43:34Z","title_canon_sha256":"7fe62db1c5c25bfa9bb9e3d6e64b3295b6bdb5171da87669fc41370972f97854"},"schema_version":"1.0","source":{"id":"1012.4560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4560","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4560v1","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4560","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"KPEFXTFHAG2O","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KPEFXTFHAG2OVIV5","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KPEFXTFH","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:ef43155a73022172670557721224102e7bd67caec6b356767d3778cb5ff21fd2","target":"graph","created_at":"2026-05-18T04:32:54Z","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 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","authors_text":"LIX), Yann Ponty (INRIA Saclay - Ile de France","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-21T07:43:34Z","title":"Non-redundant random generation from weighted context-free languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4560","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:4ef964ecbfa59958cecc7987d7bf3ba8c561cb082f3477448257702b883ad41a","target":"record","created_at":"2026-05-18T04:32:54Z","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":"22651818bd9c8f5632001be9dca7a88f4bcf039762073f49eee50365579effdd","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-21T07:43:34Z","title_canon_sha256":"7fe62db1c5c25bfa9bb9e3d6e64b3295b6bdb5171da87669fc41370972f97854"},"schema_version":"1.0","source":{"id":"1012.4560","kind":"arxiv","version":1}},"canonical_sha256":"53c85bcca701b4eaa2bd8dd94787b35c83b3075ddb5576f57c036a1953085ed6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53c85bcca701b4eaa2bd8dd94787b35c83b3075ddb5576f57c036a1953085ed6","first_computed_at":"2026-05-18T04:32:54.097454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:54.097454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"USSEx86vvI13Cmij6jeRbiEePKpLNshaQ14dxJh/Da2Cri2WjqiVjR4hMt6oRjJDiFoUXCV21lZKu9uUIrSgDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:54.097862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.4560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ef964ecbfa59958cecc7987d7bf3ba8c561cb082f3477448257702b883ad41a","sha256:ef43155a73022172670557721224102e7bd67caec6b356767d3778cb5ff21fd2"],"state_sha256":"d8ed63672674061ac8208109d8eeac7b5653b5760dc5d73d7d699ec2d248b546"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yw8yCU2UK/o4JOR6CMR7PS5emNAlCPJLnPi3Vb2hg7DB3LJz0K6rfKhsBOPhud+ZMLLrgl6kX4FeYTGcJAEABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:33:04.989764Z","bundle_sha256":"2bd8921e8df355d859cf0045adb6f0f52ba13a2c337f999cdfc8ec6662f1874f"}}