{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VPDSJ4MYG5IKEEW7FLGEF4IZAP","short_pith_number":"pith:VPDSJ4MY","schema_version":"1.0","canonical_sha256":"abc724f1983750a212df2acc42f11903ff806530d4f9695053a00b92f1b4dcc7","source":{"kind":"arxiv","id":"1109.5683","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic enumeration of Minimal Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Andrea Sportiello, Frederique Bassino, Julien David","submitted_at":"2011-09-26T19:39:56Z","abstract_excerpt":"We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial distribution over terminal states, with arbitrary parameter b. It turns out that a fraction ~ 1-C(k,b) n^{-k+2} of automata is minimal, with C(k,b) a function, explicitly determined, involving the solution of a transcendental equation."},"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":"1109.5683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-09-26T19:39:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"006d95811269c9412efd5d5c09ce8830a39b05a222c597eed08ed051431d3676","abstract_canon_sha256":"6005424a06b0f8868af7693df3384b6356b15d50715176c648abe28bfcf3654b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:19.017432Z","signature_b64":"Q6a5pf6ydZ6MlyM0CAtKwOTnD8vRh5hZ3TWaF/G214M4CggJTMNF5Xg/EY+xKLto9zqVmx7QGuDBI6C25bozCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abc724f1983750a212df2acc42f11903ff806530d4f9695053a00b92f1b4dcc7","last_reissued_at":"2026-05-18T04:12:19.016984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:19.016984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic enumeration of Minimal Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Andrea Sportiello, Frederique Bassino, Julien David","submitted_at":"2011-09-26T19:39:56Z","abstract_excerpt":"We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial distribution over terminal states, with arbitrary parameter b. It turns out that a fraction ~ 1-C(k,b) n^{-k+2} of automata is minimal, with C(k,b) a function, explicitly determined, involving the solution of a transcendental equation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5683","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":"1109.5683","created_at":"2026-05-18T04:12:19.017048+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5683v1","created_at":"2026-05-18T04:12:19.017048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5683","created_at":"2026-05-18T04:12:19.017048+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPDSJ4MYG5IK","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPDSJ4MYG5IKEEW7","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPDSJ4MY","created_at":"2026-05-18T12:26:44.992195+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/VPDSJ4MYG5IKEEW7FLGEF4IZAP","json":"https://pith.science/pith/VPDSJ4MYG5IKEEW7FLGEF4IZAP.json","graph_json":"https://pith.science/api/pith-number/VPDSJ4MYG5IKEEW7FLGEF4IZAP/graph.json","events_json":"https://pith.science/api/pith-number/VPDSJ4MYG5IKEEW7FLGEF4IZAP/events.json","paper":"https://pith.science/paper/VPDSJ4MY"},"agent_actions":{"view_html":"https://pith.science/pith/VPDSJ4MYG5IKEEW7FLGEF4IZAP","download_json":"https://pith.science/pith/VPDSJ4MYG5IKEEW7FLGEF4IZAP.json","view_paper":"https://pith.science/paper/VPDSJ4MY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5683&json=true","fetch_graph":"https://pith.science/api/pith-number/VPDSJ4MYG5IKEEW7FLGEF4IZAP/graph.json","fetch_events":"https://pith.science/api/pith-number/VPDSJ4MYG5IKEEW7FLGEF4IZAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPDSJ4MYG5IKEEW7FLGEF4IZAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPDSJ4MYG5IKEEW7FLGEF4IZAP/action/storage_attestation","attest_author":"https://pith.science/pith/VPDSJ4MYG5IKEEW7FLGEF4IZAP/action/author_attestation","sign_citation":"https://pith.science/pith/VPDSJ4MYG5IKEEW7FLGEF4IZAP/action/citation_signature","submit_replication":"https://pith.science/pith/VPDSJ4MYG5IKEEW7FLGEF4IZAP/action/replication_record"}},"created_at":"2026-05-18T04:12:19.017048+00:00","updated_at":"2026-05-18T04:12:19.017048+00:00"}