{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HWNFCVTWLE4NY6SFMNN7OJOWZX","short_pith_number":"pith:HWNFCVTW","canonical_record":{"source":{"id":"1512.05699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-17T17:59:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4bc29660d2af0f36ec54133a9df4ab3f1eee9851249a8f4985826e5be44cdc35","abstract_canon_sha256":"3a65d76f7f11280280785cec9a111e437786e71531db8cae43cfcd57b7e15269"},"schema_version":"1.0"},"canonical_sha256":"3d9a5156765938dc7a45635bf725d6cddeb4a038b8e15f0eec3a3f219639161c","source":{"kind":"arxiv","id":"1512.05699","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05699","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05699v2","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05699","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"HWNFCVTWLE4N","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HWNFCVTWLE4NY6SF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HWNFCVTW","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HWNFCVTWLE4NY6SFMNN7OJOWZX","target":"record","payload":{"canonical_record":{"source":{"id":"1512.05699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-17T17:59:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4bc29660d2af0f36ec54133a9df4ab3f1eee9851249a8f4985826e5be44cdc35","abstract_canon_sha256":"3a65d76f7f11280280785cec9a111e437786e71531db8cae43cfcd57b7e15269"},"schema_version":"1.0"},"canonical_sha256":"3d9a5156765938dc7a45635bf725d6cddeb4a038b8e15f0eec3a3f219639161c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:11.212177Z","signature_b64":"nZXY21nhd4mKEyOIKVq4rUnDnUUp25Tqra9Py0ve5def1zUve2Hubb9WbN6mJ41zlMi7mbmpYZRSEZPH8Q3iBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d9a5156765938dc7a45635bf725d6cddeb4a038b8e15f0eec3a3f219639161c","last_reissued_at":"2026-05-18T01:19:11.211374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:11.211374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.05699","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:19:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QAUR3/N8XmQgJKFgyy7HX/LJW2Sgw3FE683o0aHPaHtAwDqKEovhIMdnHsIyN2PPVRP4y8DjlYFpRqug5yy/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:23.396404Z"},"content_sha256":"7d270d960fff594f564e0c14f89e22721db2036dcccd55a06b2cc9163a2e8a14","schema_version":"1.0","event_id":"sha256:7d270d960fff594f564e0c14f89e22721db2036dcccd55a06b2cc9163a2e8a14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HWNFCVTWLE4NY6SFMNN7OJOWZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Central Limit Theorem for the Optimal Alignments Score in Multiple Random Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Christian Houdr\\'e, Ruoting Gong, \\\"Umit I\\c{s}lak","submitted_at":"2015-12-17T17:59:06Z","abstract_excerpt":"Let $\\mathbf{X}^{(1)}_{n},\\ldots,\\mathbf{X}^{(m)}_{n}$, where $\\mathbf{X}^{(i)}_{n}=(X^{(i)}_{1},\\ldots,X^{(i)}_{n})$, $i=1,\\ldots,m$, be $m$ independent sequences of independent and identically distributed random variables taking their values in a finite alphabet $\\mathcal{A}$. Let the score function $S$, defined on $\\mathcal{A}^{m}$, be non-negative, bounded, permutation-invariant, and satisfy a bounded differences condition. Under a variance lower-bound assumption, a central limit theorem is proved for the optimal alignments score of the $m$ random words."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05699","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:19:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3lICssRW17Q9ZP43+YlRJGeaJ5c5txdelAaGb6t5UOpNm6gqNzLBCQ7aas7ID6tVondORH5+MymD5HuNFEIsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:23.397097Z"},"content_sha256":"f934c15c9a1d308ee3dd83acc89530d5183da8ffbe13637ff2c8dab50db05eb6","schema_version":"1.0","event_id":"sha256:f934c15c9a1d308ee3dd83acc89530d5183da8ffbe13637ff2c8dab50db05eb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWNFCVTWLE4NY6SFMNN7OJOWZX/bundle.json","state_url":"https://pith.science/pith/HWNFCVTWLE4NY6SFMNN7OJOWZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWNFCVTWLE4NY6SFMNN7OJOWZX/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-31T01:17:23Z","links":{"resolver":"https://pith.science/pith/HWNFCVTWLE4NY6SFMNN7OJOWZX","bundle":"https://pith.science/pith/HWNFCVTWLE4NY6SFMNN7OJOWZX/bundle.json","state":"https://pith.science/pith/HWNFCVTWLE4NY6SFMNN7OJOWZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWNFCVTWLE4NY6SFMNN7OJOWZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HWNFCVTWLE4NY6SFMNN7OJOWZX","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":"3a65d76f7f11280280785cec9a111e437786e71531db8cae43cfcd57b7e15269","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-17T17:59:06Z","title_canon_sha256":"4bc29660d2af0f36ec54133a9df4ab3f1eee9851249a8f4985826e5be44cdc35"},"schema_version":"1.0","source":{"id":"1512.05699","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05699","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05699v2","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05699","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"HWNFCVTWLE4N","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HWNFCVTWLE4NY6SF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HWNFCVTW","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:f934c15c9a1d308ee3dd83acc89530d5183da8ffbe13637ff2c8dab50db05eb6","target":"graph","created_at":"2026-05-18T01:19:11Z","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":"Let $\\mathbf{X}^{(1)}_{n},\\ldots,\\mathbf{X}^{(m)}_{n}$, where $\\mathbf{X}^{(i)}_{n}=(X^{(i)}_{1},\\ldots,X^{(i)}_{n})$, $i=1,\\ldots,m$, be $m$ independent sequences of independent and identically distributed random variables taking their values in a finite alphabet $\\mathcal{A}$. Let the score function $S$, defined on $\\mathcal{A}^{m}$, be non-negative, bounded, permutation-invariant, and satisfy a bounded differences condition. Under a variance lower-bound assumption, a central limit theorem is proved for the optimal alignments score of the $m$ random words.","authors_text":"Christian Houdr\\'e, Ruoting Gong, \\\"Umit I\\c{s}lak","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-17T17:59:06Z","title":"A Central Limit Theorem for the Optimal Alignments Score in Multiple Random Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05699","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:7d270d960fff594f564e0c14f89e22721db2036dcccd55a06b2cc9163a2e8a14","target":"record","created_at":"2026-05-18T01:19:11Z","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":"3a65d76f7f11280280785cec9a111e437786e71531db8cae43cfcd57b7e15269","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-17T17:59:06Z","title_canon_sha256":"4bc29660d2af0f36ec54133a9df4ab3f1eee9851249a8f4985826e5be44cdc35"},"schema_version":"1.0","source":{"id":"1512.05699","kind":"arxiv","version":2}},"canonical_sha256":"3d9a5156765938dc7a45635bf725d6cddeb4a038b8e15f0eec3a3f219639161c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d9a5156765938dc7a45635bf725d6cddeb4a038b8e15f0eec3a3f219639161c","first_computed_at":"2026-05-18T01:19:11.211374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:11.211374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nZXY21nhd4mKEyOIKVq4rUnDnUUp25Tqra9Py0ve5def1zUve2Hubb9WbN6mJ41zlMi7mbmpYZRSEZPH8Q3iBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:11.212177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05699","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d270d960fff594f564e0c14f89e22721db2036dcccd55a06b2cc9163a2e8a14","sha256:f934c15c9a1d308ee3dd83acc89530d5183da8ffbe13637ff2c8dab50db05eb6"],"state_sha256":"d47c1fe4af1e86921beea09628be4b1f074c8585ef3ab288dc7e001a8b37dddd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rwxLWb5PRn625n3N8EDLXxZQQnx+7IsbZ8VPA6/OMEXEpzoOejj5QjmexrQ5vZUb6hmvJQgl5SnvbjBZ+JDABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:17:23.400767Z","bundle_sha256":"ca20a55ce9905c68e4ea824c5a7d0bda49ae5416c58867ae74accf77bd9cb5d7"}}