{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:SJR4HXDAGGG43WCNT4DYWFL2QL","short_pith_number":"pith:SJR4HXDA","canonical_record":{"source":{"id":"0912.5528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-30T20:15:50Z","cross_cats_sorted":[],"title_canon_sha256":"4eb55e0ddd97df49ee5a3e9af3ef3b34f97a407202c06744c1de6e650e6f9ef5","abstract_canon_sha256":"feeb38eb00bd94912aeb4a3c4177ec4a345778985152112bbcb9093ddc3b60b6"},"schema_version":"1.0"},"canonical_sha256":"9263c3dc60318dcdd84d9f078b157a82dd9004809c675b774c24cd5fc928863a","source":{"kind":"arxiv","id":"0912.5528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.5528","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"0912.5528v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.5528","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"SJR4HXDAGGG4","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SJR4HXDAGGG43WCN","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SJR4HXDA","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:SJR4HXDAGGG43WCNT4DYWFL2QL","target":"record","payload":{"canonical_record":{"source":{"id":"0912.5528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-30T20:15:50Z","cross_cats_sorted":[],"title_canon_sha256":"4eb55e0ddd97df49ee5a3e9af3ef3b34f97a407202c06744c1de6e650e6f9ef5","abstract_canon_sha256":"feeb38eb00bd94912aeb4a3c4177ec4a345778985152112bbcb9093ddc3b60b6"},"schema_version":"1.0"},"canonical_sha256":"9263c3dc60318dcdd84d9f078b157a82dd9004809c675b774c24cd5fc928863a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.159786Z","signature_b64":"mDyqyeDzZ69uZmRSHwcuNxEIBujW+AfynAqyGmRKoOq5o8i+1wf/hYJ2nX0V6KjdY6yMmZEHFMQMzLV0lbi0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9263c3dc60318dcdd84d9f078b157a82dd9004809c675b774c24cd5fc928863a","last_reissued_at":"2026-05-18T03:46:17.159094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.159094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.5528","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUVi1InLIpzPuoXo1S6hqQeIZU5jRy1ZOh/WSq0Z7mh3VDN8ZOuEwCeV01/lLtVwkmN5GlrnV8ETDebzYk7DCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:37.044657Z"},"content_sha256":"04d6a98288b8ee927717e22026d10d917fee85e36a0274f4769d89dbe311f460","schema_version":"1.0","event_id":"sha256:04d6a98288b8ee927717e22026d10d917fee85e36a0274f4769d89dbe311f460"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:SJR4HXDAGGG43WCNT4DYWFL2QL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Planar Linear Arboricity Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Borut Luzar, Lukasz Kowalik, Marek Cygan","submitted_at":"2009-12-30T20:15:50Z","abstract_excerpt":"The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. stated the Linear Arboricity Conjecture (LAC), that the linear arboricity of any simple graph of maximum degree $\\Delta$ is either $\\lceil \\tfrac{\\Delta}{2} \\rceil$ or $\\lceil \\tfrac{\\Delta+1}{2} \\rceil$. In [J. L. Wu. On the linear arboricity of planar graphs. J. Graph Theory, 31:129-134, 1999] and [J. L. Wu and Y. W. Wu. The linear arboricity of planar graphs of maximum degree seven is four. J. Graph Theory, 58(3):210-220, 2008.] it was proven that LAC holds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.5528","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVNxuH2dpPk01UP/w7E990dvwgIYHy+fKzzUEy0qUjNbGCRZnwHl5mT49E2Yp5h/MNbYmx6kn/2v446tmwYHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:37.045021Z"},"content_sha256":"d8a47a00bffd5736200906675c212ec8773130a2794dd3cd1f8f283403aa309a","schema_version":"1.0","event_id":"sha256:d8a47a00bffd5736200906675c212ec8773130a2794dd3cd1f8f283403aa309a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJR4HXDAGGG43WCNT4DYWFL2QL/bundle.json","state_url":"https://pith.science/pith/SJR4HXDAGGG43WCNT4DYWFL2QL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJR4HXDAGGG43WCNT4DYWFL2QL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T19:00:37Z","links":{"resolver":"https://pith.science/pith/SJR4HXDAGGG43WCNT4DYWFL2QL","bundle":"https://pith.science/pith/SJR4HXDAGGG43WCNT4DYWFL2QL/bundle.json","state":"https://pith.science/pith/SJR4HXDAGGG43WCNT4DYWFL2QL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJR4HXDAGGG43WCNT4DYWFL2QL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:SJR4HXDAGGG43WCNT4DYWFL2QL","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":"feeb38eb00bd94912aeb4a3c4177ec4a345778985152112bbcb9093ddc3b60b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-30T20:15:50Z","title_canon_sha256":"4eb55e0ddd97df49ee5a3e9af3ef3b34f97a407202c06744c1de6e650e6f9ef5"},"schema_version":"1.0","source":{"id":"0912.5528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.5528","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"0912.5528v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.5528","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"SJR4HXDAGGG4","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SJR4HXDAGGG43WCN","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SJR4HXDA","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:d8a47a00bffd5736200906675c212ec8773130a2794dd3cd1f8f283403aa309a","target":"graph","created_at":"2026-05-18T03:46:17Z","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":"The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. stated the Linear Arboricity Conjecture (LAC), that the linear arboricity of any simple graph of maximum degree $\\Delta$ is either $\\lceil \\tfrac{\\Delta}{2} \\rceil$ or $\\lceil \\tfrac{\\Delta+1}{2} \\rceil$. In [J. L. Wu. On the linear arboricity of planar graphs. J. Graph Theory, 31:129-134, 1999] and [J. L. Wu and Y. W. Wu. The linear arboricity of planar graphs of maximum degree seven is four. J. Graph Theory, 58(3):210-220, 2008.] it was proven that LAC holds","authors_text":"Borut Luzar, Lukasz Kowalik, Marek Cygan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-30T20:15:50Z","title":"A Planar Linear Arboricity Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.5528","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:04d6a98288b8ee927717e22026d10d917fee85e36a0274f4769d89dbe311f460","target":"record","created_at":"2026-05-18T03:46:17Z","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":"feeb38eb00bd94912aeb4a3c4177ec4a345778985152112bbcb9093ddc3b60b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-30T20:15:50Z","title_canon_sha256":"4eb55e0ddd97df49ee5a3e9af3ef3b34f97a407202c06744c1de6e650e6f9ef5"},"schema_version":"1.0","source":{"id":"0912.5528","kind":"arxiv","version":1}},"canonical_sha256":"9263c3dc60318dcdd84d9f078b157a82dd9004809c675b774c24cd5fc928863a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9263c3dc60318dcdd84d9f078b157a82dd9004809c675b774c24cd5fc928863a","first_computed_at":"2026-05-18T03:46:17.159094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:17.159094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mDyqyeDzZ69uZmRSHwcuNxEIBujW+AfynAqyGmRKoOq5o8i+1wf/hYJ2nX0V6KjdY6yMmZEHFMQMzLV0lbi0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:17.159786Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.5528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04d6a98288b8ee927717e22026d10d917fee85e36a0274f4769d89dbe311f460","sha256:d8a47a00bffd5736200906675c212ec8773130a2794dd3cd1f8f283403aa309a"],"state_sha256":"33893e52e65dca1f07da3fbd4023e09e1f5da9c0ce0876f7252598cab4b6b101"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ii+Eb2xg5c2H9vGZRrDkjZ9Bh429Tuo8kN6UxvwNnSKPBp/nAIO1qBe9nl2q9uaKc46ZjDjT9uegtnvVCjWhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:00:37.047081Z","bundle_sha256":"467e0e42f00b4d208591f49896530bdef604bab7ba531d3bafcbafa2dc346119"}}