{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XEEXXYPL6UXVHGVYJWRTDJGKFQ","short_pith_number":"pith:XEEXXYPL","schema_version":"1.0","canonical_sha256":"b9097be1ebf52f539ab84da331a4ca2c0b2117f541fc40a0d759792c429c8f08","source":{"kind":"arxiv","id":"2507.19417","version":2},"attestation_state":"computed","paper":{"title":"Cycle-factors of regular graphs via entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Ant\\'onio Gir\\~ao, Eoin Hurley, Lukas Michel, Micha Christoph, Nemanja Dragani\\'c","submitted_at":"2025-07-25T16:36:08Z","abstract_excerpt":"It is a classical result that a random permutation of $n$ elements has, on average, about $\\log n$ cycles. We generalise this fact to all directed $d$-regular graphs on $n$ vertices by showing that, on average, a random cycle-factor of such a graph has $\\mathcal{O}((n\\log d)/d)$ cycles. This is tight up to the constant factor and improves the best previous bound of the form $\\mathcal{O}(n/\\sqrt{\\log d})$ due to Vishnoi. Our results also yield randomised polynomial-time algorithms for finding such a cycle-factor and for finding a tour of length $(1+\\mathcal{O}((\\log d)/d)) \\cdot n$ if the graph"},"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":"2507.19417","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-25T16:36:08Z","cross_cats_sorted":["cs.DM","cs.DS","math.PR"],"title_canon_sha256":"9290d9000e8150d6da6adb9dca26db02a67d49691ed5a819489c4426dfa75560","abstract_canon_sha256":"d54d538c99c18c0f0de78ab267aff062cf4663b5603d54df26b09354df87328a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:58.234496Z","signature_b64":"nK4Z4XVUcJQZyrIGTgOLn+PjYjqwnOg7EkqkzlEsaVYAFBdauSc/T2UeLSmpRv0ouAVd0U8hWEN4FI2kDjk/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9097be1ebf52f539ab84da331a4ca2c0b2117f541fc40a0d759792c429c8f08","last_reissued_at":"2026-07-05T11:57:58.233900Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:58.233900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycle-factors of regular graphs via entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Ant\\'onio Gir\\~ao, Eoin Hurley, Lukas Michel, Micha Christoph, Nemanja Dragani\\'c","submitted_at":"2025-07-25T16:36:08Z","abstract_excerpt":"It is a classical result that a random permutation of $n$ elements has, on average, about $\\log n$ cycles. We generalise this fact to all directed $d$-regular graphs on $n$ vertices by showing that, on average, a random cycle-factor of such a graph has $\\mathcal{O}((n\\log d)/d)$ cycles. This is tight up to the constant factor and improves the best previous bound of the form $\\mathcal{O}(n/\\sqrt{\\log d})$ due to Vishnoi. Our results also yield randomised polynomial-time algorithms for finding such a cycle-factor and for finding a tour of length $(1+\\mathcal{O}((\\log d)/d)) \\cdot n$ if the graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19417","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.19417/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":"2507.19417","created_at":"2026-07-05T11:57:58.233973+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.19417v2","created_at":"2026-07-05T11:57:58.233973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19417","created_at":"2026-07-05T11:57:58.233973+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEEXXYPL6UXV","created_at":"2026-07-05T11:57:58.233973+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEEXXYPL6UXVHGVY","created_at":"2026-07-05T11:57:58.233973+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEEXXYPL","created_at":"2026-07-05T11:57:58.233973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26102","citing_title":"SWE-Edit: Rethinking Code Editing for Efficient SWE-Agent","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2603.08675","citing_title":"The Lov\\'asz conjecture holds for moderately dense Cayley graphs","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26101","citing_title":"Counterexamples to an Extremal Conjecture for Random Cycle-Factors","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26101","citing_title":"Counterexamples to an Extremal Conjecture for Random Cycle-Factors","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XEEXXYPL6UXVHGVYJWRTDJGKFQ","json":"https://pith.science/pith/XEEXXYPL6UXVHGVYJWRTDJGKFQ.json","graph_json":"https://pith.science/api/pith-number/XEEXXYPL6UXVHGVYJWRTDJGKFQ/graph.json","events_json":"https://pith.science/api/pith-number/XEEXXYPL6UXVHGVYJWRTDJGKFQ/events.json","paper":"https://pith.science/paper/XEEXXYPL"},"agent_actions":{"view_html":"https://pith.science/pith/XEEXXYPL6UXVHGVYJWRTDJGKFQ","download_json":"https://pith.science/pith/XEEXXYPL6UXVHGVYJWRTDJGKFQ.json","view_paper":"https://pith.science/paper/XEEXXYPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.19417&json=true","fetch_graph":"https://pith.science/api/pith-number/XEEXXYPL6UXVHGVYJWRTDJGKFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XEEXXYPL6UXVHGVYJWRTDJGKFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEEXXYPL6UXVHGVYJWRTDJGKFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEEXXYPL6UXVHGVYJWRTDJGKFQ/action/storage_attestation","attest_author":"https://pith.science/pith/XEEXXYPL6UXVHGVYJWRTDJGKFQ/action/author_attestation","sign_citation":"https://pith.science/pith/XEEXXYPL6UXVHGVYJWRTDJGKFQ/action/citation_signature","submit_replication":"https://pith.science/pith/XEEXXYPL6UXVHGVYJWRTDJGKFQ/action/replication_record"}},"created_at":"2026-07-05T11:57:58.233973+00:00","updated_at":"2026-07-05T11:57:58.233973+00:00"}