{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FHZV2667IBL5YAVVLLGWKHTQEX","short_pith_number":"pith:FHZV2667","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"},"canonical_sha256":"29f35d7bdf4057dc02b55acd651e7025febae7d7717f8ba022433306aeed69c8","source":{"kind":"arxiv","id":"1307.1728","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1728","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1728v1","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1728","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"FHZV2667IBL5","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FHZV2667IBL5YAVV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FHZV2667","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FHZV2667IBL5YAVVLLGWKHTQEX","target":"record","payload":{"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"},"canonical_sha256":"29f35d7bdf4057dc02b55acd651e7025febae7d7717f8ba022433306aeed69c8","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"},"source_kind":"arxiv","source_id":"1307.1728","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-18T03:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9ep6gXKGB8xc1DFhSP6IKRTVfAJryCWcHDI9eZnFy//7i/lqf51A6Je2dI3JbgXAXeaETs/f0Lv9qgtDQ7YDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:19:50.297561Z"},"content_sha256":"47359e95df6268d5d70a859c9185edb6f4cfa11e9ddfbc9a55d9068d1e8d9c1c","schema_version":"1.0","event_id":"sha256:47359e95df6268d5d70a859c9185edb6f4cfa11e9ddfbc9a55d9068d1e8d9c1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FHZV2667IBL5YAVVLLGWKHTQEX","target":"graph","payload":{"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"},"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-18T03:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6x+J7ZwFe3wokikfclg5xo8HBALMgPQsl3tkp7a+WkzHGImMg4t31spWal7WF7wWQraeoRDfyCTrOLwMdRcjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:19:50.297939Z"},"content_sha256":"2fd1c64c306caa2ebe601f96490fc4640660a202c2f1c1f875d2cca115cf0c47","schema_version":"1.0","event_id":"sha256:2fd1c64c306caa2ebe601f96490fc4640660a202c2f1c1f875d2cca115cf0c47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX/bundle.json","state_url":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHZV2667IBL5YAVVLLGWKHTQEX/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-06-02T14:19:50Z","links":{"resolver":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX","bundle":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX/bundle.json","state":"https://pith.science/pith/FHZV2667IBL5YAVVLLGWKHTQEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHZV2667IBL5YAVVLLGWKHTQEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FHZV2667IBL5YAVVLLGWKHTQEX","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":"18d33ce85f61507d08c4ade535003830f6a514c502be5b8d48a0cbe8c16da191","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-05T22:19:06Z","title_canon_sha256":"931a661b0875cd43d74f497aff97a595f804e9e5a7396f6b421aec090a6cbc31"},"schema_version":"1.0","source":{"id":"1307.1728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1728","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1728v1","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1728","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"FHZV2667IBL5","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FHZV2667IBL5YAVV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FHZV2667","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:2fd1c64c306caa2ebe601f96490fc4640660a202c2f1c1f875d2cca115cf0c47","target":"graph","created_at":"2026-05-18T03:19:03Z","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":"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 ","authors_text":"Andrea Sportiello, Frederique Bassino","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-05T22:19:06Z","title":"Linear-time generation of specifiable combinatorial structures: general theory and first examples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1728","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:47359e95df6268d5d70a859c9185edb6f4cfa11e9ddfbc9a55d9068d1e8d9c1c","target":"record","created_at":"2026-05-18T03:19:03Z","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":"18d33ce85f61507d08c4ade535003830f6a514c502be5b8d48a0cbe8c16da191","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-05T22:19:06Z","title_canon_sha256":"931a661b0875cd43d74f497aff97a595f804e9e5a7396f6b421aec090a6cbc31"},"schema_version":"1.0","source":{"id":"1307.1728","kind":"arxiv","version":1}},"canonical_sha256":"29f35d7bdf4057dc02b55acd651e7025febae7d7717f8ba022433306aeed69c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29f35d7bdf4057dc02b55acd651e7025febae7d7717f8ba022433306aeed69c8","first_computed_at":"2026-05-18T03:19:03.705745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:03.705745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kO5g5rlohVvRh7ZyYk8eRb918yzUlGMFfWVijZu2wN8X2gmy6c+UUwQA57yPhMbg7bF6/8hOx7beTMmkWmrrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:03.706512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47359e95df6268d5d70a859c9185edb6f4cfa11e9ddfbc9a55d9068d1e8d9c1c","sha256:2fd1c64c306caa2ebe601f96490fc4640660a202c2f1c1f875d2cca115cf0c47"],"state_sha256":"e29ac5b0dcb7c3624be765bf0140b8fb038dfd3aa56599e7feaea7ff03ba2670"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mn4Uw2j2twdHv1z/0R8sguXV8bK5GN8zU51QaufH+ob/aTRy+5dHp3L00i3qdF1R/uGUKGhfdEaFTjNfoDxlBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:19:50.300088Z","bundle_sha256":"96a42235ec03effbf5ac178c3cb072c1a63ea3b6b25e36d6facb1486a595e16f"}}