{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ODEQ2UZ7IB4T7WRAQ34CPYS7VG","short_pith_number":"pith:ODEQ2UZ7","canonical_record":{"source":{"id":"2308.14141","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-27T15:42:17Z","cross_cats_sorted":[],"title_canon_sha256":"766cbc603a06295b67cdec93eadf1d7dfdfbba33b9ba6e578efca0c8f4d7b9ae","abstract_canon_sha256":"427f008c8ffe6fa6d247e1780a513adea0839216179559fd7f0130f891ed59c1"},"schema_version":"1.0"},"canonical_sha256":"70c90d533f40793fda2086f827e25fa9920fbfa259fedd679f6fff341e65b26e","source":{"kind":"arxiv","id":"2308.14141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.14141","created_at":"2026-07-05T06:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"2308.14141v1","created_at":"2026-07-05T06:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.14141","created_at":"2026-07-05T06:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"ODEQ2UZ7IB4T","created_at":"2026-07-05T06:45:22Z"},{"alias_kind":"pith_short_16","alias_value":"ODEQ2UZ7IB4T7WRA","created_at":"2026-07-05T06:45:22Z"},{"alias_kind":"pith_short_8","alias_value":"ODEQ2UZ7","created_at":"2026-07-05T06:45:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ODEQ2UZ7IB4T7WRAQ34CPYS7VG","target":"record","payload":{"canonical_record":{"source":{"id":"2308.14141","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-27T15:42:17Z","cross_cats_sorted":[],"title_canon_sha256":"766cbc603a06295b67cdec93eadf1d7dfdfbba33b9ba6e578efca0c8f4d7b9ae","abstract_canon_sha256":"427f008c8ffe6fa6d247e1780a513adea0839216179559fd7f0130f891ed59c1"},"schema_version":"1.0"},"canonical_sha256":"70c90d533f40793fda2086f827e25fa9920fbfa259fedd679f6fff341e65b26e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:45:22.264330Z","signature_b64":"yt9/Sb6KGhOWgQ8vWUFHh3+E4h3PRHhB+KrfZjYp8itNGLFtOh5aLHqmqaxm3g/5aGVNeHdRskeeAbuxS7/rCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70c90d533f40793fda2086f827e25fa9920fbfa259fedd679f6fff341e65b26e","last_reissued_at":"2026-07-05T06:45:22.263944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:45:22.263944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.14141","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-07-05T06:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Wur6iJVOkCoKL0KNzNCx3cdx+ELS+vfwYmjp2OFYhT3hB0uq0jdPbi+T+g8L7rbBpgfKulUdkdqG4raheWfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:55:44.799987Z"},"content_sha256":"cf8430f4da9cd6e3763649b3de9a30d511d0d6dab3f211ed85873185f092c64d","schema_version":"1.0","event_id":"sha256:cf8430f4da9cd6e3763649b3de9a30d511d0d6dab3f211ed85873185f092c64d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ODEQ2UZ7IB4T7WRAQ34CPYS7VG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Giant Rainbow Trees in Sparse Random Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Tolson Bell","submitted_at":"2023-08-27T15:42:17Z","abstract_excerpt":"For any small constant $\\epsilon>0$, the Erd\\H{o}s-R\\'enyi random graph $G(n,\\frac{1+\\epsilon}{n})$ with high probability has a unique largest component which contains $(1\\pm O(\\epsilon))2\\epsilon n$ vertices. Let $G_c(n,p)$ be obtained by assigning each edge in $G(n,p)$ a color in $[c]$ independently and uniformly. Cooley, Do, Erde, and Missethan proved that for any fixed $\\alpha>0$, $G_{\\alpha n}(n,\\frac{1+\\epsilon}{n})$ with high probability contains a rainbow tree (a tree that does not repeat colors) which covers $(1\\pm O(\\epsilon))\\frac{\\alpha}{\\alpha+1}\\epsilon n$ vertices, and conjectur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.14141","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.14141/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"},"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-07-05T06:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CC13W12fCzmJUbUZ9g37s7cqjry//qkeNbR5rSwRWZDiCNNF1oQWljocxaj7YOK6wIr1ilRy7p1/r2AjFs+FAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:55:44.800385Z"},"content_sha256":"d5a7921734147fab957eea33b4ec16c208f07ef47180fa479b6edbf9643640b4","schema_version":"1.0","event_id":"sha256:d5a7921734147fab957eea33b4ec16c208f07ef47180fa479b6edbf9643640b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODEQ2UZ7IB4T7WRAQ34CPYS7VG/bundle.json","state_url":"https://pith.science/pith/ODEQ2UZ7IB4T7WRAQ34CPYS7VG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODEQ2UZ7IB4T7WRAQ34CPYS7VG/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-07-08T13:55:44Z","links":{"resolver":"https://pith.science/pith/ODEQ2UZ7IB4T7WRAQ34CPYS7VG","bundle":"https://pith.science/pith/ODEQ2UZ7IB4T7WRAQ34CPYS7VG/bundle.json","state":"https://pith.science/pith/ODEQ2UZ7IB4T7WRAQ34CPYS7VG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODEQ2UZ7IB4T7WRAQ34CPYS7VG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ODEQ2UZ7IB4T7WRAQ34CPYS7VG","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":"427f008c8ffe6fa6d247e1780a513adea0839216179559fd7f0130f891ed59c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-27T15:42:17Z","title_canon_sha256":"766cbc603a06295b67cdec93eadf1d7dfdfbba33b9ba6e578efca0c8f4d7b9ae"},"schema_version":"1.0","source":{"id":"2308.14141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.14141","created_at":"2026-07-05T06:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"2308.14141v1","created_at":"2026-07-05T06:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.14141","created_at":"2026-07-05T06:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"ODEQ2UZ7IB4T","created_at":"2026-07-05T06:45:22Z"},{"alias_kind":"pith_short_16","alias_value":"ODEQ2UZ7IB4T7WRA","created_at":"2026-07-05T06:45:22Z"},{"alias_kind":"pith_short_8","alias_value":"ODEQ2UZ7","created_at":"2026-07-05T06:45:22Z"}],"graph_snapshots":[{"event_id":"sha256:d5a7921734147fab957eea33b4ec16c208f07ef47180fa479b6edbf9643640b4","target":"graph","created_at":"2026-07-05T06:45:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.14141/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For any small constant $\\epsilon>0$, the Erd\\H{o}s-R\\'enyi random graph $G(n,\\frac{1+\\epsilon}{n})$ with high probability has a unique largest component which contains $(1\\pm O(\\epsilon))2\\epsilon n$ vertices. Let $G_c(n,p)$ be obtained by assigning each edge in $G(n,p)$ a color in $[c]$ independently and uniformly. Cooley, Do, Erde, and Missethan proved that for any fixed $\\alpha>0$, $G_{\\alpha n}(n,\\frac{1+\\epsilon}{n})$ with high probability contains a rainbow tree (a tree that does not repeat colors) which covers $(1\\pm O(\\epsilon))\\frac{\\alpha}{\\alpha+1}\\epsilon n$ vertices, and conjectur","authors_text":"Alan Frieze, Tolson Bell","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-27T15:42:17Z","title":"Giant Rainbow Trees in Sparse Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.14141","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:cf8430f4da9cd6e3763649b3de9a30d511d0d6dab3f211ed85873185f092c64d","target":"record","created_at":"2026-07-05T06:45:22Z","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":"427f008c8ffe6fa6d247e1780a513adea0839216179559fd7f0130f891ed59c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-27T15:42:17Z","title_canon_sha256":"766cbc603a06295b67cdec93eadf1d7dfdfbba33b9ba6e578efca0c8f4d7b9ae"},"schema_version":"1.0","source":{"id":"2308.14141","kind":"arxiv","version":1}},"canonical_sha256":"70c90d533f40793fda2086f827e25fa9920fbfa259fedd679f6fff341e65b26e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70c90d533f40793fda2086f827e25fa9920fbfa259fedd679f6fff341e65b26e","first_computed_at":"2026-07-05T06:45:22.263944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:45:22.263944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yt9/Sb6KGhOWgQ8vWUFHh3+E4h3PRHhB+KrfZjYp8itNGLFtOh5aLHqmqaxm3g/5aGVNeHdRskeeAbuxS7/rCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:45:22.264330Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.14141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf8430f4da9cd6e3763649b3de9a30d511d0d6dab3f211ed85873185f092c64d","sha256:d5a7921734147fab957eea33b4ec16c208f07ef47180fa479b6edbf9643640b4"],"state_sha256":"f4f5016fc0f1b6a85f7a1596ebbf7c9668cbfccad3776afd8dc85f9c2d4ff86e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Pgk6O5zCOn+6sQxMQYlzbGqbcJpZgKly9zhf67JUaCmqPi7n+rYAgfxeeR5k7rprHEfEXsKdzBxEJ/xvZ2RCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T13:55:44.802524Z","bundle_sha256":"6bfbe5a86529da0078a8915ddf35609c3e9514a44062be00e57ce262538a47bf"}}