{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JHO5WYVO3C6OKYC7VMUD52U6PM","short_pith_number":"pith:JHO5WYVO","canonical_record":{"source":{"id":"1303.1066","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-05T15:26:21Z","cross_cats_sorted":[],"title_canon_sha256":"6beb248a1fabd52d607914c3f7cb92a1eacd6de192f64f43aeea8cf20f6ae840","abstract_canon_sha256":"48384556886dd742e4982f207bc5c28135c6167c1c60514a30463e29b4eeed8b"},"schema_version":"1.0"},"canonical_sha256":"49dddb62aed8bce5605fab283eea9e7b3c387019b2a9c1e6e12184a6481cd081","source":{"kind":"arxiv","id":"1303.1066","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1066","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1066v2","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1066","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"JHO5WYVO3C6O","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JHO5WYVO3C6OKYC7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JHO5WYVO","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JHO5WYVO3C6OKYC7VMUD52U6PM","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1066","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-05T15:26:21Z","cross_cats_sorted":[],"title_canon_sha256":"6beb248a1fabd52d607914c3f7cb92a1eacd6de192f64f43aeea8cf20f6ae840","abstract_canon_sha256":"48384556886dd742e4982f207bc5c28135c6167c1c60514a30463e29b4eeed8b"},"schema_version":"1.0"},"canonical_sha256":"49dddb62aed8bce5605fab283eea9e7b3c387019b2a9c1e6e12184a6481cd081","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:05.708665Z","signature_b64":"tFNDWpdjo/jkRSsm/20LWI5aXggDtu2dsZbAHiQzYMIatSO/Ipx0WNbiK0TG9JrSKmgKnyNd6I4TyQUu7NQnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49dddb62aed8bce5605fab283eea9e7b3c387019b2a9c1e6e12184a6481cd081","last_reissued_at":"2026-05-18T03:02:05.708047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:05.708047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1066","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-18T03:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"as7NvckPbacXRauejP+AoSHcLVuOVtXtn0SNmk8XwllU9xAo6FVKsgGIjXBLi3Ebt0H0IEr3+cAiNvYZZJD9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T07:06:02.954865Z"},"content_sha256":"2033f72b5adc3c15db1df9c488cc6776e5469badd7f32548cdd6ea04a0ae29f9","schema_version":"1.0","event_id":"sha256:2033f72b5adc3c15db1df9c488cc6776e5469badd7f32548cdd6ea04a0ae29f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JHO5WYVO3C6OKYC7VMUD52U6PM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Long paths and cycles in random subgraphs of H-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich, Wojciech Samotij","submitted_at":"2013-03-05T15:26:21Z","abstract_excerpt":"Let $\\mathcal{H}$ be a given finite (possibly empty) family of connected graphs, each containing a cycle, and let $G$ be an arbitrary finite $\\mathcal{H}$-free graph with minimum degree at least $k$. For $p \\in [0,1]$, we form a $p$-random subgraph $G_p$ of $G$ by independently keeping each edge of $G$ with probability $p$. Extending a classical result of Ajtai, Koml\\'os, and Szemer\\'edi, we prove that for every positive $\\varepsilon$, there exists a positive $\\delta$ (depending only on $\\varepsilon$) such that the following holds: If $p \\ge \\frac{1+\\varepsilon}{k}$, then with probability tend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1066","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-18T03:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTrdXDi5SEajw9ln3qmXfaa3NxBVb9Zo+Flk44nI5X9mmcACnWpilQCC5pYn4OGz0FnEwoNlanIul6UClcFqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T07:06:02.955209Z"},"content_sha256":"7ac5325a39fa31e26e99090900903a61a2d72709b36b8291de2f48166a2c01c5","schema_version":"1.0","event_id":"sha256:7ac5325a39fa31e26e99090900903a61a2d72709b36b8291de2f48166a2c01c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHO5WYVO3C6OKYC7VMUD52U6PM/bundle.json","state_url":"https://pith.science/pith/JHO5WYVO3C6OKYC7VMUD52U6PM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHO5WYVO3C6OKYC7VMUD52U6PM/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-20T07:06:02Z","links":{"resolver":"https://pith.science/pith/JHO5WYVO3C6OKYC7VMUD52U6PM","bundle":"https://pith.science/pith/JHO5WYVO3C6OKYC7VMUD52U6PM/bundle.json","state":"https://pith.science/pith/JHO5WYVO3C6OKYC7VMUD52U6PM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHO5WYVO3C6OKYC7VMUD52U6PM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JHO5WYVO3C6OKYC7VMUD52U6PM","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":"48384556886dd742e4982f207bc5c28135c6167c1c60514a30463e29b4eeed8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-05T15:26:21Z","title_canon_sha256":"6beb248a1fabd52d607914c3f7cb92a1eacd6de192f64f43aeea8cf20f6ae840"},"schema_version":"1.0","source":{"id":"1303.1066","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1066","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1066v2","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1066","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"JHO5WYVO3C6O","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JHO5WYVO3C6OKYC7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JHO5WYVO","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:7ac5325a39fa31e26e99090900903a61a2d72709b36b8291de2f48166a2c01c5","target":"graph","created_at":"2026-05-18T03:02:05Z","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 $\\mathcal{H}$ be a given finite (possibly empty) family of connected graphs, each containing a cycle, and let $G$ be an arbitrary finite $\\mathcal{H}$-free graph with minimum degree at least $k$. For $p \\in [0,1]$, we form a $p$-random subgraph $G_p$ of $G$ by independently keeping each edge of $G$ with probability $p$. Extending a classical result of Ajtai, Koml\\'os, and Szemer\\'edi, we prove that for every positive $\\varepsilon$, there exists a positive $\\delta$ (depending only on $\\varepsilon$) such that the following holds: If $p \\ge \\frac{1+\\varepsilon}{k}$, then with probability tend","authors_text":"Michael Krivelevich, Wojciech Samotij","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-05T15:26:21Z","title":"Long paths and cycles in random subgraphs of H-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1066","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:2033f72b5adc3c15db1df9c488cc6776e5469badd7f32548cdd6ea04a0ae29f9","target":"record","created_at":"2026-05-18T03:02:05Z","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":"48384556886dd742e4982f207bc5c28135c6167c1c60514a30463e29b4eeed8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-05T15:26:21Z","title_canon_sha256":"6beb248a1fabd52d607914c3f7cb92a1eacd6de192f64f43aeea8cf20f6ae840"},"schema_version":"1.0","source":{"id":"1303.1066","kind":"arxiv","version":2}},"canonical_sha256":"49dddb62aed8bce5605fab283eea9e7b3c387019b2a9c1e6e12184a6481cd081","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49dddb62aed8bce5605fab283eea9e7b3c387019b2a9c1e6e12184a6481cd081","first_computed_at":"2026-05-18T03:02:05.708047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:05.708047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tFNDWpdjo/jkRSsm/20LWI5aXggDtu2dsZbAHiQzYMIatSO/Ipx0WNbiK0TG9JrSKmgKnyNd6I4TyQUu7NQnDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:05.708665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1066","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2033f72b5adc3c15db1df9c488cc6776e5469badd7f32548cdd6ea04a0ae29f9","sha256:7ac5325a39fa31e26e99090900903a61a2d72709b36b8291de2f48166a2c01c5"],"state_sha256":"fe2fdd2e499bcc85cc5e0f5322e23ca1b075e338a4ff2160a5964d8300ad4a4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vofFQtIsAFlbMaNUfYu6Avt4Ql0zrSaxd2Bk/IYbh/fg/oH5L9xUPxG4XsEYj60qmStufnKl+kJKQD1oeANCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T07:06:02.957167Z","bundle_sha256":"3980a1a7a7d4ee47fb3f97324d08d412a64c0cfc200cd82accac9d8961e8df42"}}