{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SPZT5RMCMR6WLTYVP2ZO65LX7X","short_pith_number":"pith:SPZT5RMC","canonical_record":{"source":{"id":"1606.04642","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-15T05:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"0f1c3ef785e15746449e983e227a481e1864cb8df1bd02702b71f5ec615520ed","abstract_canon_sha256":"14ff29f427c79e5ae47221321e11407e33a84527c83a0ff3b34ce61e280dc5f5"},"schema_version":"1.0"},"canonical_sha256":"93f33ec582647d65cf157eb2ef7577fde204591bb3e6b15fef7d4485c75d8a4a","source":{"kind":"arxiv","id":"1606.04642","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04642","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04642v2","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04642","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"SPZT5RMCMR6W","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SPZT5RMCMR6WLTYV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SPZT5RMC","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SPZT5RMCMR6WLTYVP2ZO65LX7X","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04642","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-15T05:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"0f1c3ef785e15746449e983e227a481e1864cb8df1bd02702b71f5ec615520ed","abstract_canon_sha256":"14ff29f427c79e5ae47221321e11407e33a84527c83a0ff3b34ce61e280dc5f5"},"schema_version":"1.0"},"canonical_sha256":"93f33ec582647d65cf157eb2ef7577fde204591bb3e6b15fef7d4485c75d8a4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:30.443410Z","signature_b64":"qSNtRsTVwcU42lVE2YMC0upGLjiaRgX3mGxuqOul7ddgNvW/6ds/NQhVbbdPuOPvWDBXMeYFVP4KgtQpb1s2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f33ec582647d65cf157eb2ef7577fde204591bb3e6b15fef7d4485c75d8a4a","last_reissued_at":"2026-05-18T01:11:30.443065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:30.443065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04642","source_version":2,"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-18T01:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A5xNvPBtDbD7gbFlgciBX5skLnAM9tZ7On+TidEAc/iMVCgJFUZUo6Mm17O+tHsUqhgc7+MLpgS2GhWyiBT2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:39:49.064459Z"},"content_sha256":"ce85644ab3fe648caef762f6d16eec00ac126fbd2a378165f9a61a50b3d2665c","schema_version":"1.0","event_id":"sha256:ce85644ab3fe648caef762f6d16eec00ac126fbd2a378165f9a61a50b3d2665c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SPZT5RMCMR6WLTYVP2ZO65LX7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Poisson and independent process approximation for random combinatorial structures with a given number of components, and near-universal behavior for low rank assemblies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Richard Arratia, Stephen DeSalvo","submitted_at":"2016-06-15T05:01:47Z","abstract_excerpt":"We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which, with the appropriate choice of parameter, may be viewed as an extension of saddlepoint approximation.\n  We illustrate the use of this by analyzing the component structure when the rank and size are specified, and the rank, $r := n-k$, is small relative to $n$. There is near-universal behavior, in the sense that apart from cases where the exponential generatin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04642","kind":"arxiv","version":2},"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-18T01:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ppiHME/CI935pMh3hp/3aRbjiFUdaTIrxkSn00in7491bY682+jiVpVC7WzAPW4pgF5/iq8t11MOh4igvz7jBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:39:49.064803Z"},"content_sha256":"d905ca4911f7ecb677e9814e743db66742ed5b4095d2b5d3421f060fa83ad079","schema_version":"1.0","event_id":"sha256:d905ca4911f7ecb677e9814e743db66742ed5b4095d2b5d3421f060fa83ad079"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPZT5RMCMR6WLTYVP2ZO65LX7X/bundle.json","state_url":"https://pith.science/pith/SPZT5RMCMR6WLTYVP2ZO65LX7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPZT5RMCMR6WLTYVP2ZO65LX7X/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-24T18:39:49Z","links":{"resolver":"https://pith.science/pith/SPZT5RMCMR6WLTYVP2ZO65LX7X","bundle":"https://pith.science/pith/SPZT5RMCMR6WLTYVP2ZO65LX7X/bundle.json","state":"https://pith.science/pith/SPZT5RMCMR6WLTYVP2ZO65LX7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPZT5RMCMR6WLTYVP2ZO65LX7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SPZT5RMCMR6WLTYVP2ZO65LX7X","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":"14ff29f427c79e5ae47221321e11407e33a84527c83a0ff3b34ce61e280dc5f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-15T05:01:47Z","title_canon_sha256":"0f1c3ef785e15746449e983e227a481e1864cb8df1bd02702b71f5ec615520ed"},"schema_version":"1.0","source":{"id":"1606.04642","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04642","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04642v2","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04642","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"SPZT5RMCMR6W","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SPZT5RMCMR6WLTYV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SPZT5RMC","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:d905ca4911f7ecb677e9814e743db66742ed5b4095d2b5d3421f060fa83ad079","target":"graph","created_at":"2026-05-18T01:11:30Z","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":"We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which, with the appropriate choice of parameter, may be viewed as an extension of saddlepoint approximation.\n  We illustrate the use of this by analyzing the component structure when the rank and size are specified, and the rank, $r := n-k$, is small relative to $n$. There is near-universal behavior, in the sense that apart from cases where the exponential generatin","authors_text":"Richard Arratia, Stephen DeSalvo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-15T05:01:47Z","title":"Poisson and independent process approximation for random combinatorial structures with a given number of components, and near-universal behavior for low rank assemblies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04642","kind":"arxiv","version":2},"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:ce85644ab3fe648caef762f6d16eec00ac126fbd2a378165f9a61a50b3d2665c","target":"record","created_at":"2026-05-18T01:11:30Z","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":"14ff29f427c79e5ae47221321e11407e33a84527c83a0ff3b34ce61e280dc5f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-15T05:01:47Z","title_canon_sha256":"0f1c3ef785e15746449e983e227a481e1864cb8df1bd02702b71f5ec615520ed"},"schema_version":"1.0","source":{"id":"1606.04642","kind":"arxiv","version":2}},"canonical_sha256":"93f33ec582647d65cf157eb2ef7577fde204591bb3e6b15fef7d4485c75d8a4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93f33ec582647d65cf157eb2ef7577fde204591bb3e6b15fef7d4485c75d8a4a","first_computed_at":"2026-05-18T01:11:30.443065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:30.443065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qSNtRsTVwcU42lVE2YMC0upGLjiaRgX3mGxuqOul7ddgNvW/6ds/NQhVbbdPuOPvWDBXMeYFVP4KgtQpb1s2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:30.443410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04642","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce85644ab3fe648caef762f6d16eec00ac126fbd2a378165f9a61a50b3d2665c","sha256:d905ca4911f7ecb677e9814e743db66742ed5b4095d2b5d3421f060fa83ad079"],"state_sha256":"b54cbaf46cc1cc9f7e40d63cdf02c35e24f289d3e99f42b7b0a0f544984ec6db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPCb7vJwxjEJpybJ29axFo6xY1+4XAgDGWAsfLojUUT6DeStYSbw5hNAThj+zo/NpnadjLdNDE1VgUowi/oTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:39:49.066734Z","bundle_sha256":"01d6e82fc13f049f839b08c34dba195176e65a518ef981372ed24dbc2293615e"}}