{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UJPSJI45V5HWSMJIHL34UGRWDF","short_pith_number":"pith:UJPSJI45","schema_version":"1.0","canonical_sha256":"a25f24a39daf4f6931283af7ca1a361978f7595f0ebb1d433afc55e54106645c","source":{"kind":"arxiv","id":"1809.02799","version":1},"attestation_state":"computed","paper":{"title":"A note on the edge partition of graphs containing either a light edge or an alternating 2-cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bei Niu, Xin Zhang","submitted_at":"2018-09-08T13:20:01Z","abstract_excerpt":"Let $\\mathcal{G}_{\\alpha}$ be a hereditary graph class (i.e, every subgraph of $G_{\\alpha}\\in \\mathcal{G}_{\\alpha}$ belongs to $\\mathcal{G}_{\\alpha}$) such that every graph $G_{\\alpha}$ in $\\mathcal{G}_{\\alpha}$ has minimum degree at most 1, or contains either an edge $uv$ such that $d_{G_{\\alpha}}(u)+d_{G_{\\alpha}}(v)\\leq \\alpha$ or a 2-alternating cycle. It is proved that every graph in $\\mathcal{G}_{\\alpha}$ ($\\alpha\\geq 5$) with maximum degree $\\Delta$ can be edge-partitioned into two forests $F_1$, $F_2$ and a subgraph $H$ such that $\\Delta(F_i)\\leq \\max\\{2,\\lceil\\frac{\\Delta-\\alpha+6}{2}"},"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":"1809.02799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-08T13:20:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"95ead7cbb75c18d940a54443f94a6cfe963d2c78f252863f15f8e11ce82976eb","abstract_canon_sha256":"e7d58c02b88a6133fcfc3486ed41428c4256ccc4ab875dbe7ab7919a017ff9cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:15.254181Z","signature_b64":"ZVcitnR/OAhqUt1e3j4cBq74dGFRUv/SFH/zoQRGe9J6ugvpXEfCqtsbpEPjOHSTAJ4IJvuSyxZR7/s1jOypBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a25f24a39daf4f6931283af7ca1a361978f7595f0ebb1d433afc55e54106645c","last_reissued_at":"2026-05-18T00:06:15.253541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:15.253541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the edge partition of graphs containing either a light edge or an alternating 2-cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bei Niu, Xin Zhang","submitted_at":"2018-09-08T13:20:01Z","abstract_excerpt":"Let $\\mathcal{G}_{\\alpha}$ be a hereditary graph class (i.e, every subgraph of $G_{\\alpha}\\in \\mathcal{G}_{\\alpha}$ belongs to $\\mathcal{G}_{\\alpha}$) such that every graph $G_{\\alpha}$ in $\\mathcal{G}_{\\alpha}$ has minimum degree at most 1, or contains either an edge $uv$ such that $d_{G_{\\alpha}}(u)+d_{G_{\\alpha}}(v)\\leq \\alpha$ or a 2-alternating cycle. It is proved that every graph in $\\mathcal{G}_{\\alpha}$ ($\\alpha\\geq 5$) with maximum degree $\\Delta$ can be edge-partitioned into two forests $F_1$, $F_2$ and a subgraph $H$ such that $\\Delta(F_i)\\leq \\max\\{2,\\lceil\\frac{\\Delta-\\alpha+6}{2}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02799","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":"1809.02799","created_at":"2026-05-18T00:06:15.253630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02799v1","created_at":"2026-05-18T00:06:15.253630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02799","created_at":"2026-05-18T00:06:15.253630+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJPSJI45V5HW","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJPSJI45V5HWSMJI","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJPSJI45","created_at":"2026-05-18T12:32:56.356000+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/UJPSJI45V5HWSMJIHL34UGRWDF","json":"https://pith.science/pith/UJPSJI45V5HWSMJIHL34UGRWDF.json","graph_json":"https://pith.science/api/pith-number/UJPSJI45V5HWSMJIHL34UGRWDF/graph.json","events_json":"https://pith.science/api/pith-number/UJPSJI45V5HWSMJIHL34UGRWDF/events.json","paper":"https://pith.science/paper/UJPSJI45"},"agent_actions":{"view_html":"https://pith.science/pith/UJPSJI45V5HWSMJIHL34UGRWDF","download_json":"https://pith.science/pith/UJPSJI45V5HWSMJIHL34UGRWDF.json","view_paper":"https://pith.science/paper/UJPSJI45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02799&json=true","fetch_graph":"https://pith.science/api/pith-number/UJPSJI45V5HWSMJIHL34UGRWDF/graph.json","fetch_events":"https://pith.science/api/pith-number/UJPSJI45V5HWSMJIHL34UGRWDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJPSJI45V5HWSMJIHL34UGRWDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJPSJI45V5HWSMJIHL34UGRWDF/action/storage_attestation","attest_author":"https://pith.science/pith/UJPSJI45V5HWSMJIHL34UGRWDF/action/author_attestation","sign_citation":"https://pith.science/pith/UJPSJI45V5HWSMJIHL34UGRWDF/action/citation_signature","submit_replication":"https://pith.science/pith/UJPSJI45V5HWSMJIHL34UGRWDF/action/replication_record"}},"created_at":"2026-05-18T00:06:15.253630+00:00","updated_at":"2026-05-18T00:06:15.253630+00:00"}