{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y76LKKKZBWTPLKDBNJLWOAGYBB","short_pith_number":"pith:Y76LKKKZ","canonical_record":{"source":{"id":"1112.5071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-21T16:00:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"941f8ebb9bab1f805393d3829833c80ad02664c23a41f6c833f30c088ae3588a","abstract_canon_sha256":"5c7eb6467f92417b4e0d651a49974318fc42af4d98f6d25a768fb82848b3e7bc"},"schema_version":"1.0"},"canonical_sha256":"c7fcb529590da6f5a8616a576700d8085c6ec5172ad8aa3a594334030f63159e","source":{"kind":"arxiv","id":"1112.5071","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5071","created_at":"2026-05-18T04:05:48Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5071v1","created_at":"2026-05-18T04:05:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5071","created_at":"2026-05-18T04:05:48Z"},{"alias_kind":"pith_short_12","alias_value":"Y76LKKKZBWTP","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y76LKKKZBWTPLKDB","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y76LKKKZ","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y76LKKKZBWTPLKDBNJLWOAGYBB","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-21T16:00:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"941f8ebb9bab1f805393d3829833c80ad02664c23a41f6c833f30c088ae3588a","abstract_canon_sha256":"5c7eb6467f92417b4e0d651a49974318fc42af4d98f6d25a768fb82848b3e7bc"},"schema_version":"1.0"},"canonical_sha256":"c7fcb529590da6f5a8616a576700d8085c6ec5172ad8aa3a594334030f63159e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:48.105308Z","signature_b64":"curjBaoqPmj1c9EFHY//ohuYQI0Fw6c+qmF4A/k8JTULclIFtrhA73f6xqNtgm9AVFyzbHKRAIdgH70IPsl8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7fcb529590da6f5a8616a576700d8085c6ec5172ad8aa3a594334030f63159e","last_reissued_at":"2026-05-18T04:05:48.104792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:48.104792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5071","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:05:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2zmlGQTXDoglxOOWCI35XncUF3IKSn2Xvj/c57J61JW8zG5upCc+ijIlC1fpFNYbllBFoHkRDlao0y1IioFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:55:16.774189Z"},"content_sha256":"8b636f203b44f875b06032b80c2f05aee5ce1f8bf17a93e9472980d52b3d1b90","schema_version":"1.0","event_id":"sha256:8b636f203b44f875b06032b80c2f05aee5ce1f8bf17a93e9472980d52b3d1b90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y76LKKKZBWTPLKDBNJLWOAGYBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random generation of combinatorial structures: Boltzmann samplers and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"LaBRI), Philippe Duchon (INRIA Bordeaux - Sud-Ouest","submitted_at":"2011-12-21T16:00:22Z","abstract_excerpt":"The Boltzmann model for the random generation of \"decomposable\" combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of sampling uniformly from the set of objects of a given size is somehow relaxed, though uniformity among objects of each size is still ensured. Generating functions, rather than the enumeration sequences they are based on, are the crucial ingredient. We give a brief description of the general theory, as well as a number of newer developments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5071","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:05:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cnhD3xGYQ5ivJoSre3GLdgNO+HOLql/YCGU8elKYEF0PLwRpfgAW6Di4Me0m7hN07eWFxgBDnXs1yFpNnmDlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:55:16.774868Z"},"content_sha256":"d72f0b605badb9cdbea075ca32cb1b02ed039b13f3520d038350e8b69dc2740c","schema_version":"1.0","event_id":"sha256:d72f0b605badb9cdbea075ca32cb1b02ed039b13f3520d038350e8b69dc2740c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y76LKKKZBWTPLKDBNJLWOAGYBB/bundle.json","state_url":"https://pith.science/pith/Y76LKKKZBWTPLKDBNJLWOAGYBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y76LKKKZBWTPLKDBNJLWOAGYBB/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-27T18:55:16Z","links":{"resolver":"https://pith.science/pith/Y76LKKKZBWTPLKDBNJLWOAGYBB","bundle":"https://pith.science/pith/Y76LKKKZBWTPLKDBNJLWOAGYBB/bundle.json","state":"https://pith.science/pith/Y76LKKKZBWTPLKDBNJLWOAGYBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y76LKKKZBWTPLKDBNJLWOAGYBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y76LKKKZBWTPLKDBNJLWOAGYBB","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":"5c7eb6467f92417b4e0d651a49974318fc42af4d98f6d25a768fb82848b3e7bc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-21T16:00:22Z","title_canon_sha256":"941f8ebb9bab1f805393d3829833c80ad02664c23a41f6c833f30c088ae3588a"},"schema_version":"1.0","source":{"id":"1112.5071","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5071","created_at":"2026-05-18T04:05:48Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5071v1","created_at":"2026-05-18T04:05:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5071","created_at":"2026-05-18T04:05:48Z"},{"alias_kind":"pith_short_12","alias_value":"Y76LKKKZBWTP","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y76LKKKZBWTPLKDB","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y76LKKKZ","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:d72f0b605badb9cdbea075ca32cb1b02ed039b13f3520d038350e8b69dc2740c","target":"graph","created_at":"2026-05-18T04:05:48Z","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":"The Boltzmann model for the random generation of \"decomposable\" combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of sampling uniformly from the set of objects of a given size is somehow relaxed, though uniformity among objects of each size is still ensured. Generating functions, rather than the enumeration sequences they are based on, are the crucial ingredient. We give a brief description of the general theory, as well as a number of newer developments.","authors_text":"LaBRI), Philippe Duchon (INRIA Bordeaux - Sud-Ouest","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-21T16:00:22Z","title":"Random generation of combinatorial structures: Boltzmann samplers and beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5071","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:8b636f203b44f875b06032b80c2f05aee5ce1f8bf17a93e9472980d52b3d1b90","target":"record","created_at":"2026-05-18T04:05:48Z","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":"5c7eb6467f92417b4e0d651a49974318fc42af4d98f6d25a768fb82848b3e7bc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-21T16:00:22Z","title_canon_sha256":"941f8ebb9bab1f805393d3829833c80ad02664c23a41f6c833f30c088ae3588a"},"schema_version":"1.0","source":{"id":"1112.5071","kind":"arxiv","version":1}},"canonical_sha256":"c7fcb529590da6f5a8616a576700d8085c6ec5172ad8aa3a594334030f63159e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7fcb529590da6f5a8616a576700d8085c6ec5172ad8aa3a594334030f63159e","first_computed_at":"2026-05-18T04:05:48.104792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:48.104792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"curjBaoqPmj1c9EFHY//ohuYQI0Fw6c+qmF4A/k8JTULclIFtrhA73f6xqNtgm9AVFyzbHKRAIdgH70IPsl8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:48.105308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5071","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b636f203b44f875b06032b80c2f05aee5ce1f8bf17a93e9472980d52b3d1b90","sha256:d72f0b605badb9cdbea075ca32cb1b02ed039b13f3520d038350e8b69dc2740c"],"state_sha256":"c57f6611eb9fa776ff08dde01d76d1417cae1bf7ca6a0c5403487783edbdaaf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYtjaZ4BdRymNSAyTNU2h5QTMWi9h0Kj2MVydOdWyDYLX2fo86WP/D2HksEumkvJTsG/M6jwzm98TJXCoNq/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:55:16.777954Z","bundle_sha256":"f20633a5b4eb7c80c62b816ba2fa144c3b3f7c7638c819ccd7addbb47fb14237"}}