{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IMNRU6LDB7AIRZ6ZZQAADSROFE","short_pith_number":"pith:IMNRU6LD","canonical_record":{"source":{"id":"1510.09166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-30T17:24:11Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2e2b37d5f5f340e798c444f4ff8ff810319b68a56dad86d4c6f1a22b67b79469","abstract_canon_sha256":"9d40bffe5719efab62fb443145d7e6cbfbbfc975cf91b9c3274a99e74cb6d690"},"schema_version":"1.0"},"canonical_sha256":"431b1a79630fc088e7d9cc0001ca2e2913162dc1fe2647c9d2dde7b28b5166e1","source":{"kind":"arxiv","id":"1510.09166","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09166","created_at":"2026-05-18T01:24:17Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09166v3","created_at":"2026-05-18T01:24:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09166","created_at":"2026-05-18T01:24:17Z"},{"alias_kind":"pith_short_12","alias_value":"IMNRU6LDB7AI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IMNRU6LDB7AIRZ6Z","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IMNRU6LD","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IMNRU6LDB7AIRZ6ZZQAADSROFE","target":"record","payload":{"canonical_record":{"source":{"id":"1510.09166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-30T17:24:11Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2e2b37d5f5f340e798c444f4ff8ff810319b68a56dad86d4c6f1a22b67b79469","abstract_canon_sha256":"9d40bffe5719efab62fb443145d7e6cbfbbfc975cf91b9c3274a99e74cb6d690"},"schema_version":"1.0"},"canonical_sha256":"431b1a79630fc088e7d9cc0001ca2e2913162dc1fe2647c9d2dde7b28b5166e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:17.844455Z","signature_b64":"8yzp+/l/8k5NowtGC0EgTTbPRYbxQGgZN1j9WDwFyl++NkCz9Kr1lnot2R2wT5uj6vh8wLASkmkcElnArIr9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"431b1a79630fc088e7d9cc0001ca2e2913162dc1fe2647c9d2dde7b28b5166e1","last_reissued_at":"2026-05-18T01:24:17.843889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:17.843889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.09166","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-18T01:24:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItiKR3gqUPFm8KbWvov7OgPwfJ/B43T0jvRnM2jq94eAgbfUypijopgIzec23vnXJv3aAgQ/vJpxgxAZ/J79Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:47:53.517308Z"},"content_sha256":"36f82070ef14bbb0da0640c5e5c4682977a606a0d8c1fa0de8fcd554a7e386d5","schema_version":"1.0","event_id":"sha256:36f82070ef14bbb0da0640c5e5c4682977a606a0d8c1fa0de8fcd554a7e386d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IMNRU6LDB7AIRZ6ZZQAADSROFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Long paths and cycles in random subgraphs of graphs with large minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Felix Joos, Stefan Ehard","submitted_at":"2015-10-30T17:24:11Z","abstract_excerpt":"For a graph $G$ and $p\\in [0,1]$, let $G_p$ arise from $G$ by deleting every edge mutually independently with probability $1-p$. The random graph model $(K_n)_p$ is certainly the most investigated random graph model and also known as the $G(n,p)$-model. We show that several results concerning the length of the longest path/cycle naturally translate to $G_p$ if $G$ is an arbitrary graph of minimum degree at least $n-1$.\n  For a constant $c$, we show that asymptotically almost surely the length of the longest path is at least $(1-(1+\\epsilon(c))ce^{-c})n$ for some function $\\epsilon(c)\\to 0$ as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09166","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-18T01:24:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqmn0I6IYLvz0uu2P+qQVpYQMsy5T7ETYS+aYZ36Qtyweb7eWZNQ89rqNV8a0TEjb6QCEmQrVHY6gdLAKMAhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:47:53.517680Z"},"content_sha256":"849ceb2938aa723eef118b615e5d457fcc0b235ced04461b986aac0d10cd2468","schema_version":"1.0","event_id":"sha256:849ceb2938aa723eef118b615e5d457fcc0b235ced04461b986aac0d10cd2468"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMNRU6LDB7AIRZ6ZZQAADSROFE/bundle.json","state_url":"https://pith.science/pith/IMNRU6LDB7AIRZ6ZZQAADSROFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMNRU6LDB7AIRZ6ZZQAADSROFE/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-04T02:47:53Z","links":{"resolver":"https://pith.science/pith/IMNRU6LDB7AIRZ6ZZQAADSROFE","bundle":"https://pith.science/pith/IMNRU6LDB7AIRZ6ZZQAADSROFE/bundle.json","state":"https://pith.science/pith/IMNRU6LDB7AIRZ6ZZQAADSROFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMNRU6LDB7AIRZ6ZZQAADSROFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IMNRU6LDB7AIRZ6ZZQAADSROFE","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":"9d40bffe5719efab62fb443145d7e6cbfbbfc975cf91b9c3274a99e74cb6d690","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-30T17:24:11Z","title_canon_sha256":"2e2b37d5f5f340e798c444f4ff8ff810319b68a56dad86d4c6f1a22b67b79469"},"schema_version":"1.0","source":{"id":"1510.09166","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09166","created_at":"2026-05-18T01:24:17Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09166v3","created_at":"2026-05-18T01:24:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09166","created_at":"2026-05-18T01:24:17Z"},{"alias_kind":"pith_short_12","alias_value":"IMNRU6LDB7AI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IMNRU6LDB7AIRZ6Z","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IMNRU6LD","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:849ceb2938aa723eef118b615e5d457fcc0b235ced04461b986aac0d10cd2468","target":"graph","created_at":"2026-05-18T01:24:17Z","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 a graph $G$ and $p\\in [0,1]$, let $G_p$ arise from $G$ by deleting every edge mutually independently with probability $1-p$. The random graph model $(K_n)_p$ is certainly the most investigated random graph model and also known as the $G(n,p)$-model. We show that several results concerning the length of the longest path/cycle naturally translate to $G_p$ if $G$ is an arbitrary graph of minimum degree at least $n-1$.\n  For a constant $c$, we show that asymptotically almost surely the length of the longest path is at least $(1-(1+\\epsilon(c))ce^{-c})n$ for some function $\\epsilon(c)\\to 0$ as ","authors_text":"Felix Joos, Stefan Ehard","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-30T17:24:11Z","title":"Long paths and cycles in random subgraphs of graphs with large minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09166","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:36f82070ef14bbb0da0640c5e5c4682977a606a0d8c1fa0de8fcd554a7e386d5","target":"record","created_at":"2026-05-18T01:24:17Z","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":"9d40bffe5719efab62fb443145d7e6cbfbbfc975cf91b9c3274a99e74cb6d690","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-30T17:24:11Z","title_canon_sha256":"2e2b37d5f5f340e798c444f4ff8ff810319b68a56dad86d4c6f1a22b67b79469"},"schema_version":"1.0","source":{"id":"1510.09166","kind":"arxiv","version":3}},"canonical_sha256":"431b1a79630fc088e7d9cc0001ca2e2913162dc1fe2647c9d2dde7b28b5166e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"431b1a79630fc088e7d9cc0001ca2e2913162dc1fe2647c9d2dde7b28b5166e1","first_computed_at":"2026-05-18T01:24:17.843889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:17.843889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8yzp+/l/8k5NowtGC0EgTTbPRYbxQGgZN1j9WDwFyl++NkCz9Kr1lnot2R2wT5uj6vh8wLASkmkcElnArIr9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:17.844455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.09166","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36f82070ef14bbb0da0640c5e5c4682977a606a0d8c1fa0de8fcd554a7e386d5","sha256:849ceb2938aa723eef118b615e5d457fcc0b235ced04461b986aac0d10cd2468"],"state_sha256":"f7c8fe34d4d1928bdf6a087e916a75f344472d0c30f7c5ccb7319744672bf975"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vul1JR86r1UAJFO5QBUnBss6p9/8TW9ZhTBEfYO7C9w9Y+NYd1PHa8hVpmoWbD+Fyto9IGt7lgkHzwKAZ9iLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:47:53.519734Z","bundle_sha256":"93f8378636e66eb677c971548e2ed3ea2be9c5300f5357e56158ac95c37a8035"}}