{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NHXKSBWYOVB6XMQT5AMUJRDMMN","short_pith_number":"pith:NHXKSBWY","schema_version":"1.0","canonical_sha256":"69eea906d87543ebb213e81944c46c637c11c199646558e55259535787f68d7f","source":{"kind":"arxiv","id":"1102.3147","version":1},"attestation_state":"computed","paper":{"title":"Longest cycles in sparse random digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Eyal Lubetzky, Michael Krivelevich","submitted_at":"2011-02-15T18:22:19Z","abstract_excerpt":"Long paths and cycles in sparse random graphs and digraphs were studied intensively in the 1980's. It was finally shown by Frieze in 1986 that the random graph $\\cG(n,p)$ with $p=c/n$ has a cycle on at all but at most $(1+\\epsilon)ce^{-c}n$ vertices with high probability, where $\\epsilon=\\epsilon(c)\\to 0$ as $c\\to\\infty$. This estimate on the number of uncovered vertices is essentially tight due to vertices of degree 1. However, for the random digraph $\\cD(n,p)$ no tight result was known and the best estimate was a factor of $c/2$ away from the corresponding lower bound. In this work we close "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1102.3147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-15T18:22:19Z","cross_cats_sorted":[],"title_canon_sha256":"9e72a5360bf56f374a0a5250ad90d213886712d13c32913398d64912a53dc084","abstract_canon_sha256":"0a242e3291f8aeeeff77ffdf4d93b614f5ae2c4ae2cfa086f5711de2c4aa1817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:38.327113Z","signature_b64":"+WWYwtB8u9xLlsHC00pxY8/E62EmXBouRtKVN7Scgycv++tZSndUCCtCkijkuchxLtk5buH/3ucydAUNWPogAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69eea906d87543ebb213e81944c46c637c11c199646558e55259535787f68d7f","last_reissued_at":"2026-05-18T04:28:38.326727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:38.326727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest cycles in sparse random digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Eyal Lubetzky, Michael Krivelevich","submitted_at":"2011-02-15T18:22:19Z","abstract_excerpt":"Long paths and cycles in sparse random graphs and digraphs were studied intensively in the 1980's. It was finally shown by Frieze in 1986 that the random graph $\\cG(n,p)$ with $p=c/n$ has a cycle on at all but at most $(1+\\epsilon)ce^{-c}n$ vertices with high probability, where $\\epsilon=\\epsilon(c)\\to 0$ as $c\\to\\infty$. This estimate on the number of uncovered vertices is essentially tight due to vertices of degree 1. However, for the random digraph $\\cD(n,p)$ no tight result was known and the best estimate was a factor of $c/2$ away from the corresponding lower bound. In this work we close "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3147","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.3147","created_at":"2026-05-18T04:28:38.326778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3147v1","created_at":"2026-05-18T04:28:38.326778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3147","created_at":"2026-05-18T04:28:38.326778+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHXKSBWYOVB6","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHXKSBWYOVB6XMQT","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHXKSBWY","created_at":"2026-05-18T12:26:37.096874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NHXKSBWYOVB6XMQT5AMUJRDMMN","json":"https://pith.science/pith/NHXKSBWYOVB6XMQT5AMUJRDMMN.json","graph_json":"https://pith.science/api/pith-number/NHXKSBWYOVB6XMQT5AMUJRDMMN/graph.json","events_json":"https://pith.science/api/pith-number/NHXKSBWYOVB6XMQT5AMUJRDMMN/events.json","paper":"https://pith.science/paper/NHXKSBWY"},"agent_actions":{"view_html":"https://pith.science/pith/NHXKSBWYOVB6XMQT5AMUJRDMMN","download_json":"https://pith.science/pith/NHXKSBWYOVB6XMQT5AMUJRDMMN.json","view_paper":"https://pith.science/paper/NHXKSBWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3147&json=true","fetch_graph":"https://pith.science/api/pith-number/NHXKSBWYOVB6XMQT5AMUJRDMMN/graph.json","fetch_events":"https://pith.science/api/pith-number/NHXKSBWYOVB6XMQT5AMUJRDMMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHXKSBWYOVB6XMQT5AMUJRDMMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHXKSBWYOVB6XMQT5AMUJRDMMN/action/storage_attestation","attest_author":"https://pith.science/pith/NHXKSBWYOVB6XMQT5AMUJRDMMN/action/author_attestation","sign_citation":"https://pith.science/pith/NHXKSBWYOVB6XMQT5AMUJRDMMN/action/citation_signature","submit_replication":"https://pith.science/pith/NHXKSBWYOVB6XMQT5AMUJRDMMN/action/replication_record"}},"created_at":"2026-05-18T04:28:38.326778+00:00","updated_at":"2026-05-18T04:28:38.326778+00:00"}