{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S4FCV4UNM4BM2KUWL6WPBS23UZ","short_pith_number":"pith:S4FCV4UN","canonical_record":{"source":{"id":"1501.04816","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T14:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"b47ce9bf92c9f08157f96255456330fa99d7adaa0fcad05766f029582546f89b","abstract_canon_sha256":"8bbeaf9895e51a596dc15100466084c49fe86a00a35a0f349e186090f8f0ced0"},"schema_version":"1.0"},"canonical_sha256":"970a2af28d6702cd2a965facf0cb5ba67a2ec45ff97c418c6196f0d770a458b1","source":{"kind":"arxiv","id":"1501.04816","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04816","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04816v3","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04816","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"S4FCV4UNM4BM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S4FCV4UNM4BM2KUW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S4FCV4UN","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S4FCV4UNM4BM2KUWL6WPBS23UZ","target":"record","payload":{"canonical_record":{"source":{"id":"1501.04816","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T14:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"b47ce9bf92c9f08157f96255456330fa99d7adaa0fcad05766f029582546f89b","abstract_canon_sha256":"8bbeaf9895e51a596dc15100466084c49fe86a00a35a0f349e186090f8f0ced0"},"schema_version":"1.0"},"canonical_sha256":"970a2af28d6702cd2a965facf0cb5ba67a2ec45ff97c418c6196f0d770a458b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:27.887674Z","signature_b64":"dzQf4u8Qn+hLvJKuRf+K0FEtxN2Y6chvf1a9hIqj56tjcbaIR2Kg0v6mkWOM2UaQ11gaw/3IZJgqQdd5XcKMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"970a2af28d6702cd2a965facf0cb5ba67a2ec45ff97c418c6196f0d770a458b1","last_reissued_at":"2026-05-18T00:20:27.887035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:27.887035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.04816","source_version":3,"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-18T00:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gaM+tpbGd8JsizwHtcexnn8l0Y3FB2d+CbgO+fRYw4KenYPEnmxa/pdoU/PfI9j4aJlruL0Ro8UqYKTEPit1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:02:00.889207Z"},"content_sha256":"dd18705029b899ad00c408fc58ec4cb227609339449c65b131e9b7148c9a1c56","schema_version":"1.0","event_id":"sha256:dd18705029b899ad00c408fc58ec4cb227609339449c65b131e9b7148c9a1c56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S4FCV4UNM4BM2KUWL6WPBS23UZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycles and matchings in randomly perturbed digraphs and hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matthew Kwan, Michael Krivelevich","submitted_at":"2015-01-20T14:09:17Z","abstract_excerpt":"We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to a dense k-uniform hypergraph ensures the (asymptotically almost sure) existence of a perfect matching or a loose Hamilton cycle. The proof involves an interesting application of Szemer\\'edi's Regularity Lemma, which might be independently useful. We next prove that digraphs with certain strong expansion properties are pancyclic, and use this to show that add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04816","kind":"arxiv","version":3},"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-18T00:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQfTy4YTHO0L5wZcddst0CPZlOYYuzBPJJTmtOqDqgiDSzD444IQXVNPon6wHTjY1fakhtGYTHzInRyWqAK5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:02:00.889570Z"},"content_sha256":"a8a263e7d834429cc8275df3778965f767398a35f8316aae0320fca2b163a59e","schema_version":"1.0","event_id":"sha256:a8a263e7d834429cc8275df3778965f767398a35f8316aae0320fca2b163a59e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4FCV4UNM4BM2KUWL6WPBS23UZ/bundle.json","state_url":"https://pith.science/pith/S4FCV4UNM4BM2KUWL6WPBS23UZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4FCV4UNM4BM2KUWL6WPBS23UZ/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-30T09:02:00Z","links":{"resolver":"https://pith.science/pith/S4FCV4UNM4BM2KUWL6WPBS23UZ","bundle":"https://pith.science/pith/S4FCV4UNM4BM2KUWL6WPBS23UZ/bundle.json","state":"https://pith.science/pith/S4FCV4UNM4BM2KUWL6WPBS23UZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4FCV4UNM4BM2KUWL6WPBS23UZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S4FCV4UNM4BM2KUWL6WPBS23UZ","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":"8bbeaf9895e51a596dc15100466084c49fe86a00a35a0f349e186090f8f0ced0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T14:09:17Z","title_canon_sha256":"b47ce9bf92c9f08157f96255456330fa99d7adaa0fcad05766f029582546f89b"},"schema_version":"1.0","source":{"id":"1501.04816","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04816","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04816v3","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04816","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"S4FCV4UNM4BM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S4FCV4UNM4BM2KUW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S4FCV4UN","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:a8a263e7d834429cc8275df3778965f767398a35f8316aae0320fca2b163a59e","target":"graph","created_at":"2026-05-18T00:20:27Z","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":"We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to a dense k-uniform hypergraph ensures the (asymptotically almost sure) existence of a perfect matching or a loose Hamilton cycle. The proof involves an interesting application of Szemer\\'edi's Regularity Lemma, which might be independently useful. We next prove that digraphs with certain strong expansion properties are pancyclic, and use this to show that add","authors_text":"Benny Sudakov, Matthew Kwan, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T14:09:17Z","title":"Cycles and matchings in randomly perturbed digraphs and hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04816","kind":"arxiv","version":3},"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:dd18705029b899ad00c408fc58ec4cb227609339449c65b131e9b7148c9a1c56","target":"record","created_at":"2026-05-18T00:20:27Z","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":"8bbeaf9895e51a596dc15100466084c49fe86a00a35a0f349e186090f8f0ced0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T14:09:17Z","title_canon_sha256":"b47ce9bf92c9f08157f96255456330fa99d7adaa0fcad05766f029582546f89b"},"schema_version":"1.0","source":{"id":"1501.04816","kind":"arxiv","version":3}},"canonical_sha256":"970a2af28d6702cd2a965facf0cb5ba67a2ec45ff97c418c6196f0d770a458b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"970a2af28d6702cd2a965facf0cb5ba67a2ec45ff97c418c6196f0d770a458b1","first_computed_at":"2026-05-18T00:20:27.887035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:27.887035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dzQf4u8Qn+hLvJKuRf+K0FEtxN2Y6chvf1a9hIqj56tjcbaIR2Kg0v6mkWOM2UaQ11gaw/3IZJgqQdd5XcKMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:27.887674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04816","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd18705029b899ad00c408fc58ec4cb227609339449c65b131e9b7148c9a1c56","sha256:a8a263e7d834429cc8275df3778965f767398a35f8316aae0320fca2b163a59e"],"state_sha256":"12aaf4e4577cbea872b39087ac750cf30eac6031e8f1d023fd93e06ce10d0e2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xaOKd6iZDuQzQtK6TaPtx17LejZZHfpef6UYjZhLGAfyWiRZtscGBoumrdN2rh94JLFqKuGS8wovtnP8Sc0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:02:00.891514Z","bundle_sha256":"d822d407a305515847fadc2c1ceb5eba8d9c24cf5323d8161121c2a00843056a"}}