{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HRRYZ3N4JQ7CMLNJPYOJ6UH7DX","short_pith_number":"pith:HRRYZ3N4","schema_version":"1.0","canonical_sha256":"3c638cedbc4c3e262da97e1c9f50ff1dff469e502b802eea5d2f00e68693d946","source":{"kind":"arxiv","id":"2503.15950","version":1},"attestation_state":"computed","paper":{"title":"Dirac-type condition for Hamilton-generated graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xinmin Hou, Zhi Yin","submitted_at":"2025-03-20T08:46:45Z","abstract_excerpt":"The cycle space $\\mathcal{C}(G)$ of a graph $G$ is defined as the linear space spanned by all cycles in $G$. For an integer $k\\ge 3$, let $\\mathcal{C}_k (G)$ denote the subspace of $\\mathcal{C}(G)$ generated by the cycles of length exactly $k$. A graph $G$ on $n$ vertices is called Hamilton-generated if $\\mathcal{C}_n (G) = \\mathcal{C}(G)$, meaning every cycle in $G$ is a symmetric difference of some Hamilton cycles of $G$. %A necessary condition for this property is that $n$ must be odd. Heinig (European J. Combin., 2014) showed that for any $\\sigma >0$ and sufficiently large odd $n$, every $"},"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":"2503.15950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-20T08:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"94d60e0808c3a00078f762f0ba779cbd961ad15b50c1df4dcbdd46b499867682","abstract_canon_sha256":"956e2e35c7ff6e8dbe80fa65c05034c481c41f34df08ca4c685a725814637f88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:36:02.741313Z","signature_b64":"MWXAoF33motxoEdHhY35hhUfx9o2h4GroFnKViFtgwXu2B2u9gfaR2ilyDHH7ZNA2NngTjaYUQqF+wKq8CbpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c638cedbc4c3e262da97e1c9f50ff1dff469e502b802eea5d2f00e68693d946","last_reissued_at":"2026-07-05T10:36:02.740604Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:36:02.740604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dirac-type condition for Hamilton-generated graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xinmin Hou, Zhi Yin","submitted_at":"2025-03-20T08:46:45Z","abstract_excerpt":"The cycle space $\\mathcal{C}(G)$ of a graph $G$ is defined as the linear space spanned by all cycles in $G$. For an integer $k\\ge 3$, let $\\mathcal{C}_k (G)$ denote the subspace of $\\mathcal{C}(G)$ generated by the cycles of length exactly $k$. A graph $G$ on $n$ vertices is called Hamilton-generated if $\\mathcal{C}_n (G) = \\mathcal{C}(G)$, meaning every cycle in $G$ is a symmetric difference of some Hamilton cycles of $G$. %A necessary condition for this property is that $n$ must be odd. Heinig (European J. Combin., 2014) showed that for any $\\sigma >0$ and sufficiently large odd $n$, every $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.15950","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/2503.15950/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":"2503.15950","created_at":"2026-07-05T10:36:02.740687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.15950v1","created_at":"2026-07-05T10:36:02.740687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.15950","created_at":"2026-07-05T10:36:02.740687+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRRYZ3N4JQ7C","created_at":"2026-07-05T10:36:02.740687+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRRYZ3N4JQ7CMLNJ","created_at":"2026-07-05T10:36:02.740687+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRRYZ3N4","created_at":"2026-07-05T10:36:02.740687+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05835","citing_title":"On graphs whose cycle space is spanned by their Hamilton cycles","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX","json":"https://pith.science/pith/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX.json","graph_json":"https://pith.science/api/pith-number/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX/graph.json","events_json":"https://pith.science/api/pith-number/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX/events.json","paper":"https://pith.science/paper/HRRYZ3N4"},"agent_actions":{"view_html":"https://pith.science/pith/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX","download_json":"https://pith.science/pith/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX.json","view_paper":"https://pith.science/paper/HRRYZ3N4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.15950&json=true","fetch_graph":"https://pith.science/api/pith-number/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX/graph.json","fetch_events":"https://pith.science/api/pith-number/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX/action/storage_attestation","attest_author":"https://pith.science/pith/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX/action/author_attestation","sign_citation":"https://pith.science/pith/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX/action/citation_signature","submit_replication":"https://pith.science/pith/HRRYZ3N4JQ7CMLNJPYOJ6UH7DX/action/replication_record"}},"created_at":"2026-07-05T10:36:02.740687+00:00","updated_at":"2026-07-05T10:36:02.740687+00:00"}