{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZJ65NTOIEQBLH7X2CID4WHKPCK","short_pith_number":"pith:ZJ65NTOI","schema_version":"1.0","canonical_sha256":"ca7dd6cdc82402b3fefa1207cb1d4f128c1bb7d106b0350bb8ba3ae4bace1196","source":{"kind":"arxiv","id":"1706.04334","version":1},"attestation_state":"computed","paper":{"title":"On Gallai's and Haj\\'os' Conjectures for graphs with treewidth at most 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"F\\'abio Botler, Maycon Sambinelli, Orlando Lee, Rafael S. Coelho","submitted_at":"2017-06-14T07:03:06Z","abstract_excerpt":"A path (resp. cycle) decomposition of a graph $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$. Gallai (1966) conjectured that every graph on $n$ vertices admits a path decomposition of size at most $\\lfloor (n+1)/2\\rfloor$, and Haj\\'os (1968) conjectured that every Eulerian graph on $n$ vertices admits a cycle decomposition of size at most $\\lfloor (n-1)/2\\rfloor$. Gallai's Conjecture was verified for many classes of graphs. In particular, Lov\\'asz (1968) verified this conjecture for graphs with at most one vertex of even degree, and Pyber (1996) verif"},"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.04334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T07:03:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b49064463979d97fb84a68c5d2f10e9267e3aa30b302bf081c05b2d82478c902","abstract_canon_sha256":"75ad6c3a06b526de4379d1dbb081f9c9c3b6a84235126c5fa417e362f2d8d0d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:22.959524Z","signature_b64":"UTGfhGgyIJ8/WbOZzG0UCiM1ZEdDmgyP1snHUtd6N01EcmI8doUhsw7+wCP/FU1vrQSg4mUKd/Vb1l0Yg4aHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca7dd6cdc82402b3fefa1207cb1d4f128c1bb7d106b0350bb8ba3ae4bace1196","last_reissued_at":"2026-05-18T00:42:22.958964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:22.958964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Gallai's and Haj\\'os' Conjectures for graphs with treewidth at most 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"F\\'abio Botler, Maycon Sambinelli, Orlando Lee, Rafael S. Coelho","submitted_at":"2017-06-14T07:03:06Z","abstract_excerpt":"A path (resp. cycle) decomposition of a graph $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$. Gallai (1966) conjectured that every graph on $n$ vertices admits a path decomposition of size at most $\\lfloor (n+1)/2\\rfloor$, and Haj\\'os (1968) conjectured that every Eulerian graph on $n$ vertices admits a cycle decomposition of size at most $\\lfloor (n-1)/2\\rfloor$. Gallai's Conjecture was verified for many classes of graphs. In particular, Lov\\'asz (1968) verified this conjecture for graphs with at most one vertex of even degree, and Pyber (1996) verif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04334","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.04334","created_at":"2026-05-18T00:42:22.959034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04334v1","created_at":"2026-05-18T00:42:22.959034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04334","created_at":"2026-05-18T00:42:22.959034+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJ65NTOIEQBL","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJ65NTOIEQBLH7X2","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJ65NTOI","created_at":"2026-05-18T12:31:59.375834+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/ZJ65NTOIEQBLH7X2CID4WHKPCK","json":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK.json","graph_json":"https://pith.science/api/pith-number/ZJ65NTOIEQBLH7X2CID4WHKPCK/graph.json","events_json":"https://pith.science/api/pith-number/ZJ65NTOIEQBLH7X2CID4WHKPCK/events.json","paper":"https://pith.science/paper/ZJ65NTOI"},"agent_actions":{"view_html":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK","download_json":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK.json","view_paper":"https://pith.science/paper/ZJ65NTOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04334&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJ65NTOIEQBLH7X2CID4WHKPCK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJ65NTOIEQBLH7X2CID4WHKPCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/action/storage_attestation","attest_author":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/action/author_attestation","sign_citation":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/action/citation_signature","submit_replication":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/action/replication_record"}},"created_at":"2026-05-18T00:42:22.959034+00:00","updated_at":"2026-05-18T00:42:22.959034+00:00"}