{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:573NB5HQDGGCCAH6BEUZC6VUVE","short_pith_number":"pith:573NB5HQ","schema_version":"1.0","canonical_sha256":"eff6d0f4f0198c2100fe0929917ab4a934cfa091f667978be6d6d6354212dd7d","source":{"kind":"arxiv","id":"1601.01365","version":1},"attestation_state":"computed","paper":{"title":"Properties of Catlin's reduced graphs and supereulerian graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mei Lu, Wei-Guo Chen, Zhi-Hong Chen","submitted_at":"2016-01-07T01:27:39Z","abstract_excerpt":"A graph $G$ is called collapsible if for every even subset $R\\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained from $G$ by contracting all the nontrivial collapsible subgraphs. A graph is reduced if it has no nontrivial collapsible subgraphs. In this paper, we first prove a few results on the properties of reduced graphs. As an application, for 3-edge-connected graphs $G$ of order $n$ with $d(u)+d(v)\\ge 2(n/p-1)$ for any $uv\\in E(G)$ where $p>0$ are given, we show how s"},"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":"1601.01365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T01:27:39Z","cross_cats_sorted":[],"title_canon_sha256":"54ed54bd5de982a7c3caea189689eb0c97cb8b85a7bc91ce3dae62307dbde693","abstract_canon_sha256":"235e25fe1a2c9f9d5af8b33466865e4dcc0fd68dc494ac1ed2ecd8f7304df46a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:15.627220Z","signature_b64":"qb+ypaoAklN3gGbnZ0/QM04ddEsdCj/nQssQwp9ma566PrIh8GQxn6dibd0ZwEycvG73vsAjI10S8be0jYNwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eff6d0f4f0198c2100fe0929917ab4a934cfa091f667978be6d6d6354212dd7d","last_reissued_at":"2026-05-18T01:23:15.626674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:15.626674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Properties of Catlin's reduced graphs and supereulerian graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mei Lu, Wei-Guo Chen, Zhi-Hong Chen","submitted_at":"2016-01-07T01:27:39Z","abstract_excerpt":"A graph $G$ is called collapsible if for every even subset $R\\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained from $G$ by contracting all the nontrivial collapsible subgraphs. A graph is reduced if it has no nontrivial collapsible subgraphs. In this paper, we first prove a few results on the properties of reduced graphs. As an application, for 3-edge-connected graphs $G$ of order $n$ with $d(u)+d(v)\\ge 2(n/p-1)$ for any $uv\\in E(G)$ where $p>0$ are given, we show how s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01365","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":"1601.01365","created_at":"2026-05-18T01:23:15.626748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01365v1","created_at":"2026-05-18T01:23:15.626748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01365","created_at":"2026-05-18T01:23:15.626748+00:00"},{"alias_kind":"pith_short_12","alias_value":"573NB5HQDGGC","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"573NB5HQDGGCCAH6","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"573NB5HQ","created_at":"2026-05-18T12:29:58.707656+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/573NB5HQDGGCCAH6BEUZC6VUVE","json":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE.json","graph_json":"https://pith.science/api/pith-number/573NB5HQDGGCCAH6BEUZC6VUVE/graph.json","events_json":"https://pith.science/api/pith-number/573NB5HQDGGCCAH6BEUZC6VUVE/events.json","paper":"https://pith.science/paper/573NB5HQ"},"agent_actions":{"view_html":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE","download_json":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE.json","view_paper":"https://pith.science/paper/573NB5HQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01365&json=true","fetch_graph":"https://pith.science/api/pith-number/573NB5HQDGGCCAH6BEUZC6VUVE/graph.json","fetch_events":"https://pith.science/api/pith-number/573NB5HQDGGCCAH6BEUZC6VUVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE/action/storage_attestation","attest_author":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE/action/author_attestation","sign_citation":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE/action/citation_signature","submit_replication":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE/action/replication_record"}},"created_at":"2026-05-18T01:23:15.626748+00:00","updated_at":"2026-05-18T01:23:15.626748+00:00"}