{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CL6J2TJK4QGV3GE4GNJMZP7RK6","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":"64e8fff5914de7407f5d50dbfea3a4a120567b9082670e366359ba2f49c7c497","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-13T21:01:48Z","title_canon_sha256":"6279158a5a4a0b5a029d690f36f2109dc6700d67a9fde2b3bb36083d2d6a79ba"},"schema_version":"1.0","source":{"id":"1712.05006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05006","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05006v1","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05006","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"pith_short_12","alias_value":"CL6J2TJK4QGV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CL6J2TJK4QGV3GE4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CL6J2TJK","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:7cbf7a7eb63275681db84d3d104ccc856bc0744a3a0d690fc0ea5103861f9a4e","target":"graph","created_at":"2026-05-18T00:28:01Z","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"},"paper":{"abstract_excerpt":"A linear forest is a forest in which every connected component is a path. The linear arboricity of a graph $G$ is the minimum number of linear forests of $G$ covering all edges. In 1980, Akiyama, Exoo and Harary proposed a conjecture, known as the Linear Arboricity Conjecture (LAC), stating that every $d$-regular graph $G$ has linear arboricity $\\lceil \\frac{d+1}{2} \\rceil$. In 1988, Alon proved that the LAC holds asymptotically. In 1999, the list version of the LAC was raised by An and Wu, which is called the List Linear Arboricity Conjecture. In this article, we prove that the List Linear Ar","authors_text":"Luke Postle, Ringi Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-13T21:01:48Z","title":"The List Linear Arboricity of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05006","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:c527953d64c2cddbf34d088ff6bced91f1d7737997c56122934033eb6a1abdb0","target":"record","created_at":"2026-05-18T00:28:01Z","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":"64e8fff5914de7407f5d50dbfea3a4a120567b9082670e366359ba2f49c7c497","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-13T21:01:48Z","title_canon_sha256":"6279158a5a4a0b5a029d690f36f2109dc6700d67a9fde2b3bb36083d2d6a79ba"},"schema_version":"1.0","source":{"id":"1712.05006","kind":"arxiv","version":1}},"canonical_sha256":"12fc9d4d2ae40d5d989c3352ccbff157aefc0dcb4c321da566f589d3d7cd9681","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12fc9d4d2ae40d5d989c3352ccbff157aefc0dcb4c321da566f589d3d7cd9681","first_computed_at":"2026-05-18T00:28:01.263868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:01.263868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DjtPVjg8sQo9dZn7kwQclEhkki4dSzJbgxaF4fLPCD6SSp7jjlJ4ofkCC4xnAAkwFJ81xZQ3mEgyDXZowXmlDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:01.264576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c527953d64c2cddbf34d088ff6bced91f1d7737997c56122934033eb6a1abdb0","sha256:7cbf7a7eb63275681db84d3d104ccc856bc0744a3a0d690fc0ea5103861f9a4e"],"state_sha256":"31f36d372db05dedd1a0d3d166c9fbc5af2137874596f987f80887f103565300"}