{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YOX5I6PNIMIM2UQSCDRUI2XBNR","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":"135694d51b85020c67dd1fde69f9c869698cdb0e7b0dad54752a6a0f375ec6a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T06:02:28Z","title_canon_sha256":"9379f6ac19682ba8b8c556e23d8f0864e0a44f50da24f08af03b3b782369da90"},"schema_version":"1.0","source":{"id":"1611.09500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09500","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09500v1","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09500","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"YOX5I6PNIMIM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YOX5I6PNIMIM2UQS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YOX5I6PN","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:623b5a8dd67e00193f38c081fbfaa5911ba91beadc7be078feb052880da3b641","target":"graph","created_at":"2026-05-18T00:56:18Z","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 path $P$ in an edge-colored graph $G$ is a \\emph{proper path} if no two adjacent edges of $P$ are colored with the same color. The graph $G$ is \\emph{proper connected} if, between every pair of vertices, there exists a proper path in $G$. The \\emph{proper connection number} $pc(G)$ of a connected graph $G$ is defined as the minimum number of colors to make $G$ proper connected. In this paper, we study the degree sum condition for a general graph or a bipartite graph to have proper connection number 2. First, we show that if $G$ is a connected noncomplete graph of order $n\\geq 5$ such that $d","authors_text":"Hong Chang, Xueliang Li, Zhong Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T06:02:28Z","title":"Degree sum conditions for graphs to have proper connection number 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09500","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:e6decf86c5d7166ddb57b74f135b5681d353f1cc90d6473c426d492d27649299","target":"record","created_at":"2026-05-18T00:56:18Z","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":"135694d51b85020c67dd1fde69f9c869698cdb0e7b0dad54752a6a0f375ec6a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T06:02:28Z","title_canon_sha256":"9379f6ac19682ba8b8c556e23d8f0864e0a44f50da24f08af03b3b782369da90"},"schema_version":"1.0","source":{"id":"1611.09500","kind":"arxiv","version":1}},"canonical_sha256":"c3afd479ed4310cd521210e3446ae16c453b7c836dfebf7b6b12d015563c6914","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3afd479ed4310cd521210e3446ae16c453b7c836dfebf7b6b12d015563c6914","first_computed_at":"2026-05-18T00:56:18.280130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:18.280130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cBend8+gbSQfreeqfMkAysFXiOv4afov8oPlMlVXFYqqDQTi7Ia5Dwhs+Ar7vU2I/9Zzoe488kI38egFl8hVBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:18.280854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6decf86c5d7166ddb57b74f135b5681d353f1cc90d6473c426d492d27649299","sha256:623b5a8dd67e00193f38c081fbfaa5911ba91beadc7be078feb052880da3b641"],"state_sha256":"cc409aa26aae9bf23469154ea5b38b5c4954bb0ca4583bf73463b3bfa25101ff"}