{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XUAIWLUAI5LFFZX7JWHZYL5S2L","short_pith_number":"pith:XUAIWLUA","schema_version":"1.0","canonical_sha256":"bd008b2e80475652e6ff4d8f9c2fb2d2ff8bae199905e0860143c7ee2bb7667a","source":{"kind":"arxiv","id":"1806.09452","version":1},"attestation_state":"computed","paper":{"title":"Minimum degree and size conditions for the proper connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eddie Cheng, Lina Xue, Weihua Yang, Xiaxia Guan","submitted_at":"2018-06-21T12:57:47Z","abstract_excerpt":"An edge-coloured graph $G$ is called $properly$ $connected$ if every two vertices are connected by a proper path. The $proper$ $connection$ $number$ of a connected graph $G$, denoted by $pc(G)$, is the smallest number of colours that are needed in order to make $G$ properly connected. Susan A. van Aardt et al. gave a sufficient condition for the proper connection number to be at most $k$ in terms of the size of graphs. In this note, %optimizes the boundary of the number of edges %we study the $proper$ $connection$ $number$ is under the conditions of adding the minimum degree and optimizing the"},"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":"1806.09452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T12:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"78696285a86f1ba154ddfbde794ca2a41a66993c1e78f879333b5d6b81a4d419","abstract_canon_sha256":"fab2455c62595d62e567fe95f28d583747e8e683085602f2ae90eeeae0bb6c03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:27.239749Z","signature_b64":"uGneDTK04K4u4wgbNfWqq0nkrGXz9QoR+PjEBY/KeBjcRUsP7OXX+ah0+X8Zip+tAiqSrcsaIs1YS8nmnuOUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd008b2e80475652e6ff4d8f9c2fb2d2ff8bae199905e0860143c7ee2bb7667a","last_reissued_at":"2026-05-18T00:12:27.239079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:27.239079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum degree and size conditions for the proper connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eddie Cheng, Lina Xue, Weihua Yang, Xiaxia Guan","submitted_at":"2018-06-21T12:57:47Z","abstract_excerpt":"An edge-coloured graph $G$ is called $properly$ $connected$ if every two vertices are connected by a proper path. The $proper$ $connection$ $number$ of a connected graph $G$, denoted by $pc(G)$, is the smallest number of colours that are needed in order to make $G$ properly connected. Susan A. van Aardt et al. gave a sufficient condition for the proper connection number to be at most $k$ in terms of the size of graphs. In this note, %optimizes the boundary of the number of edges %we study the $proper$ $connection$ $number$ is under the conditions of adding the minimum degree and optimizing the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09452","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":"1806.09452","created_at":"2026-05-18T00:12:27.239186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09452v1","created_at":"2026-05-18T00:12:27.239186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09452","created_at":"2026-05-18T00:12:27.239186+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUAIWLUAI5LF","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUAIWLUAI5LFFZX7","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUAIWLUA","created_at":"2026-05-18T12:33:01.666342+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/XUAIWLUAI5LFFZX7JWHZYL5S2L","json":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L.json","graph_json":"https://pith.science/api/pith-number/XUAIWLUAI5LFFZX7JWHZYL5S2L/graph.json","events_json":"https://pith.science/api/pith-number/XUAIWLUAI5LFFZX7JWHZYL5S2L/events.json","paper":"https://pith.science/paper/XUAIWLUA"},"agent_actions":{"view_html":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L","download_json":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L.json","view_paper":"https://pith.science/paper/XUAIWLUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09452&json=true","fetch_graph":"https://pith.science/api/pith-number/XUAIWLUAI5LFFZX7JWHZYL5S2L/graph.json","fetch_events":"https://pith.science/api/pith-number/XUAIWLUAI5LFFZX7JWHZYL5S2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/action/storage_attestation","attest_author":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/action/author_attestation","sign_citation":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/action/citation_signature","submit_replication":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/action/replication_record"}},"created_at":"2026-05-18T00:12:27.239186+00:00","updated_at":"2026-05-18T00:12:27.239186+00:00"}