{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DIIPAXPKDSNQI24THQP2DDR2T2","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":"ff41050bab2e2977c97c5f2c9326c125a2362da439fbae0f56e2a4028b8b17ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-11T17:39:56Z","title_canon_sha256":"68a3c2304a43dfcae6bf2215a8c0f61d037dff779d99e25716a201d1852be1af"},"schema_version":"1.0","source":{"id":"1911.04413","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.04413","created_at":"2026-07-05T02:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1911.04413v2","created_at":"2026-07-05T02:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.04413","created_at":"2026-07-05T02:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"DIIPAXPKDSNQ","created_at":"2026-07-05T02:09:35Z"},{"alias_kind":"pith_short_16","alias_value":"DIIPAXPKDSNQI24T","created_at":"2026-07-05T02:09:35Z"},{"alias_kind":"pith_short_8","alias_value":"DIIPAXPK","created_at":"2026-07-05T02:09:35Z"}],"graph_snapshots":[{"event_id":"sha256:9f8e5a0eae1cbb914ce17355937c6b3212d29db4bcda9e2ec61a503305c09414","target":"graph","created_at":"2026-07-05T02:09:35Z","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/1911.04413/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a fixed graph $H$, a real number $p\\in(0,1)$, and an infinite Erd\\H{o}s-R\\'enyi graph $G\\sim G(\\infty,p)$, how many adjacency queries do we have to make to find a copy of $H$ inside $G$ with probability $1/2$? Determining this number $f(H,p)$ is a variant of the {\\it subgraph query problem} introduced by Ferber, Krivelevich, Sudakov, and Vieira. For every graph $H$, we improve the trivial upper bound of $f(H,p) = O(p^{-d})$, where $d$ is the degeneracy of $H$, by exhibiting an algorithm that finds a copy of $H$ in time $o(p^{-d})$ as $p$ goes to $0$. Furthermore, we prove that there are ","authors_text":"Alexander Moreira, Chady Ben Hamida, Ryan Alweiss, Xiaoyu He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-11T17:39:56Z","title":"On the subgraph query problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.04413","kind":"arxiv","version":2},"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:01197cc4117d9313e7b8f0b3c5129a6573419f56ecf98e1bb89589a86bae9f09","target":"record","created_at":"2026-07-05T02:09:35Z","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":"ff41050bab2e2977c97c5f2c9326c125a2362da439fbae0f56e2a4028b8b17ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-11T17:39:56Z","title_canon_sha256":"68a3c2304a43dfcae6bf2215a8c0f61d037dff779d99e25716a201d1852be1af"},"schema_version":"1.0","source":{"id":"1911.04413","kind":"arxiv","version":2}},"canonical_sha256":"1a10f05dea1c9b046b933c1fa18e3a9e976b4a4ade0360fd140af0ff6b39854e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a10f05dea1c9b046b933c1fa18e3a9e976b4a4ade0360fd140af0ff6b39854e","first_computed_at":"2026-07-05T02:09:35.779179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:09:35.779179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xtKUuOxTC51jS2ENDai0F/yL1Ob0NWU7d9maCYJD29E4gtc8vEn/Mq+9E5D4u1eQyQjfDYziNY4cr/4CJCmcAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:09:35.779536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.04413","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01197cc4117d9313e7b8f0b3c5129a6573419f56ecf98e1bb89589a86bae9f09","sha256:9f8e5a0eae1cbb914ce17355937c6b3212d29db4bcda9e2ec61a503305c09414"],"state_sha256":"6e45025d53f2108423b4d4d6333c402292ac707024aca635d13a85d2fa6f48e0"}