{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DX27ZUDC3AD7TV2CM6USD7N2IQ","short_pith_number":"pith:DX27ZUDC","schema_version":"1.0","canonical_sha256":"1df5fcd062d807f9d74267a921fdba443ae961a93d283eb0173883c6617c9ae3","source":{"kind":"arxiv","id":"1505.00730","version":2},"attestation_state":"computed","paper":{"title":"Finding Hamilton cycles in random graphs with few 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-04T17:54:52Z","abstract_excerpt":"We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of ${\\mathcal G}(n,p)$ in order to typically find a subgraph possessing a given target property. We show that if $p\\geq \\frac{\\ln n+\\ln\\ln n+\\omega(1)}{n}$, then one can find a Hamilton cycle with high probability after exposing $(1+o(1))n$ edges. Our result is tight in both $p$ and the number of exposed edges."},"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.00730","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-04T17:54:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4a2d5ac2ae938f8c8e66f40c913c43064ded390d0151d4ea6b2f3986532475ba","abstract_canon_sha256":"8ee5145da05454cf9543269d3080ad16778d5f3dfd88c654409586f341c62749"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:55.347460Z","signature_b64":"bUF0Lpoe+pWILvdDmQOc+Q4HlZ+4J54bDzj3QHzb44YOb3S/H4U/fDBzt5xR4ERpKJ9obYR+VL7EeeAfMkm5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df5fcd062d807f9d74267a921fdba443ae961a93d283eb0173883c6617c9ae3","last_reissued_at":"2026-05-18T01:09:55.346741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:55.346741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Hamilton cycles in random graphs with few 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-04T17:54:52Z","abstract_excerpt":"We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of ${\\mathcal G}(n,p)$ in order to typically find a subgraph possessing a given target property. We show that if $p\\geq \\frac{\\ln n+\\ln\\ln n+\\omega(1)}{n}$, then one can find a Hamilton cycle with high probability after exposing $(1+o(1))n$ edges. Our result is tight in both $p$ and the number of exposed edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00730","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.00730","created_at":"2026-05-18T01:09:55.346841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00730v2","created_at":"2026-05-18T01:09:55.346841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00730","created_at":"2026-05-18T01:09:55.346841+00:00"},{"alias_kind":"pith_short_12","alias_value":"DX27ZUDC3AD7","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DX27ZUDC3AD7TV2C","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DX27ZUDC","created_at":"2026-05-18T12:29:17.054201+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/DX27ZUDC3AD7TV2CM6USD7N2IQ","json":"https://pith.science/pith/DX27ZUDC3AD7TV2CM6USD7N2IQ.json","graph_json":"https://pith.science/api/pith-number/DX27ZUDC3AD7TV2CM6USD7N2IQ/graph.json","events_json":"https://pith.science/api/pith-number/DX27ZUDC3AD7TV2CM6USD7N2IQ/events.json","paper":"https://pith.science/paper/DX27ZUDC"},"agent_actions":{"view_html":"https://pith.science/pith/DX27ZUDC3AD7TV2CM6USD7N2IQ","download_json":"https://pith.science/pith/DX27ZUDC3AD7TV2CM6USD7N2IQ.json","view_paper":"https://pith.science/paper/DX27ZUDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00730&json=true","fetch_graph":"https://pith.science/api/pith-number/DX27ZUDC3AD7TV2CM6USD7N2IQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DX27ZUDC3AD7TV2CM6USD7N2IQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DX27ZUDC3AD7TV2CM6USD7N2IQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DX27ZUDC3AD7TV2CM6USD7N2IQ/action/storage_attestation","attest_author":"https://pith.science/pith/DX27ZUDC3AD7TV2CM6USD7N2IQ/action/author_attestation","sign_citation":"https://pith.science/pith/DX27ZUDC3AD7TV2CM6USD7N2IQ/action/citation_signature","submit_replication":"https://pith.science/pith/DX27ZUDC3AD7TV2CM6USD7N2IQ/action/replication_record"}},"created_at":"2026-05-18T01:09:55.346841+00:00","updated_at":"2026-05-18T01:09:55.346841+00:00"}