{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EMTOYUARGF4RCOHKC6EPHQWDH5","short_pith_number":"pith:EMTOYUAR","schema_version":"1.0","canonical_sha256":"2326ec501131791138ea1788f3c2c33f66567f1cb54539794602077d743629ae","source":{"kind":"arxiv","id":"1601.04162","version":3},"attestation_state":"computed","paper":{"title":"Solution to a conjecture on the proper connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Fei Huang, Xueliang Li, Zhongmei Qin","submitted_at":"2016-01-16T13:52:20Z","abstract_excerpt":"A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of $G$ is connected by at least one proper path in $G$. Recently, Li and Magnant in [Theory Appl. Graphs 0(1)(2015), Art.2] posed the following conjecture: If $G$ is a connected noncomplete graph of order $n \\geq 5$ and minimum degree $\\delta(G) \\geq n/4$, then $pc(G)=2$. In this paper, we show that t"},"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.04162","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-16T13:52:20Z","cross_cats_sorted":[],"title_canon_sha256":"3f76e377e5d78d18c51a752942a64f32f771ae9d27dfb5d26fd12f652b33c0d2","abstract_canon_sha256":"6c1ae6eb33ae0f0993f5a0269ed34b5d9b3612d0e42a38812e0cabec480166f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:03.198538Z","signature_b64":"1SUGVtONKCZIxZhU7gO8lhZ3M9wzi9dam486X1Fn22LU7uMZVijAYLYweM45km4PlirT2N+qrt765u614Lt7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2326ec501131791138ea1788f3c2c33f66567f1cb54539794602077d743629ae","last_reissued_at":"2026-05-18T01:20:03.197902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:03.197902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solution to a conjecture on the proper connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Fei Huang, Xueliang Li, Zhongmei Qin","submitted_at":"2016-01-16T13:52:20Z","abstract_excerpt":"A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of $G$ is connected by at least one proper path in $G$. Recently, Li and Magnant in [Theory Appl. Graphs 0(1)(2015), Art.2] posed the following conjecture: If $G$ is a connected noncomplete graph of order $n \\geq 5$ and minimum degree $\\delta(G) \\geq n/4$, then $pc(G)=2$. In this paper, we show that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04162","kind":"arxiv","version":3},"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.04162","created_at":"2026-05-18T01:20:03.198019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04162v3","created_at":"2026-05-18T01:20:03.198019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04162","created_at":"2026-05-18T01:20:03.198019+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMTOYUARGF4R","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMTOYUARGF4RCOHK","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMTOYUAR","created_at":"2026-05-18T12:30:12.583610+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/EMTOYUARGF4RCOHKC6EPHQWDH5","json":"https://pith.science/pith/EMTOYUARGF4RCOHKC6EPHQWDH5.json","graph_json":"https://pith.science/api/pith-number/EMTOYUARGF4RCOHKC6EPHQWDH5/graph.json","events_json":"https://pith.science/api/pith-number/EMTOYUARGF4RCOHKC6EPHQWDH5/events.json","paper":"https://pith.science/paper/EMTOYUAR"},"agent_actions":{"view_html":"https://pith.science/pith/EMTOYUARGF4RCOHKC6EPHQWDH5","download_json":"https://pith.science/pith/EMTOYUARGF4RCOHKC6EPHQWDH5.json","view_paper":"https://pith.science/paper/EMTOYUAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04162&json=true","fetch_graph":"https://pith.science/api/pith-number/EMTOYUARGF4RCOHKC6EPHQWDH5/graph.json","fetch_events":"https://pith.science/api/pith-number/EMTOYUARGF4RCOHKC6EPHQWDH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMTOYUARGF4RCOHKC6EPHQWDH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMTOYUARGF4RCOHKC6EPHQWDH5/action/storage_attestation","attest_author":"https://pith.science/pith/EMTOYUARGF4RCOHKC6EPHQWDH5/action/author_attestation","sign_citation":"https://pith.science/pith/EMTOYUARGF4RCOHKC6EPHQWDH5/action/citation_signature","submit_replication":"https://pith.science/pith/EMTOYUARGF4RCOHKC6EPHQWDH5/action/replication_record"}},"created_at":"2026-05-18T01:20:03.198019+00:00","updated_at":"2026-05-18T01:20:03.198019+00:00"}