{"id":22173552,"url":"https://github.com/jlumbroso/boltzoc","last_synced_at":"2025-07-31T06:07:06.260Z","repository":{"id":87028286,"uuid":"126847730","full_name":"jlumbroso/boltzoc","owner":"jlumbroso","description":"Fast, Standalone Oracle for Analytic Sampling of Trees","archived":false,"fork":false,"pushed_at":"2018-06-14T23:37:09.000Z","size":33,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-24T17:53:31.676Z","etag":null,"topics":["analytic-combinatorics","analytic-samplers","combinatorics","random-generation"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/jlumbroso.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-03-26T15:13:19.000Z","updated_at":"2021-06-18T04:30:58.000Z","dependencies_parsed_at":"2023-05-30T06:30:08.615Z","dependency_job_id":null,"html_url":"https://github.com/jlumbroso/boltzoc","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/jlumbroso/boltzoc","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jlumbroso%2Fboltzoc","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jlumbroso%2Fboltzoc/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jlumbroso%2Fboltzoc/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jlumbroso%2Fboltzoc/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jlumbroso","download_url":"https://codeload.github.com/jlumbroso/boltzoc/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jlumbroso%2Fboltzoc/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267997149,"owners_count":24178249,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-07-31T02:00:08.723Z","response_time":66,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["analytic-combinatorics","analytic-samplers","combinatorics","random-generation"],"created_at":"2024-12-02T07:34:00.121Z","updated_at":"2025-07-31T06:07:06.203Z","avatar_url":"https://github.com/jlumbroso.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Fast, Standalone Boltzmann Sampler Oracle for Trees\n\nThis repository contains a fast, standalone C implementation of \"oracle\"\nnecessary to find the singularity (first positive real value at which the\n  generating function diverges) for the generating functions of tree-like\ncombinatorial structures.\n\n## Acknowledgment\n\nThis software was originally implemented by [Alexis Darrasse](https://scholar.google.com/citations?user=gv78_KoAAAAJ\u0026hl=en) in 2010,\nin the context of his doctoral thesis.\n\n## Bibliography\n\nDarrasse, Alexis (2010). \"[Structures arborescentes complexes: analyse combinatoire, génération aléatoire et applications.](http://www.ortsa.com/lip6_these/docs/these.pdf)\" (Doctoral dissertation, Paris 6).\n\nDuchon, Philippe, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer (2004). \"[Boltzmann samplers for the random generation of combinatorial structures.](http://algo.inria.fr/flajolet/Publications/DuFlLoSc04.pdf)\" *Combinatorics, Probability and Computing*, 13(4-5), 577-625.\n\nPivoteau, Carine, Bruno Salvy and Michèle Soria (2012). \"[Algorithms for combinatorial structures: Well-founded systems and Newton iterations.](https://arxiv.org/abs/1109.2688)\" *Journal of Combinatorial Theory, Series A*, 119(8), 1711-1773.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjlumbroso%2Fboltzoc","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjlumbroso%2Fboltzoc","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjlumbroso%2Fboltzoc/lists"}