{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TLTNFEOZV523JWMK6VZGHARJ6J","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":"4a271c7b068b7de8c53f92e4a1b8f823788d807a28ba0d8220bfb41e581fb493","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-16T22:07:17Z","title_canon_sha256":"992c8b1ce5e52f274fc560adf5361f02057f924993c31a7bb665c4ae3b8bccad"},"schema_version":"1.0","source":{"id":"1902.06164","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06164","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06164v2","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06164","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"TLTNFEOZV523","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"TLTNFEOZV523JWMK","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"TLTNFEOZ","created_at":"2026-06-23T03:14:26Z"}],"graph_snapshots":[{"event_id":"sha256:645c17488d4d7b37af9bd9303f2dba6ab2a720182cec69ba9262ab8a1996036a","target":"graph","created_at":"2026-06-23T03:14:26Z","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/1902.06164/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given an $n$-vertex pseudorandom graph $G$ and an $n$-vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, i.e.\\ an embedding $\\varphi\\colon V(H)\\to V(G)$ so that $\\varphi(u)\\varphi(v)\\in E(G)$ for all $uv\\in E(H)$. Particular instances of this problem include finding a triangle-factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $(p,\\lambda)$-bijumbled graphs of minimum degree which is a constant proportion","authors_text":"Jie Han, Patrick Morris, Yoshiharu Kohayakawa, Yury Person","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-16T22:07:17Z","title":"Finding any given 2-factor in sparse pseudorandom graphs efficiently"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06164","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:b6c275c388ea419153ebdb30eb562996b9496d4902137c9721dc4630edaad696","target":"record","created_at":"2026-06-23T03:14:26Z","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":"4a271c7b068b7de8c53f92e4a1b8f823788d807a28ba0d8220bfb41e581fb493","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-16T22:07:17Z","title_canon_sha256":"992c8b1ce5e52f274fc560adf5361f02057f924993c31a7bb665c4ae3b8bccad"},"schema_version":"1.0","source":{"id":"1902.06164","kind":"arxiv","version":2}},"canonical_sha256":"9ae6d291d9af75b4d98af572638229f25413432a7ad23523ef92dfd57078a08b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ae6d291d9af75b4d98af572638229f25413432a7ad23523ef92dfd57078a08b","first_computed_at":"2026-06-23T03:14:26.554869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:14:26.554869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S4o9YaYDJq3x7HZTWkfNHc3VtzFQMLUv3HDfo8j73UsNpot+6SmPhbC6zy1ttClAdXPETFAGSfoIj7/2j4WfCw==","signature_status":"signed_v1","signed_at":"2026-06-23T03:14:26.555387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06164","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6c275c388ea419153ebdb30eb562996b9496d4902137c9721dc4630edaad696","sha256:645c17488d4d7b37af9bd9303f2dba6ab2a720182cec69ba9262ab8a1996036a"],"state_sha256":"053e22650b37826c9a52fb434fb215cac33ea3a17c6f8b4d8d7ec295e1e4172c"}