{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WRQED4BVZL4ZY6LW4P2VVGTZ7Z","short_pith_number":"pith:WRQED4BV","schema_version":"1.0","canonical_sha256":"b46041f035caf99c7976e3f55a9a79fe613847abd3d9d9c01add81cfcbf6a068","source":{"kind":"arxiv","id":"1505.00734","version":2},"attestation_state":"computed","paper":{"title":"Finding paths in sparse random graphs requires many queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Michael Krivelevich, Pedro Vieira","submitted_at":"2015-05-04T18:02:51Z","abstract_excerpt":"We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph $G\\sim {\\mathcal G}(n,p)$ in order to find a subgraph which possesses some target property with high probability. In this paper we focus on finding long paths in $G\\sim \\mathcal G(n,p)$ when $p=\\frac{1+\\varepsilon}{n}$ for some fixed constant $\\varepsilon>0$. This random graph is known to have typically linearly long paths.\n  To have $\\ell$ edges with high probability in $G\\sim \\mathcal G(n,p)$ one clearly needs to query"},"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":"1505.00734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-04T18:02:51Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e0b42cd2e160c41d6b12fad76f558ff0c57034f3e783ded327fb04f35b6a30dd","abstract_canon_sha256":"0e5b49c5641447add82ece2773159ba29f224c90a714f74b6f21689e069d588d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:55.338469Z","signature_b64":"Qc92q+FDzSfdbMeZO1ACu+bus24mYU4+JsNLu4tOTzDu/C/9KXkjCRoNRIMpyKQbnIWvgefGGkb53NWvZkmhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b46041f035caf99c7976e3f55a9a79fe613847abd3d9d9c01add81cfcbf6a068","last_reissued_at":"2026-05-18T01:09:55.336309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:55.336309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding paths in sparse random graphs requires many queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Michael Krivelevich, Pedro Vieira","submitted_at":"2015-05-04T18:02:51Z","abstract_excerpt":"We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph $G\\sim {\\mathcal G}(n,p)$ in order to find a subgraph which possesses some target property with high probability. In this paper we focus on finding long paths in $G\\sim \\mathcal G(n,p)$ when $p=\\frac{1+\\varepsilon}{n}$ for some fixed constant $\\varepsilon>0$. This random graph is known to have typically linearly long paths.\n  To have $\\ell$ edges with high probability in $G\\sim \\mathcal G(n,p)$ one clearly needs to query"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00734","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.00734","created_at":"2026-05-18T01:09:55.337729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00734v2","created_at":"2026-05-18T01:09:55.337729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00734","created_at":"2026-05-18T01:09:55.337729+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRQED4BVZL4Z","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRQED4BVZL4ZY6LW","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRQED4BV","created_at":"2026-05-18T12:29:47.479230+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/WRQED4BVZL4ZY6LW4P2VVGTZ7Z","json":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z.json","graph_json":"https://pith.science/api/pith-number/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/graph.json","events_json":"https://pith.science/api/pith-number/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/events.json","paper":"https://pith.science/paper/WRQED4BV"},"agent_actions":{"view_html":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z","download_json":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z.json","view_paper":"https://pith.science/paper/WRQED4BV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00734&json=true","fetch_graph":"https://pith.science/api/pith-number/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/action/storage_attestation","attest_author":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/action/author_attestation","sign_citation":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/action/citation_signature","submit_replication":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/action/replication_record"}},"created_at":"2026-05-18T01:09:55.337729+00:00","updated_at":"2026-05-18T01:09:55.337729+00:00"}