{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VH43TBW2D3K4DVO42OVCKZ4QYF","short_pith_number":"pith:VH43TBW2","canonical_record":{"source":{"id":"1009.3721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T07:47:18Z","cross_cats_sorted":[],"title_canon_sha256":"2edf66b4f33af8742c907e28066cd28aa3d2e2efffc8b0f96332f503ce54bee4","abstract_canon_sha256":"8064b2dd27b4118bd338d126755bb3cb517b9cf9bd6df7cd10d5c560c8be4181"},"schema_version":"1.0"},"canonical_sha256":"a9f9b986da1ed5c1d5dcd3aa256790c17d31c8bb440a40c8fa70544715b749c1","source":{"kind":"arxiv","id":"1009.3721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3721","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3721v1","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3721","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"VH43TBW2D3K4","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VH43TBW2D3K4DVO4","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VH43TBW2","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VH43TBW2D3K4DVO42OVCKZ4QYF","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T07:47:18Z","cross_cats_sorted":[],"title_canon_sha256":"2edf66b4f33af8742c907e28066cd28aa3d2e2efffc8b0f96332f503ce54bee4","abstract_canon_sha256":"8064b2dd27b4118bd338d126755bb3cb517b9cf9bd6df7cd10d5c560c8be4181"},"schema_version":"1.0"},"canonical_sha256":"a9f9b986da1ed5c1d5dcd3aa256790c17d31c8bb440a40c8fa70544715b749c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:43.997268Z","signature_b64":"VhRsOrhvqlPrhGnr9HC1QxTPwd3pC7dHamp+Gv0hg1BJhAsKN+e/JkT2ktvOsvHODJyhJloi5SJ9I6ssI9WEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9f9b986da1ed5c1d5dcd3aa256790c17d31c8bb440a40c8fa70544715b749c1","last_reissued_at":"2026-05-18T04:40:43.996669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:43.996669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3721","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:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xjmQeznqEc+tU7McFq2ktqx/Xeb7NPiDBoQK2Yb9Wd9NhULhTH5/NUI4NDVTvdg2cGlNVUCduqHysGKQ+XrqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:13:05.949980Z"},"content_sha256":"a4a8db7d7b0172fdd67b3124233bc82e25282969fa559a6e878024e0bc619422","schema_version":"1.0","event_id":"sha256:a4a8db7d7b0172fdd67b3124233bc82e25282969fa559a6e878024e0bc619422"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VH43TBW2D3K4DVO42OVCKZ4QYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Long cycles in subgraphs of (pseudo)random directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Ido Ben-Eliezer, Michael Krivelevich","submitted_at":"2010-09-20T07:47:18Z","abstract_excerpt":"We study the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles. For every $0 < \\gamma < 1/2$ we find a constant $c=c(\\gamma)$ such that the following holds. Let $G=(V,E)$ be a (pseudo)random directed graph on $n$ vertices, and let $G'$ be a subgraph of $G$ with $(1/2+\\gamma)|E|$ edges. Then $G'$ contains a directed cycle of length at least $(c-o(1))n$. Moreover, there is a subgraph $G''$ of $G$ with $(1/2+\\gamma-o(1))|E|$ edges that does not contain a cycle of length at least $cn$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3721","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:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8DLtxkohEkNVIejv7JkDw9dZkg4WZM0q8aI/FR/EJ+oUCvg4WmzPX+r2m3ENVtk5VM/0Mbd6Kc5601gnUOEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:13:05.950846Z"},"content_sha256":"5d75c2c909ec1387f3502e47631791e1f483159f687b09290fa427a51a13e276","schema_version":"1.0","event_id":"sha256:5d75c2c909ec1387f3502e47631791e1f483159f687b09290fa427a51a13e276"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VH43TBW2D3K4DVO42OVCKZ4QYF/bundle.json","state_url":"https://pith.science/pith/VH43TBW2D3K4DVO42OVCKZ4QYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VH43TBW2D3K4DVO42OVCKZ4QYF/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-30T20:13:05Z","links":{"resolver":"https://pith.science/pith/VH43TBW2D3K4DVO42OVCKZ4QYF","bundle":"https://pith.science/pith/VH43TBW2D3K4DVO42OVCKZ4QYF/bundle.json","state":"https://pith.science/pith/VH43TBW2D3K4DVO42OVCKZ4QYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VH43TBW2D3K4DVO42OVCKZ4QYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VH43TBW2D3K4DVO42OVCKZ4QYF","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":"8064b2dd27b4118bd338d126755bb3cb517b9cf9bd6df7cd10d5c560c8be4181","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T07:47:18Z","title_canon_sha256":"2edf66b4f33af8742c907e28066cd28aa3d2e2efffc8b0f96332f503ce54bee4"},"schema_version":"1.0","source":{"id":"1009.3721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3721","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3721v1","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3721","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"VH43TBW2D3K4","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VH43TBW2D3K4DVO4","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VH43TBW2","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:5d75c2c909ec1387f3502e47631791e1f483159f687b09290fa427a51a13e276","target":"graph","created_at":"2026-05-18T04:40:43Z","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":"We study the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles. For every $0 < \\gamma < 1/2$ we find a constant $c=c(\\gamma)$ such that the following holds. Let $G=(V,E)$ be a (pseudo)random directed graph on $n$ vertices, and let $G'$ be a subgraph of $G$ with $(1/2+\\gamma)|E|$ edges. Then $G'$ contains a directed cycle of length at least $(c-o(1))n$. Moreover, there is a subgraph $G''$ of $G$ with $(1/2+\\gamma-o(1))|E|$ edges that does not contain a cycle of length at least $cn$.","authors_text":"Benny Sudakov, Ido Ben-Eliezer, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T07:47:18Z","title":"Long cycles in subgraphs of (pseudo)random directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3721","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:a4a8db7d7b0172fdd67b3124233bc82e25282969fa559a6e878024e0bc619422","target":"record","created_at":"2026-05-18T04:40:43Z","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":"8064b2dd27b4118bd338d126755bb3cb517b9cf9bd6df7cd10d5c560c8be4181","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T07:47:18Z","title_canon_sha256":"2edf66b4f33af8742c907e28066cd28aa3d2e2efffc8b0f96332f503ce54bee4"},"schema_version":"1.0","source":{"id":"1009.3721","kind":"arxiv","version":1}},"canonical_sha256":"a9f9b986da1ed5c1d5dcd3aa256790c17d31c8bb440a40c8fa70544715b749c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9f9b986da1ed5c1d5dcd3aa256790c17d31c8bb440a40c8fa70544715b749c1","first_computed_at":"2026-05-18T04:40:43.996669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:43.996669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VhRsOrhvqlPrhGnr9HC1QxTPwd3pC7dHamp+Gv0hg1BJhAsKN+e/JkT2ktvOsvHODJyhJloi5SJ9I6ssI9WEBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:43.997268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4a8db7d7b0172fdd67b3124233bc82e25282969fa559a6e878024e0bc619422","sha256:5d75c2c909ec1387f3502e47631791e1f483159f687b09290fa427a51a13e276"],"state_sha256":"6b46b6395a48bdf9f16927154871ddf444db0dbe217f1d18e874f3bb16617050"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6H7EcL7r35glBHaJS6iarUYXJ2Z7YtEqoLnomWYkLBR2aQ0PZbAfqr+ZrmuOW3LEp+/2tH5HJ+aV09Fbi7gBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:13:05.954730Z","bundle_sha256":"90a1e44155adc724d22df01bcfc228bbb5124d0a4b72358d88814571b6913812"}}