{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7NTACYMMTLJPS5NZFBPH7PMTAB","short_pith_number":"pith:7NTACYMM","schema_version":"1.0","canonical_sha256":"fb6601618c9ad2f975b9285e7fbd93006538c96d2ef5002b4599d11757a12953","source":{"kind":"arxiv","id":"1706.04130","version":1},"attestation_state":"computed","paper":{"title":"On Gallai's conjecture for series-parallel graphs and planar 3-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andr\\'e Schulz, Lena Schlipf, Philipp Kindermann","submitted_at":"2017-06-13T15:36:20Z","abstract_excerpt":"A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected $n$-vertex graph has a path cover with at most $\\lceil n/2 \\rceil$ paths. We prove Gallai's conjecture for series-parallel graphs. For the class of planar 3-trees we show how to construct a path cover with at most $\\lfloor 5n/8 \\rfloor$ paths, which is an improvement over the best previously known bound of $\\lfloor 2n/3 \\rfloor$."},"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":"1706.04130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-13T15:36:20Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a5f994cb16cfce04d045c8fc537aa414a5e40d4b1d1984479215da97f0b09527","abstract_canon_sha256":"bba1ec57ea0695b69125ae7107b47450dfddd877e9d4f21f14651e7c6caca34e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:24.444119Z","signature_b64":"QZsLljqYwXEgbv8ymmwBtoJHSbBRy83XBGFxYKKxxdoekHpS1GflfJ/WM8kh5gbx87oeyY+beovfc6jK20KODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb6601618c9ad2f975b9285e7fbd93006538c96d2ef5002b4599d11757a12953","last_reissued_at":"2026-05-18T00:42:24.443550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:24.443550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Gallai's conjecture for series-parallel graphs and planar 3-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andr\\'e Schulz, Lena Schlipf, Philipp Kindermann","submitted_at":"2017-06-13T15:36:20Z","abstract_excerpt":"A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected $n$-vertex graph has a path cover with at most $\\lceil n/2 \\rceil$ paths. We prove Gallai's conjecture for series-parallel graphs. For the class of planar 3-trees we show how to construct a path cover with at most $\\lfloor 5n/8 \\rfloor$ paths, which is an improvement over the best previously known bound of $\\lfloor 2n/3 \\rfloor$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04130","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.04130","created_at":"2026-05-18T00:42:24.443619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04130v1","created_at":"2026-05-18T00:42:24.443619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04130","created_at":"2026-05-18T00:42:24.443619+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NTACYMMTLJP","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NTACYMMTLJPS5NZ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NTACYMM","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7NTACYMMTLJPS5NZFBPH7PMTAB","json":"https://pith.science/pith/7NTACYMMTLJPS5NZFBPH7PMTAB.json","graph_json":"https://pith.science/api/pith-number/7NTACYMMTLJPS5NZFBPH7PMTAB/graph.json","events_json":"https://pith.science/api/pith-number/7NTACYMMTLJPS5NZFBPH7PMTAB/events.json","paper":"https://pith.science/paper/7NTACYMM"},"agent_actions":{"view_html":"https://pith.science/pith/7NTACYMMTLJPS5NZFBPH7PMTAB","download_json":"https://pith.science/pith/7NTACYMMTLJPS5NZFBPH7PMTAB.json","view_paper":"https://pith.science/paper/7NTACYMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04130&json=true","fetch_graph":"https://pith.science/api/pith-number/7NTACYMMTLJPS5NZFBPH7PMTAB/graph.json","fetch_events":"https://pith.science/api/pith-number/7NTACYMMTLJPS5NZFBPH7PMTAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NTACYMMTLJPS5NZFBPH7PMTAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NTACYMMTLJPS5NZFBPH7PMTAB/action/storage_attestation","attest_author":"https://pith.science/pith/7NTACYMMTLJPS5NZFBPH7PMTAB/action/author_attestation","sign_citation":"https://pith.science/pith/7NTACYMMTLJPS5NZFBPH7PMTAB/action/citation_signature","submit_replication":"https://pith.science/pith/7NTACYMMTLJPS5NZFBPH7PMTAB/action/replication_record"}},"created_at":"2026-05-18T00:42:24.443619+00:00","updated_at":"2026-05-18T00:42:24.443619+00:00"}