{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NL5MP2Q5DFGSPQUFKN2OKDIFUQ","short_pith_number":"pith:NL5MP2Q5","canonical_record":{"source":{"id":"1311.6423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T19:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"ce9fc9cd207a709adc22e99e45c95c1d991169a46851085d432c234209fd6c6d","abstract_canon_sha256":"d43a5f16dc1bab2df5c1a293ee67c9fa12ffdcfae6162d30b75c86c1163028e0"},"schema_version":"1.0"},"canonical_sha256":"6afac7ea1d194d27c2855374e50d05a4358f37bac0ddf76d489c5d121d5686dc","source":{"kind":"arxiv","id":"1311.6423","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6423","created_at":"2026-05-18T03:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6423v3","created_at":"2026-05-18T03:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6423","created_at":"2026-05-18T03:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"NL5MP2Q5DFGS","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NL5MP2Q5DFGSPQUF","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NL5MP2Q5","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NL5MP2Q5DFGSPQUFKN2OKDIFUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T19:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"ce9fc9cd207a709adc22e99e45c95c1d991169a46851085d432c234209fd6c6d","abstract_canon_sha256":"d43a5f16dc1bab2df5c1a293ee67c9fa12ffdcfae6162d30b75c86c1163028e0"},"schema_version":"1.0"},"canonical_sha256":"6afac7ea1d194d27c2855374e50d05a4358f37bac0ddf76d489c5d121d5686dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:51.226016Z","signature_b64":"vQC0hHgEfaPusItgQ+NiCJj9uCyaoAk5MiaIeQgXnw5G5w3lgZzcqfODzWDwqxmW4W6CViSMgZDl9z6XpTWvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6afac7ea1d194d27c2855374e50d05a4358f37bac0ddf76d489c5d121d5686dc","last_reissued_at":"2026-05-18T03:00:51.225483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:51.225483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6423","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-18T03:00:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+o3/pa+yqmLQVU+SJITHS052egHg8VkwTwMJERzskz81J/mzZLAE+dxGA1oL4LUkiqd+G6ppabV5tXHzwhCzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:19:54.942447Z"},"content_sha256":"0c82beeefa0c9ca916519b45d39631bc7d1830ea0bdc98e36b4392699152776a","schema_version":"1.0","event_id":"sha256:0c82beeefa0c9ca916519b45d39631bc7d1830ea0bdc98e36b4392699152776a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NL5MP2Q5DFGSPQUFKN2OKDIFUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow Matchings and Hamilton Cycles in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Deepak Bal","submitted_at":"2013-11-25T19:51:50Z","abstract_excerpt":"Let $HP_{n,m,k}$ be drawn uniformly from all $k$-uniform, $k$-partite hypergraphs where each part of the partition is a disjoint copy of $[n]$. We let $HP^{(\\k)}_{n,m,k}$ be an edge colored version, where we color each edge randomly from one of $\\k$ colors. We show that if $\\k=n$ and $m=Kn\\log n$ where $K$ is sufficiently large then w.h.p. there is a rainbow colored perfect matching. I.e. a perfect matching in which every edge has a different color. We also show that if $n$ is even and $m=Kn\\log n$ where $K$ is sufficiently large then w.h.p. there is a rainbow colored Hamilton cycle in $G^{(n)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6423","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-18T03:00:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4Q39foKV3RI5IwvqYYmFWni7y8LrrJZCoTyXdD+iGFAXpJrmWqx1LsYBZcQSy/t3fHKrwvyD9PeyHlPNZBHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:19:54.942797Z"},"content_sha256":"2add866ad5d8aca634f1e4ed67caf87ffb6e2a69c89ffd34c6fee8b141e37c5a","schema_version":"1.0","event_id":"sha256:2add866ad5d8aca634f1e4ed67caf87ffb6e2a69c89ffd34c6fee8b141e37c5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NL5MP2Q5DFGSPQUFKN2OKDIFUQ/bundle.json","state_url":"https://pith.science/pith/NL5MP2Q5DFGSPQUFKN2OKDIFUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NL5MP2Q5DFGSPQUFKN2OKDIFUQ/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-06-02T10:19:54Z","links":{"resolver":"https://pith.science/pith/NL5MP2Q5DFGSPQUFKN2OKDIFUQ","bundle":"https://pith.science/pith/NL5MP2Q5DFGSPQUFKN2OKDIFUQ/bundle.json","state":"https://pith.science/pith/NL5MP2Q5DFGSPQUFKN2OKDIFUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NL5MP2Q5DFGSPQUFKN2OKDIFUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NL5MP2Q5DFGSPQUFKN2OKDIFUQ","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":"d43a5f16dc1bab2df5c1a293ee67c9fa12ffdcfae6162d30b75c86c1163028e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T19:51:50Z","title_canon_sha256":"ce9fc9cd207a709adc22e99e45c95c1d991169a46851085d432c234209fd6c6d"},"schema_version":"1.0","source":{"id":"1311.6423","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6423","created_at":"2026-05-18T03:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6423v3","created_at":"2026-05-18T03:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6423","created_at":"2026-05-18T03:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"NL5MP2Q5DFGS","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NL5MP2Q5DFGSPQUF","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NL5MP2Q5","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:2add866ad5d8aca634f1e4ed67caf87ffb6e2a69c89ffd34c6fee8b141e37c5a","target":"graph","created_at":"2026-05-18T03:00:51Z","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":"Let $HP_{n,m,k}$ be drawn uniformly from all $k$-uniform, $k$-partite hypergraphs where each part of the partition is a disjoint copy of $[n]$. We let $HP^{(\\k)}_{n,m,k}$ be an edge colored version, where we color each edge randomly from one of $\\k$ colors. We show that if $\\k=n$ and $m=Kn\\log n$ where $K$ is sufficiently large then w.h.p. there is a rainbow colored perfect matching. I.e. a perfect matching in which every edge has a different color. We also show that if $n$ is even and $m=Kn\\log n$ where $K$ is sufficiently large then w.h.p. there is a rainbow colored Hamilton cycle in $G^{(n)","authors_text":"Alan Frieze, Deepak Bal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T19:51:50Z","title":"Rainbow Matchings and Hamilton Cycles in Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6423","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:0c82beeefa0c9ca916519b45d39631bc7d1830ea0bdc98e36b4392699152776a","target":"record","created_at":"2026-05-18T03:00:51Z","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":"d43a5f16dc1bab2df5c1a293ee67c9fa12ffdcfae6162d30b75c86c1163028e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T19:51:50Z","title_canon_sha256":"ce9fc9cd207a709adc22e99e45c95c1d991169a46851085d432c234209fd6c6d"},"schema_version":"1.0","source":{"id":"1311.6423","kind":"arxiv","version":3}},"canonical_sha256":"6afac7ea1d194d27c2855374e50d05a4358f37bac0ddf76d489c5d121d5686dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6afac7ea1d194d27c2855374e50d05a4358f37bac0ddf76d489c5d121d5686dc","first_computed_at":"2026-05-18T03:00:51.225483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:51.225483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vQC0hHgEfaPusItgQ+NiCJj9uCyaoAk5MiaIeQgXnw5G5w3lgZzcqfODzWDwqxmW4W6CViSMgZDl9z6XpTWvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:51.226016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6423","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c82beeefa0c9ca916519b45d39631bc7d1830ea0bdc98e36b4392699152776a","sha256:2add866ad5d8aca634f1e4ed67caf87ffb6e2a69c89ffd34c6fee8b141e37c5a"],"state_sha256":"f0c068f0a8bef2aabf73027deb96835a9d2ebe8404914a6a8c006314e7f50649"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CT79YpDDVi98ab/1s6Z9P/ydDkJO0eWCvh/H5ODFxw32hyI9L+30GlrRM3onrx+S5PYa7JtuEe30dXyY/oIwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:19:54.944751Z","bundle_sha256":"908fb1bf946ba0a234a51f17db4f1fbb6ddbe05e57542421ac4acdd07683fbf2"}}