{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4JHGKP3P3FCUZHNGSMDLJ3YV4N","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":"affbf74389aa536728fbb875883cd62942393d6e5f70ebf03bfd30393ff38773","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-01T18:11:25Z","title_canon_sha256":"fa7dccd09ec7d23931ab86c989d29d5e18f54ee6c3a8565b674f10f339ebb5a5"},"schema_version":"1.0","source":{"id":"1211.0246","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0246","created_at":"2026-05-18T03:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0246v2","created_at":"2026-05-18T03:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0246","created_at":"2026-05-18T03:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"4JHGKP3P3FCU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4JHGKP3P3FCUZHNG","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4JHGKP3P","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:0a198d0bf1999d150dcabb5e49bbb3b72a89b2620d3fb8830497a80c4ce68a66","target":"graph","created_at":"2026-05-18T03:13:00Z","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":"A permutation of [n] induces a graph on [n] such that the edges of the graph correspond to inversion pairs of the permutation. This graph is connected if and only if the corresponding permutation is indecomposable. Let s(n,m) denote a permutation chosen uniformly at random among all permutations of [n] with exactly m inversions. Let p(n,m) be the common value for the probabilities that s(n,m) is indecomposable or the corresponding graph is connected. We prove that p(n,m) is non-decreasing with m by constructing a Markov process in which s(n,m+1) is obtained from s(n,m) by increasing one of the","authors_text":"Boris Pittel, Huseyin Acan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-01T18:11:25Z","title":"On the connected components of a random permutation graph with a given number of edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0246","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:8d63c82871ffe1762895cd8f9366dba43b856ce1061dbd53e2f355bad02155a4","target":"record","created_at":"2026-05-18T03:13:00Z","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":"affbf74389aa536728fbb875883cd62942393d6e5f70ebf03bfd30393ff38773","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-01T18:11:25Z","title_canon_sha256":"fa7dccd09ec7d23931ab86c989d29d5e18f54ee6c3a8565b674f10f339ebb5a5"},"schema_version":"1.0","source":{"id":"1211.0246","kind":"arxiv","version":2}},"canonical_sha256":"e24e653f6fd9454c9da69306b4ef15e3499333bc09ff83a0d4da1342cf905b1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e24e653f6fd9454c9da69306b4ef15e3499333bc09ff83a0d4da1342cf905b1a","first_computed_at":"2026-05-18T03:13:00.246047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:00.246047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q76u9bsCp7C7UWsaivk5qG03dRypJyZy7dU3aI3YhDNs/8FOarr7rrGCAGga2zbpx/GBGV+r4+1H/dpNurXnCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:00.246959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0246","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d63c82871ffe1762895cd8f9366dba43b856ce1061dbd53e2f355bad02155a4","sha256:0a198d0bf1999d150dcabb5e49bbb3b72a89b2620d3fb8830497a80c4ce68a66"],"state_sha256":"acd2c359327725563dee5f5a105edb64e471a56fb68f68681857dd27c815c675"}