{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FHZV2667IBL5YAVVLLGWKHTQEX","short_pith_number":"pith:FHZV2667","schema_version":"1.0","canonical_sha256":"29f35d7bdf4057dc02b55acd651e7025febae7d7717f8ba022433306aeed69c8","source":{"kind":"arxiv","id":"1307.1728","version":1},"attestation_state":"computed","paper":{"title":"Linear-time generation of specifiable combinatorial structures: general theory and first examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Sportiello, Frederique Bassino","submitted_at":"2013-07-05T22:19:06Z","abstract_excerpt":"Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with complexity Theta(n^{1+d/2}). We discuss a modified recursive method, crucially based on the asymptotic expansion of the associated saddle-point integrals, which can be adopted for a large number of such structures (e.g. partitions, permutations, lattice walks, trees, random graphs, all with a variety of prescribed statistics and/or constraints). The new algorithm "},"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":"1307.1728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-05T22:19:06Z","cross_cats_sorted":[],"title_canon_sha256":"931a661b0875cd43d74f497aff97a595f804e9e5a7396f6b421aec090a6cbc31","abstract_canon_sha256":"18d33ce85f61507d08c4ade535003830f6a514c502be5b8d48a0cbe8c16da191"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:03.706512Z","signature_b64":"kO5g5rlohVvRh7ZyYk8eRb918yzUlGMFfWVijZu2wN8X2gmy6c+UUwQA57yPhMbg7bF6/8hOx7beTMmkWmrrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29f35d7bdf4057dc02b55acd651e7025febae7d7717f8ba022433306aeed69c8","last_reissued_at":"2026-05-18T03:19:03.705745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:03.705745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-time generation of specifiable combinatorial structures: general theory and first examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Sportiello, Frederique Bassino","submitted_at":"2013-07-05T22:19:06Z","abstract_excerpt":"Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with complexity Theta(n^{1+d/2}). We discuss a modified recursive method, crucially based on the asymptotic expansion of the associated saddle-point integrals, which can be adopted for a large number of such structures (e.g. partitions, permutations, lattice walks, trees, random graphs, all with a variety of prescribed statistics and/or constraints). The new algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1728","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":"1307.1728","created_at":"2026-05-18T03:19:03.705864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1728v1","created_at":"2026-05-18T03:19:03.705864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1728","created_at":"2026-05-18T03:19:03.705864+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHZV2667IBL5","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHZV2667IBL5YAVV","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHZV2667","created_at":"2026-05-18T12:27:45.050594+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/FHZV2667IBL5YAVVLLGWKHTQEX","json":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX.json","graph_json":"https://pith.science/api/pith-number/FHZV2667IBL5YAVVLLGWKHTQEX/graph.json","events_json":"https://pith.science/api/pith-number/FHZV2667IBL5YAVVLLGWKHTQEX/events.json","paper":"https://pith.science/paper/FHZV2667"},"agent_actions":{"view_html":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX","download_json":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX.json","view_paper":"https://pith.science/paper/FHZV2667","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1728&json=true","fetch_graph":"https://pith.science/api/pith-number/FHZV2667IBL5YAVVLLGWKHTQEX/graph.json","fetch_events":"https://pith.science/api/pith-number/FHZV2667IBL5YAVVLLGWKHTQEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX/action/storage_attestation","attest_author":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX/action/author_attestation","sign_citation":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX/action/citation_signature","submit_replication":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX/action/replication_record"}},"created_at":"2026-05-18T03:19:03.705864+00:00","updated_at":"2026-05-18T03:19:03.705864+00:00"}