{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PFKQPUAYRGVYYM5RIHF5SFUWEQ","short_pith_number":"pith:PFKQPUAY","schema_version":"1.0","canonical_sha256":"795507d01889ab8c33b141cbd91696242f6b70f369f093e94b537f7d5ae603d5","source":{"kind":"arxiv","id":"2402.01447","version":1},"attestation_state":"computed","paper":{"title":"The Hamilton space of pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kalina Petrova, Micha Christoph, Rajko Nenadov","submitted_at":"2024-02-02T14:38:22Z","abstract_excerpt":"We show that if $n$ is odd and $p \\ge C \\log n / n$, then with high probability Hamilton cycles in $G(n,p)$ span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties. The proof is based on a novel idea of parity-switchers, which can be thought of as analogues of absorbers in the context of cycle spaces. As another application of our method, we show that Hamilton cycles in a near-Dirac graph $G$, that is, a graph $G$ with odd $n$ vertices and minimum degree $n/2 + C$ for sufficiently large constant $C$, span its cycle space"},"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":"2402.01447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-02T14:38:22Z","cross_cats_sorted":[],"title_canon_sha256":"bf8a7e4b931c316ff1698271faa8197707d41998d3bc9f323f995ce117a6cff6","abstract_canon_sha256":"d07e149a7868c7ebfaeaf0b01062a2ca661bd85fc6df68f01d15a9ee8f275116"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:44.393305Z","signature_b64":"infCClqnutTFw9M0rVzGbN0eGrbWeqbXwmVh9doBGnTHuic1jyjyzJ6HmsyuakWTKdM8WdzjVLbi8nd9d6n5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"795507d01889ab8c33b141cbd91696242f6b70f369f093e94b537f7d5ae603d5","last_reissued_at":"2026-07-05T07:40:44.392702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:44.392702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hamilton space of pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kalina Petrova, Micha Christoph, Rajko Nenadov","submitted_at":"2024-02-02T14:38:22Z","abstract_excerpt":"We show that if $n$ is odd and $p \\ge C \\log n / n$, then with high probability Hamilton cycles in $G(n,p)$ span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties. The proof is based on a novel idea of parity-switchers, which can be thought of as analogues of absorbers in the context of cycle spaces. As another application of our method, we show that Hamilton cycles in a near-Dirac graph $G$, that is, a graph $G$ with odd $n$ vertices and minimum degree $n/2 + C$ for sufficiently large constant $C$, span its cycle space"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.01447","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/2402.01447/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":"2402.01447","created_at":"2026-07-05T07:40:44.392772+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.01447v1","created_at":"2026-07-05T07:40:44.392772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.01447","created_at":"2026-07-05T07:40:44.392772+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFKQPUAYRGVY","created_at":"2026-07-05T07:40:44.392772+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFKQPUAYRGVYYM5R","created_at":"2026-07-05T07:40:44.392772+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFKQPUAY","created_at":"2026-07-05T07:40:44.392772+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04488","citing_title":"The Hamilton cycle space of random regular graphs and randomly perturbed graphs","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PFKQPUAYRGVYYM5RIHF5SFUWEQ","json":"https://pith.science/pith/PFKQPUAYRGVYYM5RIHF5SFUWEQ.json","graph_json":"https://pith.science/api/pith-number/PFKQPUAYRGVYYM5RIHF5SFUWEQ/graph.json","events_json":"https://pith.science/api/pith-number/PFKQPUAYRGVYYM5RIHF5SFUWEQ/events.json","paper":"https://pith.science/paper/PFKQPUAY"},"agent_actions":{"view_html":"https://pith.science/pith/PFKQPUAYRGVYYM5RIHF5SFUWEQ","download_json":"https://pith.science/pith/PFKQPUAYRGVYYM5RIHF5SFUWEQ.json","view_paper":"https://pith.science/paper/PFKQPUAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.01447&json=true","fetch_graph":"https://pith.science/api/pith-number/PFKQPUAYRGVYYM5RIHF5SFUWEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PFKQPUAYRGVYYM5RIHF5SFUWEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFKQPUAYRGVYYM5RIHF5SFUWEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFKQPUAYRGVYYM5RIHF5SFUWEQ/action/storage_attestation","attest_author":"https://pith.science/pith/PFKQPUAYRGVYYM5RIHF5SFUWEQ/action/author_attestation","sign_citation":"https://pith.science/pith/PFKQPUAYRGVYYM5RIHF5SFUWEQ/action/citation_signature","submit_replication":"https://pith.science/pith/PFKQPUAYRGVYYM5RIHF5SFUWEQ/action/replication_record"}},"created_at":"2026-07-05T07:40:44.392772+00:00","updated_at":"2026-07-05T07:40:44.392772+00:00"}