{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VIGI3DPKR4UMRJG6YZU65MXWZA","short_pith_number":"pith:VIGI3DPK","canonical_record":{"source":{"id":"1005.5716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-31T18:16:51Z","cross_cats_sorted":[],"title_canon_sha256":"ac2a1b0e4ff7fc716efaf6ee3b155613e64d0bf835d1baf0c478f2619738c211","abstract_canon_sha256":"9cfb83733165722e7b0206f72e458815db10a02e50ab8addcf26d8129c260afa"},"schema_version":"1.0"},"canonical_sha256":"aa0c8d8dea8f28c8a4dec669eeb2f6c8078a614b9af12b7e53cb6a1b4090773f","source":{"kind":"arxiv","id":"1005.5716","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5716","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5716v2","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5716","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"VIGI3DPKR4UM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VIGI3DPKR4UMRJG6","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VIGI3DPK","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VIGI3DPKR4UMRJG6YZU65MXWZA","target":"record","payload":{"canonical_record":{"source":{"id":"1005.5716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-31T18:16:51Z","cross_cats_sorted":[],"title_canon_sha256":"ac2a1b0e4ff7fc716efaf6ee3b155613e64d0bf835d1baf0c478f2619738c211","abstract_canon_sha256":"9cfb83733165722e7b0206f72e458815db10a02e50ab8addcf26d8129c260afa"},"schema_version":"1.0"},"canonical_sha256":"aa0c8d8dea8f28c8a4dec669eeb2f6c8078a614b9af12b7e53cb6a1b4090773f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:48.601696Z","signature_b64":"Yj2cLRLeZjqDaFKL0EcrBHdVp3DU9fK3ZFFlSCuiTboKudD8067k/iTAyAWjeRGfc3BBcR5TeNWDRRLYLERKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa0c8d8dea8f28c8a4dec669eeb2f6c8078a614b9af12b7e53cb6a1b4090773f","last_reissued_at":"2026-05-18T02:23:48.601074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:48.601074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.5716","source_version":2,"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-18T02:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEoHVWrJ/nY7HN0PmuQTJtrHbRJM9r5SIKex+Ys8V1Wi5JMuAIw5B3NvP66BjKUYRboxQnK0wvlDTsD+qpPKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:19:25.255922Z"},"content_sha256":"63960f4146bd9d81b4655aff72e77e77be8e1a5249f2d5a3a63bc7f288d2707a","schema_version":"1.0","event_id":"sha256:63960f4146bd9d81b4655aff72e77e77be8e1a5249f2d5a3a63bc7f288d2707a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VIGI3DPKR4UMRJG6YZU65MXWZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pancyclic subgraphs of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Choongbum Lee, Wojciech Samotij","submitted_at":"2010-05-31T18:16:51Z","abstract_excerpt":"An $n$-vertex graph is called pancyclic if it contains a cycle of length $t$ for all $3 \\leq t \\leq n$. In this paper, we study pancyclicity of random graphs in the context of resilience, and prove that if $p \\gg n^{-1/2}$, then the random graph $G(n,p)$ a.a.s. satisfies the following property: Every Hamiltonian subgraph of $G(n,p)$ with more than $(1/2 + o(1)){n \\choose 2}p$ edges is pancyclic. This result is best possible in two ways. First, the range of $p$ is asymptotically tight; second, the proportion 1/2 of edges cannot be reduced. Our theorem extends a classical theorem of Bondy, and i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5716","kind":"arxiv","version":2},"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-18T02:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ty1zk2Q6mR3TWLhuDVB+M9WLq4sXzs9Tuw3kstI4stcQZb4wDNCATo9O9ZZkC9vnGl/q2q95Ppa6yvG/6dp1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:19:25.256527Z"},"content_sha256":"69ca71e0147911e5124bed6b7f8811633d5f93c360a6cf1b26d85df3976d70a3","schema_version":"1.0","event_id":"sha256:69ca71e0147911e5124bed6b7f8811633d5f93c360a6cf1b26d85df3976d70a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIGI3DPKR4UMRJG6YZU65MXWZA/bundle.json","state_url":"https://pith.science/pith/VIGI3DPKR4UMRJG6YZU65MXWZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIGI3DPKR4UMRJG6YZU65MXWZA/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-08T03:19:25Z","links":{"resolver":"https://pith.science/pith/VIGI3DPKR4UMRJG6YZU65MXWZA","bundle":"https://pith.science/pith/VIGI3DPKR4UMRJG6YZU65MXWZA/bundle.json","state":"https://pith.science/pith/VIGI3DPKR4UMRJG6YZU65MXWZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIGI3DPKR4UMRJG6YZU65MXWZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VIGI3DPKR4UMRJG6YZU65MXWZA","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":"9cfb83733165722e7b0206f72e458815db10a02e50ab8addcf26d8129c260afa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-31T18:16:51Z","title_canon_sha256":"ac2a1b0e4ff7fc716efaf6ee3b155613e64d0bf835d1baf0c478f2619738c211"},"schema_version":"1.0","source":{"id":"1005.5716","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5716","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5716v2","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5716","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"VIGI3DPKR4UM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VIGI3DPKR4UMRJG6","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VIGI3DPK","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:69ca71e0147911e5124bed6b7f8811633d5f93c360a6cf1b26d85df3976d70a3","target":"graph","created_at":"2026-05-18T02:23:48Z","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":"An $n$-vertex graph is called pancyclic if it contains a cycle of length $t$ for all $3 \\leq t \\leq n$. In this paper, we study pancyclicity of random graphs in the context of resilience, and prove that if $p \\gg n^{-1/2}$, then the random graph $G(n,p)$ a.a.s. satisfies the following property: Every Hamiltonian subgraph of $G(n,p)$ with more than $(1/2 + o(1)){n \\choose 2}p$ edges is pancyclic. This result is best possible in two ways. First, the range of $p$ is asymptotically tight; second, the proportion 1/2 of edges cannot be reduced. Our theorem extends a classical theorem of Bondy, and i","authors_text":"Choongbum Lee, Wojciech Samotij","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-31T18:16:51Z","title":"Pancyclic subgraphs of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5716","kind":"arxiv","version":2},"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:63960f4146bd9d81b4655aff72e77e77be8e1a5249f2d5a3a63bc7f288d2707a","target":"record","created_at":"2026-05-18T02:23:48Z","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":"9cfb83733165722e7b0206f72e458815db10a02e50ab8addcf26d8129c260afa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-31T18:16:51Z","title_canon_sha256":"ac2a1b0e4ff7fc716efaf6ee3b155613e64d0bf835d1baf0c478f2619738c211"},"schema_version":"1.0","source":{"id":"1005.5716","kind":"arxiv","version":2}},"canonical_sha256":"aa0c8d8dea8f28c8a4dec669eeb2f6c8078a614b9af12b7e53cb6a1b4090773f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa0c8d8dea8f28c8a4dec669eeb2f6c8078a614b9af12b7e53cb6a1b4090773f","first_computed_at":"2026-05-18T02:23:48.601074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:48.601074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yj2cLRLeZjqDaFKL0EcrBHdVp3DU9fK3ZFFlSCuiTboKudD8067k/iTAyAWjeRGfc3BBcR5TeNWDRRLYLERKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:48.601696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.5716","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63960f4146bd9d81b4655aff72e77e77be8e1a5249f2d5a3a63bc7f288d2707a","sha256:69ca71e0147911e5124bed6b7f8811633d5f93c360a6cf1b26d85df3976d70a3"],"state_sha256":"026d322b057b4ad225165cfbd371e61324c348539d1afac7ee4744ee7d50c976"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6h1N8yLlrJ92R9A9Lz7dUo/4YsKp2A97yAQLn/yieaa2wPw8vLNTxMGeNvarlC1VYIMu3q/sBbFveJ/MH56Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:19:25.259932Z","bundle_sha256":"98f187e1ef750a44e247fcc101c118844c6ccdbf4e5b8b27ec88c7d7a22ed8eb"}}