{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7NJHIGR7AKFE6Y4OJO2MCD4V6J","short_pith_number":"pith:7NJHIGR7","schema_version":"1.0","canonical_sha256":"fb52741a3f028a4f638e4bb4c10f95f254b6a6ed84d3f30cd4f6cb6225b7b632","source":{"kind":"arxiv","id":"2507.20500","version":1},"attestation_state":"computed","paper":{"title":"New bounds for linear arboricity and related problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Ant\\'onio Gir\\~ao, Eoin Hurley, Lukas Michel, Micha Christoph, Nemanja Dragani\\'c","submitted_at":"2025-07-28T03:39:30Z","abstract_excerpt":"A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\\Delta$ can be decomposed into at most $\\lceil(\\Delta+1)/2\\rceil$ linear forests. We prove that $\\Delta/2 + \\mathcal{O}(\\log n)$ linear forests suffice, where $n$ is the number of vertices of the graph. If $\\Delta = \\Omega(n^\\varepsilon)$, this is an exponential improvement over the previous best error term. We achieve this by generalising P\\'osa rotations from rotations of one endpoint of a path to simultaneous rotations of multiple endpoints of a linear forest"},"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":"2507.20500","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-28T03:39:30Z","cross_cats_sorted":[],"title_canon_sha256":"03df9da5e086f9e679070379c89d76ba3707e2b7ba265aeb334d6117db6adee8","abstract_canon_sha256":"d1a89ba8fb880c43240a198d41db9e296a454e3d3fbe637709209ac1148b4f33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:20.304418Z","signature_b64":"cDG6rjhaws2+NIPPB158ONc2/2aEgkNGav+9fkqoyRFJzesZhyz3dGAyaVzVPSihXu8sGrorBC6nj8KpsDbnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb52741a3f028a4f638e4bb4c10f95f254b6a6ed84d3f30cd4f6cb6225b7b632","last_reissued_at":"2026-07-05T11:44:20.303939Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:20.303939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds for linear arboricity and related problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Ant\\'onio Gir\\~ao, Eoin Hurley, Lukas Michel, Micha Christoph, Nemanja Dragani\\'c","submitted_at":"2025-07-28T03:39:30Z","abstract_excerpt":"A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\\Delta$ can be decomposed into at most $\\lceil(\\Delta+1)/2\\rceil$ linear forests. We prove that $\\Delta/2 + \\mathcal{O}(\\log n)$ linear forests suffice, where $n$ is the number of vertices of the graph. If $\\Delta = \\Omega(n^\\varepsilon)$, this is an exponential improvement over the previous best error term. We achieve this by generalising P\\'osa rotations from rotations of one endpoint of a path to simultaneous rotations of multiple endpoints of a linear forest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20500","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/2507.20500/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":"2507.20500","created_at":"2026-07-05T11:44:20.303995+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.20500v1","created_at":"2026-07-05T11:44:20.303995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20500","created_at":"2026-07-05T11:44:20.303995+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NJHIGR7AKFE","created_at":"2026-07-05T11:44:20.303995+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NJHIGR7AKFE6Y4O","created_at":"2026-07-05T11:44:20.303995+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NJHIGR7","created_at":"2026-07-05T11:44:20.303995+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07471","citing_title":"Dirac subgraphs of powers of cycles are Hamiltonian","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2603.08675","citing_title":"The Lov\\'asz conjecture holds for moderately dense Cayley graphs","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7NJHIGR7AKFE6Y4OJO2MCD4V6J","json":"https://pith.science/pith/7NJHIGR7AKFE6Y4OJO2MCD4V6J.json","graph_json":"https://pith.science/api/pith-number/7NJHIGR7AKFE6Y4OJO2MCD4V6J/graph.json","events_json":"https://pith.science/api/pith-number/7NJHIGR7AKFE6Y4OJO2MCD4V6J/events.json","paper":"https://pith.science/paper/7NJHIGR7"},"agent_actions":{"view_html":"https://pith.science/pith/7NJHIGR7AKFE6Y4OJO2MCD4V6J","download_json":"https://pith.science/pith/7NJHIGR7AKFE6Y4OJO2MCD4V6J.json","view_paper":"https://pith.science/paper/7NJHIGR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.20500&json=true","fetch_graph":"https://pith.science/api/pith-number/7NJHIGR7AKFE6Y4OJO2MCD4V6J/graph.json","fetch_events":"https://pith.science/api/pith-number/7NJHIGR7AKFE6Y4OJO2MCD4V6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NJHIGR7AKFE6Y4OJO2MCD4V6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NJHIGR7AKFE6Y4OJO2MCD4V6J/action/storage_attestation","attest_author":"https://pith.science/pith/7NJHIGR7AKFE6Y4OJO2MCD4V6J/action/author_attestation","sign_citation":"https://pith.science/pith/7NJHIGR7AKFE6Y4OJO2MCD4V6J/action/citation_signature","submit_replication":"https://pith.science/pith/7NJHIGR7AKFE6Y4OJO2MCD4V6J/action/replication_record"}},"created_at":"2026-07-05T11:44:20.303995+00:00","updated_at":"2026-07-05T11:44:20.303995+00:00"}