{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:6ATKP2LH2DQZNGVRPTQLXGDK4I","short_pith_number":"pith:6ATKP2LH","canonical_record":{"source":{"id":"math/0508242","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2005-08-14T18:55:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4c644afe4259478ae4b19cba3906efc1f4851aa07fd812248e92a0aa8db98531","abstract_canon_sha256":"4c8b8ba838eb49859e52be338b960d4c32ceeaa2dedb36a32a98dff24ed61c60"},"schema_version":"1.0"},"canonical_sha256":"f026a7e967d0e1969ab17ce0bb986ae22f1463baaf2fb9789c68a2e65ff9d13d","source":{"kind":"arxiv","id":"math/0508242","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0508242","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"arxiv_version","alias_value":"math/0508242v2","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0508242","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"pith_short_12","alias_value":"6ATKP2LH2DQZ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"6ATKP2LH2DQZNGVR","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"6ATKP2LH","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:6ATKP2LH2DQZNGVRPTQLXGDK4I","target":"record","payload":{"canonical_record":{"source":{"id":"math/0508242","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2005-08-14T18:55:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4c644afe4259478ae4b19cba3906efc1f4851aa07fd812248e92a0aa8db98531","abstract_canon_sha256":"4c8b8ba838eb49859e52be338b960d4c32ceeaa2dedb36a32a98dff24ed61c60"},"schema_version":"1.0"},"canonical_sha256":"f026a7e967d0e1969ab17ce0bb986ae22f1463baaf2fb9789c68a2e65ff9d13d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:07.379590Z","signature_b64":"Kx5n92ByCTUkFghHvmhcUVtsjA4vKd1e/mXATMlhXEool4kdiPRRDAmATy6NJ+J0X7+4jgCNpN1JMYSl4REpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f026a7e967d0e1969ab17ce0bb986ae22f1463baaf2fb9789c68a2e65ff9d13d","last_reissued_at":"2026-05-18T02:44:07.379006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:07.379006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0508242","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-18T02:44:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYmYuSrwDgjjRNVkfh28uZqqDlaFei/VfPdzTDx0BNCNa9lzG1j5DITa4ONB1igXGlc3BYkafMqxB6n6S6rYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:39:45.499949Z"},"content_sha256":"f4e5bddc7010c0ac8f3a281a764461321eb8b39fd304323ecb4184dc18283928","schema_version":"1.0","event_id":"sha256:f4e5bddc7010c0ac8f3a281a764461321eb8b39fd304323ecb4184dc18283928"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:6ATKP2LH2DQZNGVRPTQLXGDK4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Normal approximations for descents and inversions of permutations of multisets","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"D. Viswanath, Mark Conger","submitted_at":"2005-08-14T18:55:52Z","abstract_excerpt":"Normal approximations for descents and inversions of permutations of the set $\\{1,2,...,n\\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated by such examples, we consider the number of inversions of a permutation $\\pi(1), \\pi(2),...,\\pi(n)$ of a multiset with $n$ elements, which is the number of pairs $(i,j)$ with $1\\leq i < j \\leq n$ and $\\pi(i)>\\pi(j)$. The number of descents is the number of $i$ in the range $1\\leq i < n$ such that $\\pi(i) > \\pi(i+1)$. We prove that, appropriately normalized,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0508242","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-18T02:44:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j486Xd03HubcAbNGA0iRM2uOfiwsVhbSyfLyWoM9UylrUQE72Ik8wXuKGNbSxmUqNMWH1gZshcwItUtIpQ0VCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:39:45.500404Z"},"content_sha256":"21dacb1ae71c52dcb6c6c447d29f092e36608a9afd101c461e1e78320aea993e","schema_version":"1.0","event_id":"sha256:21dacb1ae71c52dcb6c6c447d29f092e36608a9afd101c461e1e78320aea993e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ATKP2LH2DQZNGVRPTQLXGDK4I/bundle.json","state_url":"https://pith.science/pith/6ATKP2LH2DQZNGVRPTQLXGDK4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ATKP2LH2DQZNGVRPTQLXGDK4I/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-27T14:39:45Z","links":{"resolver":"https://pith.science/pith/6ATKP2LH2DQZNGVRPTQLXGDK4I","bundle":"https://pith.science/pith/6ATKP2LH2DQZNGVRPTQLXGDK4I/bundle.json","state":"https://pith.science/pith/6ATKP2LH2DQZNGVRPTQLXGDK4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ATKP2LH2DQZNGVRPTQLXGDK4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:6ATKP2LH2DQZNGVRPTQLXGDK4I","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":"4c8b8ba838eb49859e52be338b960d4c32ceeaa2dedb36a32a98dff24ed61c60","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2005-08-14T18:55:52Z","title_canon_sha256":"4c644afe4259478ae4b19cba3906efc1f4851aa07fd812248e92a0aa8db98531"},"schema_version":"1.0","source":{"id":"math/0508242","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0508242","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"arxiv_version","alias_value":"math/0508242v2","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0508242","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"pith_short_12","alias_value":"6ATKP2LH2DQZ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"6ATKP2LH2DQZNGVR","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"6ATKP2LH","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:21dacb1ae71c52dcb6c6c447d29f092e36608a9afd101c461e1e78320aea993e","target":"graph","created_at":"2026-05-18T02:44:07Z","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":"Normal approximations for descents and inversions of permutations of the set $\\{1,2,...,n\\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated by such examples, we consider the number of inversions of a permutation $\\pi(1), \\pi(2),...,\\pi(n)$ of a multiset with $n$ elements, which is the number of pairs $(i,j)$ with $1\\leq i < j \\leq n$ and $\\pi(i)>\\pi(j)$. The number of descents is the number of $i$ in the range $1\\leq i < n$ such that $\\pi(i) > \\pi(i+1)$. We prove that, appropriately normalized,","authors_text":"D. Viswanath, Mark Conger","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2005-08-14T18:55:52Z","title":"Normal approximations for descents and inversions of permutations of multisets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0508242","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:f4e5bddc7010c0ac8f3a281a764461321eb8b39fd304323ecb4184dc18283928","target":"record","created_at":"2026-05-18T02:44:07Z","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":"4c8b8ba838eb49859e52be338b960d4c32ceeaa2dedb36a32a98dff24ed61c60","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2005-08-14T18:55:52Z","title_canon_sha256":"4c644afe4259478ae4b19cba3906efc1f4851aa07fd812248e92a0aa8db98531"},"schema_version":"1.0","source":{"id":"math/0508242","kind":"arxiv","version":2}},"canonical_sha256":"f026a7e967d0e1969ab17ce0bb986ae22f1463baaf2fb9789c68a2e65ff9d13d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f026a7e967d0e1969ab17ce0bb986ae22f1463baaf2fb9789c68a2e65ff9d13d","first_computed_at":"2026-05-18T02:44:07.379006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:07.379006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kx5n92ByCTUkFghHvmhcUVtsjA4vKd1e/mXATMlhXEool4kdiPRRDAmATy6NJ+J0X7+4jgCNpN1JMYSl4REpDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:07.379590Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0508242","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4e5bddc7010c0ac8f3a281a764461321eb8b39fd304323ecb4184dc18283928","sha256:21dacb1ae71c52dcb6c6c447d29f092e36608a9afd101c461e1e78320aea993e"],"state_sha256":"6133693f2d554dc94673a79b45f1a7593dcfd4d7debde1949ff838851c5d4c67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2srO6H3VcfJbO+tKx1eaEi+dNuYWZe5cc88QQ2JdBsIbH3J8BtwARaOvAhdR5c6MT90I9LWpwDAOI9pjUzvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:39:45.503786Z","bundle_sha256":"de150b73037d0e529e96aa3a3181b6878779959b3f35bbf964fdfddf5d27d1f4"}}