{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:573NB5HQDGGCCAH6BEUZC6VUVE","short_pith_number":"pith:573NB5HQ","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"},"canonical_sha256":"eff6d0f4f0198c2100fe0929917ab4a934cfa091f667978be6d6d6354212dd7d","source":{"kind":"arxiv","id":"1601.01365","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01365","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01365v1","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01365","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"573NB5HQDGGC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"573NB5HQDGGCCAH6","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"573NB5HQ","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:573NB5HQDGGCCAH6BEUZC6VUVE","target":"record","payload":{"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"},"canonical_sha256":"eff6d0f4f0198c2100fe0929917ab4a934cfa091f667978be6d6d6354212dd7d","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"},"source_kind":"arxiv","source_id":"1601.01365","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-18T01:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5k4xdML8641XyucZp2Oc3D8tn5w7lSaJ8k7Ig/PkHABDLzKbV/gTGl8FaHQj09/LbGv1+9W6dBji55bLmY1IDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:31:17.846542Z"},"content_sha256":"8331314093c83616f1b64b1016b890f95b1eb16717b9ab043cd9994be76f6c7f","schema_version":"1.0","event_id":"sha256:8331314093c83616f1b64b1016b890f95b1eb16717b9ab043cd9994be76f6c7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:573NB5HQDGGCCAH6BEUZC6VUVE","target":"graph","payload":{"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"},"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-18T01:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68pwsLOyXB3RifwoM3AxVZP2u6tv41GJH/2S4h0vK/eEqLAuPEa81R3Mf15p2vqC1TVTpB+zV9ALSkDTodBcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:31:17.846979Z"},"content_sha256":"025a753b2ca2fe2e46950175995109123e2aa962c607df0689dac2ee72006edd","schema_version":"1.0","event_id":"sha256:025a753b2ca2fe2e46950175995109123e2aa962c607df0689dac2ee72006edd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE/bundle.json","state_url":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/573NB5HQDGGCCAH6BEUZC6VUVE/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-06-30T18:31:17Z","links":{"resolver":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE","bundle":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE/bundle.json","state":"https://pith.science/pith/573NB5HQDGGCCAH6BEUZC6VUVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/573NB5HQDGGCCAH6BEUZC6VUVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:573NB5HQDGGCCAH6BEUZC6VUVE","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":"235e25fe1a2c9f9d5af8b33466865e4dcc0fd68dc494ac1ed2ecd8f7304df46a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T01:27:39Z","title_canon_sha256":"54ed54bd5de982a7c3caea189689eb0c97cb8b85a7bc91ce3dae62307dbde693"},"schema_version":"1.0","source":{"id":"1601.01365","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01365","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01365v1","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01365","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"573NB5HQDGGC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"573NB5HQDGGCCAH6","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"573NB5HQ","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:025a753b2ca2fe2e46950175995109123e2aa962c607df0689dac2ee72006edd","target":"graph","created_at":"2026-05-18T01:23:15Z","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":"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","authors_text":"Mei Lu, Wei-Guo Chen, Zhi-Hong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T01:27:39Z","title":"Properties of Catlin's reduced graphs and supereulerian graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01365","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:8331314093c83616f1b64b1016b890f95b1eb16717b9ab043cd9994be76f6c7f","target":"record","created_at":"2026-05-18T01:23:15Z","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":"235e25fe1a2c9f9d5af8b33466865e4dcc0fd68dc494ac1ed2ecd8f7304df46a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T01:27:39Z","title_canon_sha256":"54ed54bd5de982a7c3caea189689eb0c97cb8b85a7bc91ce3dae62307dbde693"},"schema_version":"1.0","source":{"id":"1601.01365","kind":"arxiv","version":1}},"canonical_sha256":"eff6d0f4f0198c2100fe0929917ab4a934cfa091f667978be6d6d6354212dd7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eff6d0f4f0198c2100fe0929917ab4a934cfa091f667978be6d6d6354212dd7d","first_computed_at":"2026-05-18T01:23:15.626674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:15.626674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qb+ypaoAklN3gGbnZ0/QM04ddEsdCj/nQssQwp9ma566PrIh8GQxn6dibd0ZwEycvG73vsAjI10S8be0jYNwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:15.627220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01365","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8331314093c83616f1b64b1016b890f95b1eb16717b9ab043cd9994be76f6c7f","sha256:025a753b2ca2fe2e46950175995109123e2aa962c607df0689dac2ee72006edd"],"state_sha256":"093b62612bed42ba4b6913b8d8b4c4a4e305666f0a2a68ac4f726ad149051d56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FYi4DZ2G8EoLH0o7YNidB1MK1Zs+StdPZBoVzfPR11ccGMtc6JgdAgGeLoT/JgK1bMnLOUivpTNWX5djHFPzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T18:31:17.848915Z","bundle_sha256":"9037f147a2422d8a02f8ed0139030932d46e9fdbb69e211fed8d7304a302de75"}}