{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7NJHIGR7AKFE6Y4OJO2MCD4V6J","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":"d1a89ba8fb880c43240a198d41db9e296a454e3d3fbe637709209ac1148b4f33","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-28T03:39:30Z","title_canon_sha256":"03df9da5e086f9e679070379c89d76ba3707e2b7ba265aeb334d6117db6adee8"},"schema_version":"1.0","source":{"id":"2507.20500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20500","created_at":"2026-07-05T11:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20500v1","created_at":"2026-07-05T11:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20500","created_at":"2026-07-05T11:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"7NJHIGR7AKFE","created_at":"2026-07-05T11:44:20Z"},{"alias_kind":"pith_short_16","alias_value":"7NJHIGR7AKFE6Y4O","created_at":"2026-07-05T11:44:20Z"},{"alias_kind":"pith_short_8","alias_value":"7NJHIGR7","created_at":"2026-07-05T11:44:20Z"}],"graph_snapshots":[{"event_id":"sha256:70ebec4977288919bc94f410d5963fa89200c236f3558f284e30defda800b7f2","target":"graph","created_at":"2026-07-05T11:44:20Z","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/2507.20500/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alp M\\\"uyesser, Ant\\'onio Gir\\~ao, Eoin Hurley, Lukas Michel, Micha Christoph, Nemanja Dragani\\'c","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-28T03:39:30Z","title":"New bounds for linear arboricity and related problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20500","kind":"arxiv","version":1},"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:9bf7b42a67001227e5c3c10529dbe67a6e61772c4721a2e0284169f73e032df2","target":"record","created_at":"2026-07-05T11:44:20Z","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":"d1a89ba8fb880c43240a198d41db9e296a454e3d3fbe637709209ac1148b4f33","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-28T03:39:30Z","title_canon_sha256":"03df9da5e086f9e679070379c89d76ba3707e2b7ba265aeb334d6117db6adee8"},"schema_version":"1.0","source":{"id":"2507.20500","kind":"arxiv","version":1}},"canonical_sha256":"fb52741a3f028a4f638e4bb4c10f95f254b6a6ed84d3f30cd4f6cb6225b7b632","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb52741a3f028a4f638e4bb4c10f95f254b6a6ed84d3f30cd4f6cb6225b7b632","first_computed_at":"2026-07-05T11:44:20.303939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:20.303939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cDG6rjhaws2+NIPPB158ONc2/2aEgkNGav+9fkqoyRFJzesZhyz3dGAyaVzVPSihXu8sGrorBC6nj8KpsDbnCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:20.304418Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.20500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bf7b42a67001227e5c3c10529dbe67a6e61772c4721a2e0284169f73e032df2","sha256:70ebec4977288919bc94f410d5963fa89200c236f3558f284e30defda800b7f2"],"state_sha256":"413078b66e10cd3ac0a26701121a4e4af755c9f8bd6b972eefa0524983b572dc"}