{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZV5TK6SPUXSZB6G2TMIELU2SOM","short_pith_number":"pith:ZV5TK6SP","canonical_record":{"source":{"id":"1101.0182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-31T00:03:32Z","cross_cats_sorted":[],"title_canon_sha256":"edce5cd2f73a15140c5bbbbe2006ddaab5ebd9b0ef1c3bdd5fbf3b3c5a5d47ec","abstract_canon_sha256":"9a469e227c4841132ed334cf7cdd022990a84e09b65fc45d8eb2915bbe8e405c"},"schema_version":"1.0"},"canonical_sha256":"cd7b357a4fa5e590f8da9b1045d352730ad38bf704974b7b98e065524ef63978","source":{"kind":"arxiv","id":"1101.0182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0182","created_at":"2026-05-18T04:32:10Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0182v1","created_at":"2026-05-18T04:32:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0182","created_at":"2026-05-18T04:32:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZV5TK6SPUXSZ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZV5TK6SPUXSZB6G2","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZV5TK6SP","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZV5TK6SPUXSZB6G2TMIELU2SOM","target":"record","payload":{"canonical_record":{"source":{"id":"1101.0182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-31T00:03:32Z","cross_cats_sorted":[],"title_canon_sha256":"edce5cd2f73a15140c5bbbbe2006ddaab5ebd9b0ef1c3bdd5fbf3b3c5a5d47ec","abstract_canon_sha256":"9a469e227c4841132ed334cf7cdd022990a84e09b65fc45d8eb2915bbe8e405c"},"schema_version":"1.0"},"canonical_sha256":"cd7b357a4fa5e590f8da9b1045d352730ad38bf704974b7b98e065524ef63978","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:10.868821Z","signature_b64":"mY/m5+YKPDOcBOdwJO7vHg08LBqbhJXKRAT3NSRCG3QIM789vZrASR+Ews2qak3UW5wgvhe8rDyU2q6mx8qnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd7b357a4fa5e590f8da9b1045d352730ad38bf704974b7b98e065524ef63978","last_reissued_at":"2026-05-18T04:32:10.868405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:10.868405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.0182","source_version":1,"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-18T04:32:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RCzWzkaAKVMVHhUgSdwYNKPWIVDkNdp0oekFSa7UnRt3iaXx9amD+balvJx39RxA5AXL8nnSOZbn00Ic5tOCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:18:52.936888Z"},"content_sha256":"42fec3f39b6a6b89410efb351449cb07514d66f77c06efc7c6ce47610931866d","schema_version":"1.0","event_id":"sha256:42fec3f39b6a6b89410efb351449cb07514d66f77c06efc7c6ce47610931866d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZV5TK6SPUXSZB6G2TMIELU2SOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow 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, Po-Shen Loh","submitted_at":"2010-12-31T00:03:32Z","abstract_excerpt":"One of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erdos-Renyi random graph G_{n,p} is around p ~ (log n + log log n) / n. Much research has been done to extend this to increasingly challenging random structures. In particular, a recent result by Frieze determined the asymptotic threshold for a loose Hamilton cycle in the random 3-uniform hypergraph by connecting 3-uniform hypergraphs to edge-colored graphs.\n  In this work, we consider that setting of edge-colored graphs, and prove a result which achieves the best possible firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0182","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":""},"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-18T04:32:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3kOb7ZzGzSjU34exnZzw/GSwyQhES+QAnKmwO5dIY9ZF7wOfbSc7RUJgywptXPy1558ouwr04AREo5+SSymDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:18:52.937565Z"},"content_sha256":"82cf69a73dadf6a9d32590d53b52cb7822dcc90b23f6a112eefeb4eda3caaee7","schema_version":"1.0","event_id":"sha256:82cf69a73dadf6a9d32590d53b52cb7822dcc90b23f6a112eefeb4eda3caaee7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZV5TK6SPUXSZB6G2TMIELU2SOM/bundle.json","state_url":"https://pith.science/pith/ZV5TK6SPUXSZB6G2TMIELU2SOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZV5TK6SPUXSZB6G2TMIELU2SOM/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-30T17:18:52Z","links":{"resolver":"https://pith.science/pith/ZV5TK6SPUXSZB6G2TMIELU2SOM","bundle":"https://pith.science/pith/ZV5TK6SPUXSZB6G2TMIELU2SOM/bundle.json","state":"https://pith.science/pith/ZV5TK6SPUXSZB6G2TMIELU2SOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZV5TK6SPUXSZB6G2TMIELU2SOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZV5TK6SPUXSZB6G2TMIELU2SOM","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":"9a469e227c4841132ed334cf7cdd022990a84e09b65fc45d8eb2915bbe8e405c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-31T00:03:32Z","title_canon_sha256":"edce5cd2f73a15140c5bbbbe2006ddaab5ebd9b0ef1c3bdd5fbf3b3c5a5d47ec"},"schema_version":"1.0","source":{"id":"1101.0182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0182","created_at":"2026-05-18T04:32:10Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0182v1","created_at":"2026-05-18T04:32:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0182","created_at":"2026-05-18T04:32:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZV5TK6SPUXSZ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZV5TK6SPUXSZB6G2","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZV5TK6SP","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:82cf69a73dadf6a9d32590d53b52cb7822dcc90b23f6a112eefeb4eda3caaee7","target":"graph","created_at":"2026-05-18T04:32:10Z","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":"One of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erdos-Renyi random graph G_{n,p} is around p ~ (log n + log log n) / n. Much research has been done to extend this to increasingly challenging random structures. In particular, a recent result by Frieze determined the asymptotic threshold for a loose Hamilton cycle in the random 3-uniform hypergraph by connecting 3-uniform hypergraphs to edge-colored graphs.\n  In this work, we consider that setting of edge-colored graphs, and prove a result which achieves the best possible firs","authors_text":"Alan Frieze, Po-Shen Loh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-31T00:03:32Z","title":"Rainbow Hamilton cycles in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0182","kind":"arxiv","version":1},"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:42fec3f39b6a6b89410efb351449cb07514d66f77c06efc7c6ce47610931866d","target":"record","created_at":"2026-05-18T04:32:10Z","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":"9a469e227c4841132ed334cf7cdd022990a84e09b65fc45d8eb2915bbe8e405c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-31T00:03:32Z","title_canon_sha256":"edce5cd2f73a15140c5bbbbe2006ddaab5ebd9b0ef1c3bdd5fbf3b3c5a5d47ec"},"schema_version":"1.0","source":{"id":"1101.0182","kind":"arxiv","version":1}},"canonical_sha256":"cd7b357a4fa5e590f8da9b1045d352730ad38bf704974b7b98e065524ef63978","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd7b357a4fa5e590f8da9b1045d352730ad38bf704974b7b98e065524ef63978","first_computed_at":"2026-05-18T04:32:10.868405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:10.868405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mY/m5+YKPDOcBOdwJO7vHg08LBqbhJXKRAT3NSRCG3QIM789vZrASR+Ews2qak3UW5wgvhe8rDyU2q6mx8qnCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:10.868821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.0182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42fec3f39b6a6b89410efb351449cb07514d66f77c06efc7c6ce47610931866d","sha256:82cf69a73dadf6a9d32590d53b52cb7822dcc90b23f6a112eefeb4eda3caaee7"],"state_sha256":"b000f805305c4e1bd22656a59e7716d53f96386f43fc851166fa2990fa26eca4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EVSRt35yLjN+P8+kxqwbVb8rer4dr0PQKodCUhP/gw6BmPShKZ/75I0wXYT3IysDMbydXgRUSDXAIydsuXgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:18:52.941202Z","bundle_sha256":"021eb8963a7d6b22ce9b70b908ffadcd74dad91be4f6f6205c4776b19c13f611"}}