{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:LDWCHUTSGV5HKUVRJCHEBQR6PV","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":"9d77a89d03c2467dd2be924651f96628a1303dea1b51628a5e1b75582d77d62c","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-14T13:56:20Z","title_canon_sha256":"cccc5d0286b97700e7cb2d29461d5fccaef6b3e7725f5a732f7b732c3c16eb0d"},"schema_version":"1.0","source":{"id":"2111.07345","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.07345","created_at":"2026-07-05T04:43:36Z"},{"alias_kind":"arxiv_version","alias_value":"2111.07345v3","created_at":"2026-07-05T04:43:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.07345","created_at":"2026-07-05T04:43:36Z"},{"alias_kind":"pith_short_12","alias_value":"LDWCHUTSGV5H","created_at":"2026-07-05T04:43:36Z"},{"alias_kind":"pith_short_16","alias_value":"LDWCHUTSGV5HKUVR","created_at":"2026-07-05T04:43:36Z"},{"alias_kind":"pith_short_8","alias_value":"LDWCHUTS","created_at":"2026-07-05T04:43:36Z"}],"graph_snapshots":[{"event_id":"sha256:adc425ae75894076bf8516c595e510c8aae3c4475ec1d581c90ffe273779223f","target":"graph","created_at":"2026-07-05T04:43:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.07345/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the performance of the Depth First Search (DFS) algorithm on the random graph $G\\left(n,\\frac{1+\\epsilon}{n}\\right)$, $\\epsilon>0$ a small constant. Recently, Enriquez, Faraud and M\\'enard [2] proved that the stack $U$ of the DFS follows a specific scaling limit, reaching the maximal height of $(1+o_{\\epsilon}(1))\\epsilon^2n$. Here we provide a simple analysis for the typical length of a maximum path discovered by the DFS.","authors_text":"Michael Krivelevich, Sahar Diskin","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-14T13:56:20Z","title":"On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.07345","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:79c82a77d752b16bfcfcacfe4260e2220ccae03794ee2adc636d830170b938a1","target":"record","created_at":"2026-07-05T04:43:36Z","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":"9d77a89d03c2467dd2be924651f96628a1303dea1b51628a5e1b75582d77d62c","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-14T13:56:20Z","title_canon_sha256":"cccc5d0286b97700e7cb2d29461d5fccaef6b3e7725f5a732f7b732c3c16eb0d"},"schema_version":"1.0","source":{"id":"2111.07345","kind":"arxiv","version":3}},"canonical_sha256":"58ec23d272357a7552b1488e40c23e7d586994166b446c8ff460bb259ec89834","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58ec23d272357a7552b1488e40c23e7d586994166b446c8ff460bb259ec89834","first_computed_at":"2026-07-05T04:43:36.692157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:43:36.692157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YOG8filn4bX/jU7Z5QFkpWyMawd+/vMlbWsJkp9lf8Ucl+72Y7uROLtTEcxJiofUY1S7Rmt5JdxqvjtRfXy6BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:43:36.692636Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.07345","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79c82a77d752b16bfcfcacfe4260e2220ccae03794ee2adc636d830170b938a1","sha256:adc425ae75894076bf8516c595e510c8aae3c4475ec1d581c90ffe273779223f"],"state_sha256":"42b5736c10f50f0380627416d83c9128743d3c89644a08539bea07d80edb03e9"}