{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3J2VHJS2LV3CW46JD7YESW5OWF","short_pith_number":"pith:3J2VHJS2","schema_version":"1.0","canonical_sha256":"da7553a65a5d762b73c91ff0495baeb1443961397e5087be72f27f8786960464","source":{"kind":"arxiv","id":"2505.22875","version":1},"attestation_state":"computed","paper":{"title":"Monotonicity and decompositions of random regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Adva Mond, Julien Portier, Lawrence Hollom, Lyuben Lichev, Yiting Wang","submitted_at":"2025-05-28T21:17:03Z","abstract_excerpt":"In this work we establish several monotonicity and decomposition results in the framework of random regular graphs. Among other results, we show that, for a wide range of parameters $d_1 \\leq d_2$, there exists a coupling of $G(n,d_1)$ and $G(n,d_2)$ satisfying that $G(n,d_1) \\subseteq G(n,d_2)$ with high probability, confirming a conjecture of Gao, Isaev and McKay in a new regime. Our contributions include new tools for analysing contiguity and total variation distance between random regular graph models, a novel procedure for generating unions of random edge-disjoint perfect matchings, and r"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.22875","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-28T21:17:03Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"bc15b044877833679116a081550a2d0141f21092c982921817c3bc32777a8af3","abstract_canon_sha256":"762cf578a3bd48865051f6983be950eebe4695404ac5064d3153e35ede54ca81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:51.298424Z","signature_b64":"KBr7RGTElZcrMBliom06gZv/7K7IPFNHJvZ9DzSogjuVNFRBsC/v0wSxrpvSL/ur/GzdfbL+LEgYRQsL+yhfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da7553a65a5d762b73c91ff0495baeb1443961397e5087be72f27f8786960464","last_reissued_at":"2026-07-05T11:11:51.297923Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:51.297923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotonicity and decompositions of random regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Adva Mond, Julien Portier, Lawrence Hollom, Lyuben Lichev, Yiting Wang","submitted_at":"2025-05-28T21:17:03Z","abstract_excerpt":"In this work we establish several monotonicity and decomposition results in the framework of random regular graphs. Among other results, we show that, for a wide range of parameters $d_1 \\leq d_2$, there exists a coupling of $G(n,d_1)$ and $G(n,d_2)$ satisfying that $G(n,d_1) \\subseteq G(n,d_2)$ with high probability, confirming a conjecture of Gao, Isaev and McKay in a new regime. Our contributions include new tools for analysing contiguity and total variation distance between random regular graph models, a novel procedure for generating unions of random edge-disjoint perfect matchings, and r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22875","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.22875/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.22875","created_at":"2026-07-05T11:11:51.297984+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22875v1","created_at":"2026-07-05T11:11:51.297984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22875","created_at":"2026-07-05T11:11:51.297984+00:00"},{"alias_kind":"pith_short_12","alias_value":"3J2VHJS2LV3C","created_at":"2026-07-05T11:11:51.297984+00:00"},{"alias_kind":"pith_short_16","alias_value":"3J2VHJS2LV3CW46J","created_at":"2026-07-05T11:11:51.297984+00:00"},{"alias_kind":"pith_short_8","alias_value":"3J2VHJS2","created_at":"2026-07-05T11:11:51.297984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3J2VHJS2LV3CW46JD7YESW5OWF","json":"https://pith.science/pith/3J2VHJS2LV3CW46JD7YESW5OWF.json","graph_json":"https://pith.science/api/pith-number/3J2VHJS2LV3CW46JD7YESW5OWF/graph.json","events_json":"https://pith.science/api/pith-number/3J2VHJS2LV3CW46JD7YESW5OWF/events.json","paper":"https://pith.science/paper/3J2VHJS2"},"agent_actions":{"view_html":"https://pith.science/pith/3J2VHJS2LV3CW46JD7YESW5OWF","download_json":"https://pith.science/pith/3J2VHJS2LV3CW46JD7YESW5OWF.json","view_paper":"https://pith.science/paper/3J2VHJS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22875&json=true","fetch_graph":"https://pith.science/api/pith-number/3J2VHJS2LV3CW46JD7YESW5OWF/graph.json","fetch_events":"https://pith.science/api/pith-number/3J2VHJS2LV3CW46JD7YESW5OWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3J2VHJS2LV3CW46JD7YESW5OWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3J2VHJS2LV3CW46JD7YESW5OWF/action/storage_attestation","attest_author":"https://pith.science/pith/3J2VHJS2LV3CW46JD7YESW5OWF/action/author_attestation","sign_citation":"https://pith.science/pith/3J2VHJS2LV3CW46JD7YESW5OWF/action/citation_signature","submit_replication":"https://pith.science/pith/3J2VHJS2LV3CW46JD7YESW5OWF/action/replication_record"}},"created_at":"2026-07-05T11:11:51.297984+00:00","updated_at":"2026-07-05T11:11:51.297984+00:00"}