{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OVUAPTHUPADKFK67WMSLPK6JB3","short_pith_number":"pith:OVUAPTHU","canonical_record":{"source":{"id":"2404.05664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-08T16:48:20Z","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"title_canon_sha256":"71403b394a588db50fd41d8964634e7c7b35e59663e3eb46c6a76c5acbc403a9","abstract_canon_sha256":"75ffbee5e948aa6134ad7d089a61f63c493d1df74a4cfd8c664ee0d41bd71789"},"schema_version":"1.0"},"canonical_sha256":"756807ccf47806a2abdfb324b7abc90ed96f118e7557a2336f9313ade72f0905","source":{"kind":"arxiv","id":"2404.05664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05664","created_at":"2026-07-05T08:05:43Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05664v1","created_at":"2026-07-05T08:05:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05664","created_at":"2026-07-05T08:05:43Z"},{"alias_kind":"pith_short_12","alias_value":"OVUAPTHUPADK","created_at":"2026-07-05T08:05:43Z"},{"alias_kind":"pith_short_16","alias_value":"OVUAPTHUPADKFK67","created_at":"2026-07-05T08:05:43Z"},{"alias_kind":"pith_short_8","alias_value":"OVUAPTHU","created_at":"2026-07-05T08:05:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OVUAPTHUPADKFK67WMSLPK6JB3","target":"record","payload":{"canonical_record":{"source":{"id":"2404.05664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-08T16:48:20Z","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"title_canon_sha256":"71403b394a588db50fd41d8964634e7c7b35e59663e3eb46c6a76c5acbc403a9","abstract_canon_sha256":"75ffbee5e948aa6134ad7d089a61f63c493d1df74a4cfd8c664ee0d41bd71789"},"schema_version":"1.0"},"canonical_sha256":"756807ccf47806a2abdfb324b7abc90ed96f118e7557a2336f9313ade72f0905","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:05:43.895411Z","signature_b64":"rFa48/o+23pkLy9ULlZDwDJA/Y5DXwteBYlD9KWk11cjCvDMjJIbSgZx2Sl61MpKhy9soNwScpVOVO9jnOH6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"756807ccf47806a2abdfb324b7abc90ed96f118e7557a2336f9313ade72f0905","last_reissued_at":"2026-07-05T08:05:43.894996Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:05:43.894996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.05664","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-07-05T08:05:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IS4OgK4WVfI75j8qoG9fC4mYLfGKfkBWWzOYMwYLJijlPZCrz+ZWJI5TYGgdmNZUlzEd1XbN7UUSFNPxhooLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:44:10.385561Z"},"content_sha256":"3538f2053012aa984ae1ea2540b106b7ac2e2547c9c6108c42c3df7b95d3eda9","schema_version":"1.0","event_id":"sha256:3538f2053012aa984ae1ea2540b106b7ac2e2547c9c6108c42c3df7b95d3eda9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OVUAPTHUPADKFK67WMSLPK6JB3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BFS versus DFS for random targets in ordered trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.PR"],"primary_cat":"cs.DS","authors_text":"Martin Minchev, Stoyan Dimitrov, Yan Zhuang","submitted_at":"2024-04-08T16:48:20Z","abstract_excerpt":"Consider a search from the root of an ordered tree with $n$ edges to some target node at a fixed distance $\\ell$ from that root. We compare the average time complexity of the breadth-first search (BFS) and depth-first search (DFS) algorithms, when the target node is selected uniformly at random among all nodes at level $\\ell$ in the ordered trees with $n$ edges. Intuition suggests that BFS should have better average performance when $\\ell$ is small, while DFS must have an advantage when $\\ell$ is large. But where exactly is the threshold, as a function of $n$, and is it unique? We obtain expli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05664","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.05664/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:05:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3Pirj0OpzJ5egMHTQmEZbK4qdIJrSFuQECHI2iFjbIIRoUyBt1bDogWJaBBhVdC79t4gc6he5yt4YjsQnq3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:44:10.385965Z"},"content_sha256":"63b69e4778a5a56c0ea193ec8e22c77f35ebe14c6de0a1bc2562ba0e02e9d761","schema_version":"1.0","event_id":"sha256:63b69e4778a5a56c0ea193ec8e22c77f35ebe14c6de0a1bc2562ba0e02e9d761"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVUAPTHUPADKFK67WMSLPK6JB3/bundle.json","state_url":"https://pith.science/pith/OVUAPTHUPADKFK67WMSLPK6JB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVUAPTHUPADKFK67WMSLPK6JB3/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-07-06T14:44:10Z","links":{"resolver":"https://pith.science/pith/OVUAPTHUPADKFK67WMSLPK6JB3","bundle":"https://pith.science/pith/OVUAPTHUPADKFK67WMSLPK6JB3/bundle.json","state":"https://pith.science/pith/OVUAPTHUPADKFK67WMSLPK6JB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVUAPTHUPADKFK67WMSLPK6JB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OVUAPTHUPADKFK67WMSLPK6JB3","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":"75ffbee5e948aa6134ad7d089a61f63c493d1df74a4cfd8c664ee0d41bd71789","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-08T16:48:20Z","title_canon_sha256":"71403b394a588db50fd41d8964634e7c7b35e59663e3eb46c6a76c5acbc403a9"},"schema_version":"1.0","source":{"id":"2404.05664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05664","created_at":"2026-07-05T08:05:43Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05664v1","created_at":"2026-07-05T08:05:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05664","created_at":"2026-07-05T08:05:43Z"},{"alias_kind":"pith_short_12","alias_value":"OVUAPTHUPADK","created_at":"2026-07-05T08:05:43Z"},{"alias_kind":"pith_short_16","alias_value":"OVUAPTHUPADKFK67","created_at":"2026-07-05T08:05:43Z"},{"alias_kind":"pith_short_8","alias_value":"OVUAPTHU","created_at":"2026-07-05T08:05:43Z"}],"graph_snapshots":[{"event_id":"sha256:63b69e4778a5a56c0ea193ec8e22c77f35ebe14c6de0a1bc2562ba0e02e9d761","target":"graph","created_at":"2026-07-05T08:05: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.05664/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider a search from the root of an ordered tree with $n$ edges to some target node at a fixed distance $\\ell$ from that root. We compare the average time complexity of the breadth-first search (BFS) and depth-first search (DFS) algorithms, when the target node is selected uniformly at random among all nodes at level $\\ell$ in the ordered trees with $n$ edges. Intuition suggests that BFS should have better average performance when $\\ell$ is small, while DFS must have an advantage when $\\ell$ is large. But where exactly is the threshold, as a function of $n$, and is it unique? We obtain expli","authors_text":"Martin Minchev, Stoyan Dimitrov, Yan Zhuang","cross_cats":["cs.DM","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-08T16:48:20Z","title":"BFS versus DFS for random targets in ordered trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05664","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:3538f2053012aa984ae1ea2540b106b7ac2e2547c9c6108c42c3df7b95d3eda9","target":"record","created_at":"2026-07-05T08:05: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":"75ffbee5e948aa6134ad7d089a61f63c493d1df74a4cfd8c664ee0d41bd71789","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-08T16:48:20Z","title_canon_sha256":"71403b394a588db50fd41d8964634e7c7b35e59663e3eb46c6a76c5acbc403a9"},"schema_version":"1.0","source":{"id":"2404.05664","kind":"arxiv","version":1}},"canonical_sha256":"756807ccf47806a2abdfb324b7abc90ed96f118e7557a2336f9313ade72f0905","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"756807ccf47806a2abdfb324b7abc90ed96f118e7557a2336f9313ade72f0905","first_computed_at":"2026-07-05T08:05:43.894996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:05:43.894996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rFa48/o+23pkLy9ULlZDwDJA/Y5DXwteBYlD9KWk11cjCvDMjJIbSgZx2Sl61MpKhy9soNwScpVOVO9jnOH6Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:05:43.895411Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.05664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3538f2053012aa984ae1ea2540b106b7ac2e2547c9c6108c42c3df7b95d3eda9","sha256:63b69e4778a5a56c0ea193ec8e22c77f35ebe14c6de0a1bc2562ba0e02e9d761"],"state_sha256":"e9806f71a3e423b46b31da1463628aefc051290309544424932a09eb584ff771"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGgmwMxfIPWgs1yWHugssEpVUB5el86kHbWple44ghkCs690FnE2VYWbHLJfi8zu9PZzBoHM6vwuB3Ik0JguCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T14:44:10.387917Z","bundle_sha256":"4aa9aba7bc5de9c055bb44fb3f16110d47c4ab926497f384131113eaef55c022"}}