{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YOWJ664I3FWRB33W7Y4NE6W2TD","short_pith_number":"pith:YOWJ664I","canonical_record":{"source":{"id":"1401.2707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T04:27:39Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"bfcd1f5ba180df60c2654622cfef6358435802d591b42bcd60e01ede52ce4b57","abstract_canon_sha256":"88250877c5aca0b1a63156c27171b35dec4d882cbd1152445ef12009208e0924"},"schema_version":"1.0"},"canonical_sha256":"c3ac9f7b88d96d10ef76fe38d27ada98e3d8d4933d495e6aaeba3ab3bc636223","source":{"kind":"arxiv","id":"1401.2707","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2707","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2707v2","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2707","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"YOWJ664I3FWR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YOWJ664I3FWRB33W","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YOWJ664I","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YOWJ664I3FWRB33W7Y4NE6W2TD","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T04:27:39Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"bfcd1f5ba180df60c2654622cfef6358435802d591b42bcd60e01ede52ce4b57","abstract_canon_sha256":"88250877c5aca0b1a63156c27171b35dec4d882cbd1152445ef12009208e0924"},"schema_version":"1.0"},"canonical_sha256":"c3ac9f7b88d96d10ef76fe38d27ada98e3d8d4933d495e6aaeba3ab3bc636223","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.891247Z","signature_b64":"3CX4CogXbZVi1wmUkfiMj0i0W83F5lQQXLUmUe1vwpBoGWudTzweEDSPV3d73TAnAgdgWKm/2KitSyllHB8LCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3ac9f7b88d96d10ef76fe38d27ada98e3d8d4933d495e6aaeba3ab3bc636223","last_reissued_at":"2026-05-18T02:53:55.890489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.890489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2707","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:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWaLae/tz5EUg400ITy8BqmKuciZPbb8akmaCddRyoWsKicKwYwHxTWmqFh6w6Uif+fUnLB+1/Nla2poj74iBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:30:12.642068Z"},"content_sha256":"bd8d8d0bcab6a08a12c849eddc0da3e5908bf755f248002942ac3976a6937416","schema_version":"1.0","event_id":"sha256:bd8d8d0bcab6a08a12c849eddc0da3e5908bf755f248002942ac3976a6937416"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YOWJ664I3FWRB33W7Y4NE6W2TD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycle factors and renewal theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Eyal Lubetzky, Jeff Kahn, Nicholas Wormald","submitted_at":"2014-01-13T04:27:39Z","abstract_excerpt":"For which values of $k$ does a uniformly chosen $3$-regular graph $G$ on $n$ vertices typically contain $ n/k$ vertex-disjoint $k$-cycles (a $k$-cycle factor)? To date, this has been answered for $k=n$ and for $k \\ll \\log n$; the former, the Hamiltonicity problem, was finally answered in the affirmative by Robinson and Wormald in 1992, while the answer in the latter case is negative since with high probability most vertices do not lie on $k$-cycles.\n  Here we settle the problem completely: the threshold for a $k$-cycle factor in $G$ as above is $\\kappa_0 \\log_2 n$ with $\\kappa_0=[1-\\frac12\\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2707","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:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2vIvL8PQaBURtYyJO3iqa8FGdgpIho6JksJxmaFt0sQaXBuNS1i+YGsMcm4+pfjqShnvfwLFtg5/fhMtRh4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:30:12.642777Z"},"content_sha256":"81413a353b515d7341e56dd00331199e84e24b461d83a841827c77ae1dc5bc72","schema_version":"1.0","event_id":"sha256:81413a353b515d7341e56dd00331199e84e24b461d83a841827c77ae1dc5bc72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOWJ664I3FWRB33W7Y4NE6W2TD/bundle.json","state_url":"https://pith.science/pith/YOWJ664I3FWRB33W7Y4NE6W2TD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOWJ664I3FWRB33W7Y4NE6W2TD/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-29T22:30:12Z","links":{"resolver":"https://pith.science/pith/YOWJ664I3FWRB33W7Y4NE6W2TD","bundle":"https://pith.science/pith/YOWJ664I3FWRB33W7Y4NE6W2TD/bundle.json","state":"https://pith.science/pith/YOWJ664I3FWRB33W7Y4NE6W2TD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOWJ664I3FWRB33W7Y4NE6W2TD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YOWJ664I3FWRB33W7Y4NE6W2TD","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":"88250877c5aca0b1a63156c27171b35dec4d882cbd1152445ef12009208e0924","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T04:27:39Z","title_canon_sha256":"bfcd1f5ba180df60c2654622cfef6358435802d591b42bcd60e01ede52ce4b57"},"schema_version":"1.0","source":{"id":"1401.2707","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2707","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2707v2","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2707","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"YOWJ664I3FWR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YOWJ664I3FWRB33W","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YOWJ664I","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:81413a353b515d7341e56dd00331199e84e24b461d83a841827c77ae1dc5bc72","target":"graph","created_at":"2026-05-18T02:53:55Z","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":"For which values of $k$ does a uniformly chosen $3$-regular graph $G$ on $n$ vertices typically contain $ n/k$ vertex-disjoint $k$-cycles (a $k$-cycle factor)? To date, this has been answered for $k=n$ and for $k \\ll \\log n$; the former, the Hamiltonicity problem, was finally answered in the affirmative by Robinson and Wormald in 1992, while the answer in the latter case is negative since with high probability most vertices do not lie on $k$-cycles.\n  Here we settle the problem completely: the threshold for a $k$-cycle factor in $G$ as above is $\\kappa_0 \\log_2 n$ with $\\kappa_0=[1-\\frac12\\log","authors_text":"Eyal Lubetzky, Jeff Kahn, Nicholas Wormald","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T04:27:39Z","title":"Cycle factors and renewal theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2707","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:bd8d8d0bcab6a08a12c849eddc0da3e5908bf755f248002942ac3976a6937416","target":"record","created_at":"2026-05-18T02:53:55Z","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":"88250877c5aca0b1a63156c27171b35dec4d882cbd1152445ef12009208e0924","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T04:27:39Z","title_canon_sha256":"bfcd1f5ba180df60c2654622cfef6358435802d591b42bcd60e01ede52ce4b57"},"schema_version":"1.0","source":{"id":"1401.2707","kind":"arxiv","version":2}},"canonical_sha256":"c3ac9f7b88d96d10ef76fe38d27ada98e3d8d4933d495e6aaeba3ab3bc636223","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3ac9f7b88d96d10ef76fe38d27ada98e3d8d4933d495e6aaeba3ab3bc636223","first_computed_at":"2026-05-18T02:53:55.890489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:55.890489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3CX4CogXbZVi1wmUkfiMj0i0W83F5lQQXLUmUe1vwpBoGWudTzweEDSPV3d73TAnAgdgWKm/2KitSyllHB8LCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:55.891247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2707","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd8d8d0bcab6a08a12c849eddc0da3e5908bf755f248002942ac3976a6937416","sha256:81413a353b515d7341e56dd00331199e84e24b461d83a841827c77ae1dc5bc72"],"state_sha256":"de5ba4a9250da936ef7a0b76f49e3e91f2849ec9dde9456d37d8e936b7e39ed3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOxx9IEC+xd2NtHO7dOUWLQvknWAI29iQdjvk4+IXrLuee5PE2hSEL0O0v/Acsr7GdRQytjSAX547VNtuBNtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:30:12.646584Z","bundle_sha256":"207de590ef38858e0a20cd54f44ca9c686a13114c9a57d3b694f315ddc4fe358"}}