{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:M6G5CZNBLJ4OFKIMQBN34B7SP4","short_pith_number":"pith:M6G5CZNB","schema_version":"1.0","canonical_sha256":"678dd165a15a78e2a90c805bbe07f27f0dfa68abd3d25dc29d0453bc9652084c","source":{"kind":"arxiv","id":"2305.08442","version":1},"attestation_state":"computed","paper":{"title":"Crowns in pseudo-random graphs and Hamilton cycles in their squares","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich","submitted_at":"2023-05-15T08:40:16Z","abstract_excerpt":"A crown with $k$ spikes is an edge-disjoint union of a cycle $C$ and a matching $M$ of size $k$ such that each edge of $M$ has exactly one vertex in common with $C$. We prove that if $G$ is an $(n,d,\\lambda)$-graph with $\\lambda/d\\le 0.001$ and $d$ is large enough, then $G$ contains a crown on $n$ vertices with $\\lfloor n/2\\rfloor$ spikes. As a consequence, such $G$ contains a Hamilton cycle in its square $G^2$."},"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":"2305.08442","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-15T08:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"60def816fa5bb6bb25b4fbe86ea3774827b0d9f221ae7cbd5d37a463e17d4431","abstract_canon_sha256":"975f4366f680ab123d592e47250189099e307cb55e0372e6b122d7b61a24d461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:10:01.653053Z","signature_b64":"ZGInjpMTw/0bko6TlbiGzfo+gbLHeR4es00O9CmWVWA1HXBuu7BmPI14pLdomlqy/4hnZybIKqWO3A6LEe4iAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"678dd165a15a78e2a90c805bbe07f27f0dfa68abd3d25dc29d0453bc9652084c","last_reissued_at":"2026-07-05T06:10:01.652476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:10:01.652476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crowns in pseudo-random graphs and Hamilton cycles in their squares","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich","submitted_at":"2023-05-15T08:40:16Z","abstract_excerpt":"A crown with $k$ spikes is an edge-disjoint union of a cycle $C$ and a matching $M$ of size $k$ such that each edge of $M$ has exactly one vertex in common with $C$. We prove that if $G$ is an $(n,d,\\lambda)$-graph with $\\lambda/d\\le 0.001$ and $d$ is large enough, then $G$ contains a crown on $n$ vertices with $\\lfloor n/2\\rfloor$ spikes. As a consequence, such $G$ contains a Hamilton cycle in its square $G^2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.08442","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/2305.08442/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.08442","created_at":"2026-07-05T06:10:01.652544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.08442v1","created_at":"2026-07-05T06:10:01.652544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08442","created_at":"2026-07-05T06:10:01.652544+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6G5CZNBLJ4O","created_at":"2026-07-05T06:10:01.652544+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6G5CZNBLJ4OFKIM","created_at":"2026-07-05T06:10:01.652544+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6G5CZNB","created_at":"2026-07-05T06:10:01.652544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19756","citing_title":"Tree tilings in random regular graphs","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M6G5CZNBLJ4OFKIMQBN34B7SP4","json":"https://pith.science/pith/M6G5CZNBLJ4OFKIMQBN34B7SP4.json","graph_json":"https://pith.science/api/pith-number/M6G5CZNBLJ4OFKIMQBN34B7SP4/graph.json","events_json":"https://pith.science/api/pith-number/M6G5CZNBLJ4OFKIMQBN34B7SP4/events.json","paper":"https://pith.science/paper/M6G5CZNB"},"agent_actions":{"view_html":"https://pith.science/pith/M6G5CZNBLJ4OFKIMQBN34B7SP4","download_json":"https://pith.science/pith/M6G5CZNBLJ4OFKIMQBN34B7SP4.json","view_paper":"https://pith.science/paper/M6G5CZNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.08442&json=true","fetch_graph":"https://pith.science/api/pith-number/M6G5CZNBLJ4OFKIMQBN34B7SP4/graph.json","fetch_events":"https://pith.science/api/pith-number/M6G5CZNBLJ4OFKIMQBN34B7SP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6G5CZNBLJ4OFKIMQBN34B7SP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6G5CZNBLJ4OFKIMQBN34B7SP4/action/storage_attestation","attest_author":"https://pith.science/pith/M6G5CZNBLJ4OFKIMQBN34B7SP4/action/author_attestation","sign_citation":"https://pith.science/pith/M6G5CZNBLJ4OFKIMQBN34B7SP4/action/citation_signature","submit_replication":"https://pith.science/pith/M6G5CZNBLJ4OFKIMQBN34B7SP4/action/replication_record"}},"created_at":"2026-07-05T06:10:01.652544+00:00","updated_at":"2026-07-05T06:10:01.652544+00:00"}